The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True
Not on the map. Why?
Abstract (arXiv)
The determination of the computational complexity of multi-agent pathfinding on directed graphs (diMAPF) has been an open research problem for many years. While diMAPF has been shown to be polynomial for some special cases, only recently, it has been established that the problem is NP-hard in general. Further, it has been proved that diMAPF will be in NP if the short solution hypothesis for strongly connected directed graphs is correct. In this paper, it is shown that this hypothesis is indeed true, even when one allows for synchronous rotations.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 45 references that are in the map. First posted on arXiv 10 Oct 2022.
Builds on
6 of 45 references.
References · 6
- 2019Multi-Agent Pathfinding: Definitions, Variants, and Benchmarkscited by 197
- 2015Intractability of Optimal Multi-Robot Path Planning on Planar Graphscited by 15
- 2019On the Computational Complexity of Multi-Agent Pathfinding on Directed Graphscited by 7
- 2022Refined Hardness of Distance-Optimal Multi-Agent Path Findingcited by 6
- 2017AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)cited by 5
- 2022Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithmscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.