Skip to content

Author

Mai-Dan Zhang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.