Faster Implementation of The Dynamic Window Approach Based on Non-Discrete Path Representation
Ziang Lin, Ryo Taguchi
Abstract
The dynamic window approach (DWA) serves as a pivotal collision avoidance strategy for mobile robots, meticulously guiding a robot to its target while ensuring a safe distance from any perceivable obstacles in the vicinity. While the DWA has seen various enhancements and applications, its foundational computational process has predominantly remained constant, consequently resulting in a heightened level of time complexity. Inspired by the velocity invariance assumption inherent in the DWA and the utilization of polar coordinate transformations in the model, we introduce a high-speed version of the DWA.
Topics & Concepts
Representation (politics)Computer scienceProcess (computing)Window (computing)Path (computing)Constant (computer programming)RobotCollisionMotion planningAlgorithmControl theory (sociology)Artificial intelligenceLawControl (management)Operating systemComputer securityPoliticsPolitical scienceProgramming languageRobotic Path Planning AlgorithmsRobotics and Sensor-Based LocalizationRobotic Locomotion and Control