A PROVABLY CONVERGENT DYNAMIC WINDOW APPROACH TO OBSTACLE AVOIDANCE

Abstract The dynamic window approach is a well known navigation scheme developed in Fox et al. (1997) and extended in Brock and Khatib (1999). It is safe by construction and has been shown to perform very efficiently in experimental setups. However, one can construct examples where the proposed scheme fails to attain the goal configuration. What has been lacking is a theoretical treatment of the algorithm's convergence properties. Here we present such a treatment. Furthermore, we highlight the similarity between the Dynamic Window Approach and the Control Lyapunov Function and Receding Horizon Control synthesis put forth by Primbs et al. (1999). Inspired by these similarities we propose a version of the Dynamic Window Approach that is provably convergent.

[1]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[2]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[3]  Oliver Brock,et al.  High-speed navigation using the global dynamic window approach , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[4]  Randal W. Beard,et al.  A decentralized approach to elementary formation manoeuvres , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  Randal W. Beard,et al.  A decentralized approach to formation maneuvers , 2003, IEEE Trans. Robotics Autom..