A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding

Mokhtar M. Khorshid, Robert C. Holte, Nathan R. Sturtevant. A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding. In Daniel Borrajo, Maxim Likhachev, Carlos Linares López, editors, Proceedings of the Fourth Annual Symposium on Combinatorial Search, SOCS 2011, Castell de Cardona, Barcelona, Spain, July 15.16, 2011. pages 76-83, AAAI Press, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.