Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges

Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan Sturtevant, Glenn Wagner, Pavel Surynek

Research output: Contribution to conferencePaperpeer-review

91 Scopus citations

Abstract

Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this research area, numerous diverse search-based techniques were developed in the past 6 years for optimally solving MAPF under the sum-of-costs objective function. In this paper we survey these techniques, while placing them into the wider context of the MAPF field of research. Finally, we provide analytical and experimental comparisons that show that no algorithm dominates all others in all circumstances. We conclude by listing important future research directions.

Original languageEnglish
Pages29-37
Number of pages9
StatePublished - 1 Jan 2017
Event10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States
Duration: 16 Jun 201717 Jun 2017

Conference

Conference10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/TerritoryUnited States
CityPittsburgh
Period16/06/1717/06/17

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges'. Together they form a unique fingerprint.

Cite this