PSPACE-Completeness of Multi-Agent Path Finding for Large Agents
Maichi Zhang, Naoyuki Kamiyama, Kanae Yoshiwatari
Abstract
Multi-Agent Path Finding for Large Agents (LA-MAPF) is a geometric variant of MAPF in which agents are modeled as disks and conflicts are determined by physical overlap in the underlying Euclidean workspace. The goal of LA-MAPF is to decide whether there exists a sequence of conflict-free transitions from a start configuration to a goal configuration. Agafonov and Yakovlev proved that LA-MAPF is NP-hard. In this paper, we strengthen their result by proving that LA-MAPF is PSPACE-complete via a polynomial-time reduction from Restricted Sliding Tokens.
Create a lesson
Related papers
A Structural Proof of the Lower Bound 21 for 3×3 Matrix Multiplication over F2
Shuxing Yang, Rui Zhao, Junyao Wu et al.
An Operator Approach to Register Programs for Catalytic Computing
Antoine Vinciguerra
Rational Reductions and Regular Languages of Constant Circuit Complexity
Stefan Göller, Amaldev Manuel
Hidden Circuits and Exact Counting in Ordered Graphs
Chenghua Liu, Boning Meng
Improved lower bounds for decomposable randomized encoding
Justin Holmgren, Kewen Wu
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman