APA (7th ed.) Citation

Khorshid, M., Holte, R., & Sturtevant, N. (2021). A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. Proceedings of the International Symposium on Combinatorial Search, 2(1), 76-83. https://doi.org/10.1609/socs.v2i1.18205

Chicago Style (17th ed.) Citation

Khorshid, Mokhtar, Robert Holte, and Nathan Sturtevant. "A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding." Proceedings of the International Symposium on Combinatorial Search 2, no. 1 (2021): 76-83. https://doi.org/10.1609/socs.v2i1.18205.

MLA (9th ed.) Citation

Khorshid, Mokhtar, et al. "A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding." Proceedings of the International Symposium on Combinatorial Search, vol. 2, no. 1, 2021, pp. 76-83, https://doi.org/10.1609/socs.v2i1.18205.