Distance-r Independent Unlabeled Multi-Agent Pathfinding is PSPACE-complete, with reduction-based and configuration-generator algorithms that solve instances with hundreds of agents.
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984) , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distance-Constrained Unlabeled Multi-Agent Pathfinding
Distance-r Independent Unlabeled Multi-Agent Pathfinding is PSPACE-complete, with reduction-based and configuration-generator algorithms that solve instances with hundreds of agents.