Motion Planning for Multiple Unit-Ball Robots in ℝd

We present a decoupled algorithm for motion planning for a collection of unit-balls moving among polyhedral obstacles in R, for any d > 2. We assume that the robots have revolving areas in the vicinity of their start and target positions: Revolving areas are regions where robots can maneuver in order to give way to another moving robot. Given that this assumption is fulfilled, the algorithm is complete, namely it is guaranteed to find a solution or report that none exists. A key goal in our design is to make the revolving areas as economical as possible and in particular to allow different revolving areas to overlap. This makes the analysis rather involved but in return makes the algorithm conceptually fairly simple. We show that for the case of m unit-discs moving among polygonal obstacles of total complexity n in R, the algorithm can be executed in O(nm+m(m+n) log(m+n)) time. We implemented the algorithm for this case and tested it on several scenarios, for which we show experimental results for up to 1000 robots. Finally, we address the problem of choosing the order of execution of the paths in decoupled algorithms that locally solve interferences and show that finding the optimal order of execution is NP-hard. This motivated us to develop a heuristic for choosing the order; we describe the heuristic and demonstrate its effectiveness in certain scenarios.

[1]  Erik D. Demaine,et al.  PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..

[2]  Bo Gao,et al.  Pareto-optimal coordination of multiple robots with safety guarantees , 2011, Autonomous Robots.

[3]  Paul G. Spirakis,et al.  Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[4]  Vijay Kumar,et al.  Concurrent assignment and planning of trajectories for large teams of interchangeable robots , 2013, 2013 IEEE International Conference on Robotics and Automation.

[5]  Howie Choset,et al.  Subdimensional expansion for multirobot path planning , 2015, Artif. Intell..

[6]  Erik D. Demaine,et al.  Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch , 2018, SoCG.

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

[8]  James H. Davenport.  A :20piano movers' ' , 1986, SIGS.

[9]  Dan Halperin,et al.  Motion Planning for Unlabeled Discs with Optimality Guarantees , 2015, Robotics: Science and Systems.

[10]  Jan Faigl,et al.  Asynchronous decentralized prioritized planning for coordination in multi-robot system , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  E. Freund,et al.  Real-Time Pathfinding in Multirobot Systems Including Obstacle Avoidance , 1988, Int. J. Robotics Res..

[12]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.

[13]  Mark de Berg,et al.  Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons , 2013, IEEE Transactions on Automation Science and Engineering.

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

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  Micha Sharir,et al.  Coordinated motion planning for two independent robots , 1991, SCG '88.

[17]  Chee Yap,et al.  Coordinating the Motion of Several Discs , 2011 .

[18]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[19]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

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

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

[22]  Dan Halperin,et al.  On the hardness of unlabeled multi-robot motion planning , 2014, Int. J. Robotics Res..

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

[24]  Jingjin Yu,et al.  Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time , 2018, Robotics: Science and Systems.

[25]  Harry G. Mairson,et al.  Reporting and Counting Intersections Between Two Sets of Line Segments , 1988 .