Decentralized prioritized planning in large multirobot teams

In this paper, we address the problem of distributed path planning for large teams of hundreds of robots in constrained environments. We introduce two distributed prioritized planning algorithms: an efficient, complete method which is shown to converge to the centralized prioritized planner solution, and a sparse method in which robots discover collisions probabilistically. Planning is divided into a number of iterations, during which every robot simultaneously and independently computes a planning solution based on other robots' path information from the previous iteration. Paths are exchanged in ways that exploit the cooperative nature of the team and a statistical phenomenon known as the “birthday paradox”. Performance is measured in simulated 2D environments with teams of up to 240 robots. We find that in moderately constrained environments, these methods generate solutions of similar quality to a centralized prioritized planner, but display interesting communication and planning time characteristics.

[1]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

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

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

[4]  Dinesh Manocha,et al.  Centralized path planning for multiple robots: Optimal decoupling into sequential plans , 2009, Robotics: Science and Systems.

[5]  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 .

[6]  John F. Canny,et al.  A motion planner for multiple mobile robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[7]  Lynne E. Parker,et al.  Path Planning and Motion Coordination in Multiple Mobile Robot Teams , 2009 .

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

[9]  Jun Ota,et al.  Multirobot motion coordination in space and time , 1998, Robotics Auton. Syst..

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

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

[12]  Boris Aronov,et al.  Motion Planning for Multiple Robots , 1998, SCG '98.

[13]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

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

[15]  Malcolm Ross Kinsella Ryan.  Exploiting Subgraph Structure in Multi-Robot Path Planning , 2008, J. Artif. Intell. Res..

[16]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[17]  Wensen Chang,et al.  A decentralized approach to the conflict-free motion planning for multiple mobile robots , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[18]  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.

[19]  Günther Schmidt,et al.  Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation , 1997, Proceedings of International Conference on Robotics and Automation.

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

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

[22]  Srinivas Akella,et al.  Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths , 2005, Int. J. Robotics Res..

[23]  Yi Guo,et al.  A distributed and optimal motion planning approach for multiple mobile robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[24]  David Furcy,et al.  Incremental Heuristic Search in AI , 2004, AI Mag..

[25]  Mark H. Overmars,et al.  Prioritized motion planning for multiple robots , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[26]  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).

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

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

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