Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds

We investigate the multi-agent pathfinding (MAPF) problem with n agents on graphs with n vertices: Each agent has a unique start and goal vertex, with the objective of moving all agents in parallel movements to their goal s.t. each vertex and each edge may only be used by one agent at a time. We give a combinatorial classification of all graphs where this problem is solvable in general, including cases where the solvability depends on the initial agent placement.

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

[2]  Nuria Pelechano,et al.  Evacuation simulation models: challenges in modeling high rise building evacuation with cellular automata approaches , 2008 .

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

[4]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[5]  Malte Helmert,et al.  Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984) , 2012, SOCS.

[6]  James R. Driscoll,et al.  On the diameter of permutation groups , 1983, STOC.

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

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

[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]  Mark H. Overmars,et al.  Coordinated path planning for multiple robots , 1998, Robotics Auton. Syst..

[12]  公庄 庸三.  Basic Algebra = 代数学入門 , 2002 .

[13]  Satoshi Matsuoka,et al.  Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing , 2016, HPDC.

[14]  Remington Scott.  Sparking life: notes on the performance capture sessions for the Lord of the Rings: the Two Towers , 2003, COMG.

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

[16]  W. W. Johnson,et al.  Notes on the "15" Puzzle , 1879 .

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.