Optimal Multi-Robot Path Planning on Graphs: Structure and Computational Complexity

We study the problem of optimal multi-robot path planning on graphs (MPP) over four distinct minimization objectives: the total arrival time, the makespan (last arrival time), the total distance, and the maximum (single-robot traveled) distance. On the structure side, we show that each pair of these four objectives induces a Pareto front and cannot always be optimized simultaneously. Then, through reductions from 3-SAT, we further establish that computation over each objective is an NP-hard task, providing evidence that solving MPP optimally is generally intractable. Nevertheless, in a related paper, we design complete algorithms and efficient heuristics for optimizing all four objectives, capable of solving MPP optimally or near-optimally for hundreds of robots in challenging setups.

[1]  Steven M. LaValle,et al.  Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics , 2015, IEEE Transactions on Robotics.

[2]  Manfred K. Warmuth,et al.  NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..

[3]  Pavel Surynek,et al.  An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

[4]  Oded Goldreich.  Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard , 2011, Studies in Complexity and Cryptography.

[5]  Richard E. Korf,et al.  Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

[6]  Nathan R. Sturtevant,et al.  A new approach to cooperative pathfinding , 2008, AAMAS.

[7]  Steven M. LaValle,et al.  Multi-agent Path Planning and Network Flow , 2012, WAFR.

[8]  Kostas E. Bekris,et al.  Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees , 2011, IJCAI.

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

[10]  Daniela Rus,et al.  Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms , 2012, WAFR.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Steven M. LaValle,et al.  Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs , 2013, AAAI.

[13]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[14]  D A N I E L R A T N E R A N D M A N F R E D W A R M,et al.  The ( n 2-1 )-Puzzle and Related Relocation Problems , 2008 .

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

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

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