Prioritized motion planning for multiple robots

In this paper we address the problem of motion planning for multiple robots. We introduce a prioritized method, based on a powerful method for motion planning in dynamic environments, recently developed by the authors. Our approach is generically applicable: there is no limitation on the number of degrees of freedom of each of the robots, and robots of various types - for instance free-flying robots and articulated robots - can be used simultaneously. Results show that high-quality paths can be produced in less than a second of computation time, even in confined environments involving many robots. We examine three issues in particular in this paper: the assignment of priorities to the robots, the performance of prioritized planning versus coordinated planning, and the influence of the extent by which the robot motions are constrained on the performance of the method. Results are reported in terms of both running time and the quality of the paths produced.

[1]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[2]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[4]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[5]  Thierry Fraichard,et al.  Trajectory planning in a dynamic workspace: a 'state-time space' approach , 1998, Adv. Robotics.

[6]  Christopher M. Clark,et al.  Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems , 2002, Proceedings, IEEE Aerospace Conference.

[7]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

[8]  Wolfram Burgard,et al.  Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots , 2002, PuK.

[9]  Jean-Claude Latombe,et al.  Using a PRM planner to compare centralized and decoupled planning for multi-robot systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[10]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[11]  Srinivas Akella,et al.  Coordinating the motions of multiple robots with kinodynamic constraints , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[12]  Gino van den Bergen.  Collision Detection in Interactive 3D Environments , 2003 .

[13]  Srinivas Akella,et al.  Time-scaled coordination of multiple manipulators , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  Jason M. O'Kane,et al.  Pareto Optimal Coordination on Roadmaps , 2004, WAFR.

[15]  Mark H. Overmars,et al.  Useful cycles in probabilistic roadmap graphs , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[16]  Mark H. Overmars,et al.  Roadmap-based motion planning in dynamic environments , 2004, IEEE Transactions on Robotics.

[17]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 2005, Algorithmica.

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