Multi-agent path finding – an overview

Roni Stern

doi:10.1007/978-3-030-33274-7_6

Multi-agent path finding – an overview

Roni Stern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

124 Scopus citations

Abstract

Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.

Original language	English
Title of host publication	Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures
Editors	Gennady S. Osipov, Aleksandr I. Panov, Konstantin S. Yakovlev
Publisher	Springer
Pages	96-115
Number of pages	20
ISBN (Print)	9783030332730
DOIs	https://doi.org/10.1007/978-3-030-33274-7_6
State	Published - 1 Jan 2019
Event	5th RAAI Summer School on Artificial Intelligence, 2019 - Dolgoprudny, Russian Federation Duration: 4 Jul 2019 → 7 Jul 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11866 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th RAAI Summer School on Artificial Intelligence, 2019
Country/Territory	Russian Federation
City	Dolgoprudny
Period	4/07/19 → 7/07/19

Keywords

Heuristic search
Multi-Agent Pathfinding

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-33274-7_6

Cite this

Stern, R. (2019). Multi-agent path finding – an overview. In G. S. Osipov, A. I. Panov, & K. S. Yakovlev (Eds.), Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures (pp. 96-115). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11866 LNAI). Springer. https://doi.org/10.1007/978-3-030-33274-7_6

@inproceedings{83d6f6360f524b59aa9d4ba8b065ed55,

title = "Multi-agent path finding – an overview",

abstract = "Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.",

keywords = "Heuristic search, Multi-Agent Pathfinding",

author = "Roni Stern",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 5th RAAI Summer School on Artificial Intelligence, 2019 ; Conference date: 04-07-2019 Through 07-07-2019",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-33274-7\_6",

language = "English",

isbn = "9783030332730",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "96--115",

editor = "Osipov, \{Gennady S.\} and Panov, \{Aleksandr I.\} and Yakovlev, \{Konstantin S.\}",

booktitle = "Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures",

address = "Germany",

}

Stern, R 2019, Multi-agent path finding – an overview. in GS Osipov, AI Panov & KS Yakovlev (eds), Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11866 LNAI, Springer, pp. 96-115, 5th RAAI Summer School on Artificial Intelligence, 2019, Dolgoprudny, Russian Federation, 4/07/19. https://doi.org/10.1007/978-3-030-33274-7_6

Multi-agent path finding – an overview. / Stern, Roni.
Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures. ed. / Gennady S. Osipov; Aleksandr I. Panov; Konstantin S. Yakovlev. Springer, 2019. p. 96-115 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11866 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multi-agent path finding – an overview

AU - Stern, Roni

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.

AB - Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. In recent years, there has been a growing interest in MAPF in the Artificial Intelligence (AI) research community. This interest is partially because real-world MAPF applications, such as warehouse management, multi-robot teams, and aircraft management, are becoming more prevalent. In this overview, we discuss several possible definitions of the MAPF problem. Then, we survey MAPF algorithms, starting with fast but incomplete algorithms, then fast, complete but not optimal algorithms, and finally optimal algorithms. Then, we describe approximately optimal algorithms and conclude with non-classical MAPF and pointers for future reading and future work.

KW - Heuristic search

KW - Multi-Agent Pathfinding

UR - https://www.scopus.com/pages/publications/85076105481

U2 - 10.1007/978-3-030-33274-7_6

DO - 10.1007/978-3-030-33274-7_6

M3 - Conference contribution

AN - SCOPUS:85076105481

SN - 9783030332730

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 96

EP - 115

BT - Artificial Intelligence - 5th RAAI Summer School, 2019, Tutorial Lectures

A2 - Osipov, Gennady S.

A2 - Panov, Aleksandr I.

A2 - Yakovlev, Konstantin S.

PB - Springer

T2 - 5th RAAI Summer School on Artificial Intelligence, 2019

Y2 - 4 July 2019 through 7 July 2019

ER -

Multi-agent path finding – an overview

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this