Robust Multi-agent path finding

Dor Atzmon; Roni Stern; Ariel Felner; Glenn Wagner; Roman Bartak; Neng Fa Zhou

Robust Multi-agent path finding

Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Bartak, Neng Fa Zhou

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

35 Scopus citations

Abstract

In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k- robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k- robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.

Original language	English
Title of host publication	Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
Editors	Vadim Bulitko, Sabine Storandt
Publisher	AAAI press
Pages	2-9
Number of pages	8
ISBN (Electronic)	9781577358022
State	Published - 2018
Externally published	Yes
Event	11th International Symposium on Combinatorial Search, SoCS 2018 - Stockholm, Sweden Duration: 14 Jul 2018 → 15 Jul 2018

Publication series

Name	Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

Conference

Conference	11th International Symposium on Combinatorial Search, SoCS 2018
Country/Territory	Sweden
City	Stockholm
Period	14/07/18 → 15/07/18

Bibliographical note

Publisher Copyright:
© 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This research was supported by the Israel Ministry of Science, the Czech Ministry of Education, and by ISF grants #844/17 to Ariel Felner and #210/17 to Roni Stern.

Funders	Funder number
Israel Ministry of Science
Ministerstvo Školství, Mládeže a Tělovýchovy
Israel Science Foundation	844/17, 210/17

Cite this

@inproceedings{62ac55057d3a4855af9652f2e9c66c71,

title = "Robust Multi-agent path finding",

abstract = "In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k- robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k- robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.",

author = "Dor Atzmon and Roni Stern and Ariel Felner and Glenn Wagner and Roman Bartak and Zhou, {Neng Fa}",

note = "Publisher Copyright: {\textcopyright} 2018, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 11th International Symposium on Combinatorial Search, SoCS 2018 ; Conference date: 14-07-2018 Through 15-07-2018",

year = "2018",

language = "אנגלית",

series = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

publisher = "AAAI press",

pages = "2--9",

editor = "Vadim Bulitko and Sabine Storandt",

booktitle = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

}

Atzmon, D, Stern, R, Felner, A, Wagner, G, Bartak, R & Zhou, NF 2018, Robust Multi-agent path finding. in V Bulitko & S Storandt (eds), Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018. Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018, AAAI press, pp. 2-9, 11th International Symposium on Combinatorial Search, SoCS 2018, Stockholm, Sweden, 14/07/18.

Robust Multi-agent path finding. / Atzmon, Dor; Stern, Roni; Felner, Ariel et al.
Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018. ed. / Vadim Bulitko; Sabine Storandt. AAAI press, 2018. p. 2-9 (Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018).

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

TY - GEN

T1 - Robust Multi-agent path finding

AU - Atzmon, Dor

AU - Stern, Roni

AU - Felner, Ariel

AU - Wagner, Glenn

AU - Bartak, Roman

AU - Zhou, Neng Fa

PY - 2018

Y1 - 2018

N2 - In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k- robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k- robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.

AB - In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k- robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k- robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.

UR - http://www.scopus.com/inward/record.url?scp=85063311399&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85063311399

T3 - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

SP - 2

EP - 9

BT - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

A2 - Bulitko, Vadim

A2 - Storandt, Sabine

PB - AAAI press

T2 - 11th International Symposium on Combinatorial Search, SoCS 2018

Y2 - 14 July 2018 through 15 July 2018

ER -

Robust Multi-agent path finding

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this