A* variants for optimal multi-agent pathfinding

Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Pages157-158
Number of pages2
StatePublished - 1 Dec 2012
Event5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada
Duration: 19 Jul 201221 Jul 2012

Publication series

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

Conference

Conference5th International Symposium on Combinatorial Search, SoCS 2012
Country/TerritoryCanada
CityNiagara Falls, ON
Period19/07/1221/07/12

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this