Multiple Path Coordination for Mobile Robots: A Geometric Algorithm

This paper presents a geometric based approach for multiple mobile robot motion coordination. All the robot paths being computed independently, we address the problem of coordinating the motion of the robots along their own path in such a way they do not collide each other. The proposed algorithm is based on a bounding box representation of the obstacles in the so-called coordination diagram. The algorithm is resolution-complete. Its efficiency is illustrated by examples involving more than 100 robots.

[1]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[2]  Thierry Siméon,et al.  A collision checker for car-like robots coordination , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[3]  Jihong Lee,et al.  A minimum-time trajectory planning method for two robots , 1992, IEEE Trans. Robotics Autom..

[4]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[5]  Hongyan Wang,et al.  Social potential fields: A distributed behavioral control for autonomous robots , 1995, Robotics Auton. Syst..

[6]  Stephane Leroy.  Outils geometriques pour la planification de chemins de robots mobiles non holonomes , 1998 .

[7]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..

[8]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[9]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  John F. Canny,et al.  Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[11]  Rachid Alami,et al.  Multi-robot cooperation through incremental plan-merging , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[12]  Jean-Claude Latombe.  A Fast Path Planner for a Car-Like Indoor Mobile Robot , 1991, AAAI.

[13]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[14]  Myung Jin Chung,et al.  Collision avoidance of two general robot manipulators by minimum delay time , 1994, IEEE Trans. Syst. Man Cybern..

[15]  Andrew B. Kahng,et al.  Cooperative Mobile Robotics: Antecedents and Directions , 1997, Auton. Robots.

[16]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[17]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[18]  Charles W. Warren,et al.  Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[19]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.