[1]
X. Tan and A. Grastien, “Inapproximability of Optimal Multi-Agent Pathfinding Problems”, AAAI, vol. 39, no. 25, pp. 26707–26715, Apr. 2025.