A* variants for optimal multi-agent pathfinding Conference Paper uri icon

abstract

  • Several variants of A* have been recently proposed for finding optimal solutions for the multi-agent pathfinding (MAPF) problem. We describe the application of the new enhanced partial-expansion technique to MAPF, show how pattern databases can be applied on top of this technique and compare the different A* variants experimentally. Copyright 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

published proceedings

  • Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

author list (cited authors)

  • Goldenberg, M., Felner, A., Stern, R., Sharon, G., & Schaeffer, J.

publication date

  • January 2012