Khorshid, M. et al. 2021. A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. Proceedings of the International Symposium on Combinatorial Search. 2, 1 (Aug. 2021), 76–83. DOI:https://doi.org/10.1609/socs.v2i1.18205.