Wide Range Global Path Planning for a Large Number of Networked Mobile Robots Based on Generalized Voronoi Diagrams

Abstract This work aims to solving global path planning for multiple mobile robots. In order to get a collision free path, an accurate map model is always essential. A roadmap is made based on the generalized voronoi diagram (GVD), which is created with a new proposed voronoi based parallel thinning (VPT) algorithm. Based on the GVD roadmap, a new multiple mobile robot path planning algorithm, electric circuit based path planning (ECPP), is proposed. ECPP is applicable for large number of mobile robots global path planning in large space, it can efficiently avoid the possibilities of traffic jams, so that the whole multi-robot system can work properly.

[1]  Fabio M. Marchese,et al.  Multiple Mobile Robots Path-Planning with MCA , 2006, International Conference on Autonomic and Autonomous Systems (ICAS'06).

[2]  Bernardo Wagner,et al.  Dynamic path planning for coordinated motion of multiple mobile robots , 2011, 2011 14th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[3]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[4]  Wolfram Burgard,et al.  Improved updating of Euclidean distance maps and Voronoi diagrams , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[6]  Wolfram Burgard,et al.  Optimizing schedules for prioritized path planning of multi-robot systems , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[7]  Frank Y. Shih,et al.  Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood , 2004, Comput. Vis. Image Underst..

[8]  Christopher M. Clark,et al.  Motion Planning for Multiple Mobile Robot Systems using Dynamic Networks , 2003 .

[9]  Nirmal Baran Hui,et al.  Coordinated motion planning of multiple mobile robots using potential field method , 2010, 2010 International Conference on Industrial Electronics, Control and Robotics.

[10]  Jean-Claude Latombe,et al.  Motion planning for multiple mobile robots using dynamic networks , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[11]  Benoit M. Macq,et al.  Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods , 1999, Comput. Vis. Image Underst..