Tan, X., & Grastien, A. (2025). Inapproximability of Optimal Multi-Agent Pathfinding Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 39(25), 26707–26715. https://doi.org/10.1609/aaai.v39i25.34873