Conflict-based search for optimal multi-agent path finding

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

Volumn , Issue , 2012, Pages 190-

  Sharon, Guni ^a   Stern, Roni ^a   Felner, Ariel ^a   Sturtevant, Nathan ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF DENVER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATH FINDING; SEARCH ALGORITHMS; SINGLE-AGENT; TREE-BASED;

OPTIMIZATION;

EID: 84893343362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Sharon, G.; Stern, R.; Goldenberg, M.; and Felner, A. 2011. The increasing cost tree search for optimal multi-agent pathfinding. In IJCAI, 662-667.
2. Sharon, G.; Stern, R.; Felner, A.; and Sturtevant, N. R. 2012a. Conflictbased search for optimal multi-agent path finding. In AAAI (to appear).
3. Sharon, G.; Stern, R.; Felner, A.; and Sturtevant, N. R. 2012b. Metaagent conflict-based search for optimal multi-agent path finding. In SoCS
4. Standley, T. 2010. Finding optimal solutions to cooperative pathfinding problems. In AAAI, 173-178.
5. Sturtevant, N. 2012. Benchmarks for grid-based pathfinding. Transactions on Computational Intelligence and AI in Games.