Preprint
Aug 2026
PSPACE-Completeness of Multi-Agent Path Finding for Large Agents
This paper strengthens Agafonov and Yakovlev's result by proving that LA-MAPF is PSPACE-complete via a polynomial-time reduction from Restricted Sliding Tokens.
Mai-Dan Zhang, N. Kamiyama, Kanae Yoshiwatari
· 0 citations