k-color multi-robot motion planning

We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to a specific target, but rather to some target placement that is assigned to its group. We call this problem k-color multi-robot motion planning and provide a sampling-based algorithm specifically designed for solving it. At the heart of the algorithm is a novel technique where the k-color problem is reduced to several discrete multi-robot motion planning problems. These reductions amplify basic samples into massive collections of free placements and paths for the robots. We demonstrate the performance of the algorithm by an implementation for the case of disc robots and polygonal robots translating in the plane. We show that the algorithm successfully and efficiently copes with a variety of challenging scenarios, involving many robots, while a simplified version of this algorithm, that can be viewed as an extension of a prevalent sampling-based algorithm for the k-color case, fails even on simple scenarios. Interestingly, our algorithm outperforms a well established implementation of PRM for the standard multi-robot problem, in which each robot has a distinct color.

[1]  Madhu Sudan,et al.  Motion Planning on a Graph (Extended Abstract) , 1994, FOCS 1994.

[2]  Kostas E. Bekris,et al.  OOPS for Motion Planning: An Online, Open-source, Programming System , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[3]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[4]  Howie Choset,et al.  M*: A complete multirobot path planning algorithm with performance bounds , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Jim Law,et al.  Review of "The boost graph library: user guide and reference manual by Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine." Addison-Wesley 2002. , 2003, SOEN.

[6]  Kostas E. Bekris,et al.  Efficient and complete centralized multi-robot path planning , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Dan HalperinS.  Hybrid Motion Planning: Coordinating Two Discs Moving Among Polygonal Obstacles in the Plane , 2002 .

[8]  Adrien Treuille,et al.  Continuum crowds , 2006, SIGGRAPH 2006.

[9]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[10]  G. Beni,et al.  A Torque-Sensitive Tactile Array for Robotics , 1983 .

[11]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[12]  Richard M. Wilson,et al.  Graph puzzles, homotopy, and the alternating group☆ , 1974 .

[13]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[14]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[15]  Dan Halperin,et al.  CGAL Arrangements and Their Applications - A Step-by-Step Guide , 2012, Geometry and Computing.

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

[17]  Samuel Loyd,et al.  Mathematical Puzzles of Sam Loyd , 1959 .

[18]  Martin Barland.  Motion Planning Framework for Industrial Manipulators using the Open Motion Planning Library (OMPL) , 2012 .

[19]  János Pach,et al.  Reconfigurations in Graphs and Grids , 2008, SIAM J. Discret. Math..

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

[21]  Paul G. Spirakis,et al.  Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.

[22]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.

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

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

[25]  Dan Halperin,et al.  k-Color Multi-robot Motion Planning , 2012, WAFR.

[26]  Thierry Siméon,et al.  Multiple Path Coordination for Mobile Robots: A Geometric Algorithm , 1999, IJCAI.

[27]  Nancy M. Amato,et al.  Roadmap-based flocking for complex environments , 2002, 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings..

[28]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[29]  R. J. Schilling,et al.  Decoupling of a Two-Axis Robotic Manipulator Using Nonlinear State Feedback: A Case Study , 1984 .

[30]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

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

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

[34]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[35]  Mimmo Parente,et al.  A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees , 1996, SWAT.

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

[37]  Dinesh Manocha,et al.  Reciprocal Velocity Obstacles for real-time multi-agent navigation , 2008, 2008 IEEE International Conference on Robotics and Automation.

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

[39]  Howie Choset,et al.  Probabilistic path planning for multiple robots with subdimensional expansion , 2012, 2012 IEEE International Conference on Robotics and Automation.

[40]  Steven M. LaValle,et al.  Distance optimal formation control on graphs with a tight convergence time guarantee , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[41]  Dan Halperin,et al.  Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane , 2002, WAFR.

[42]  Refael Hassin,et al.  Multi-Color Pebble Motion on Graphs , 2009, Algorithmica.