A new Bug-type navigation algorithm considering practical implementation issues for mobile robots

A new Bug-type algorithm is proposed in this paper for the navigation of mobile robots. Unlike the related works which mainly focus on the theoretical analysis while ignoring the implementation issues, the new method presents not only an abstract concept which shortens the path length comparing with some previous works in the premise of guaranteeing convergence by its new switching conditions, but also a lower layer approach to realize its concept by keeping a safe distance to obstacles for collision avoidance. Simulation studies show that the new method generates shorter path than the classical Bug2 algorithm and a recent work termed as Bug2+. Experiment results on a real Pioneer3-AT robot further verify its practicability.

[1]  Howie Choset,et al.  Sensor based planning. II. Incremental construction of the generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[2]  Alberto Ortiz,et al.  A Bug-inspired algorithm for efficient anytime path planning , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[4]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .

[5]  Song Jing-yan.  Path planning for nonholonomic mobile robots using artificial potential field method , 2010 .

[6]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[7]  Reid G. Simmons,et al.  The curvature-velocity method for local obstacle avoidance , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[8]  Koren,et al.  Real-Time Obstacle Avoidance for Fast Mobile Robots , 2022 .

[9]  Howie Choset,et al.  Sensor Based Planing, Part II: Incremental COnstruction of the Generalized Voronoi Graph , 1995, ICRA.

[10]  Yoshio Yamamoto,et al.  Path planning of wheeled mobile robot with simultaneous free space locating capability , 2009, Intell. Serv. Robotics.

[11]  Javier Minguez,et al.  Nearness diagram (ND) navigation: collision avoidance in troublesome scenarios , 2004, IEEE Transactions on Robotics and Automation.

[12]  Thomas Bräunl,et al.  Performance Comparison of Bug Navigation Algorithms , 2007, J. Intell. Robotic Syst..

[13]  Iwan Ulrich,et al.  VFH/sup */: local obstacle avoidance with look-ahead verification , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[14]  Saïd Zeghloul,et al.  A mobile robot navigation method using a fuzzy logic approach , 1995, Robotica.

[15]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[16]  G. Swaminathan.  Robot Motion Planning , 2006 .

[17]  Elon Rimon,et al.  Construction of C-space roadmaps from local sensory data. What should the sensors look for? , 1994, Algorithmica.