AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the International Symposium on Combinatorial Search, 10

k-Robust Multi-Agent Path Finding

Authors

Dor Atzmon,Ariel Felner,Roni Stern,Glenn Wagner,Roman Barták,Neng-Fa Zhou

Ben-Gurion University of the Negev,Ben-Gurion University of the Negev,Ben-Gurion University of the Negev,Carnegie Mellon University,Charles University,City University of New York


Proceedings:

Proceedings of the International Symposium on Combinatorial Search, 10

Volume

Issue:

Vol. 10 No. 1 (2017): Tenth Annual Symposium on Combinatorial Search

Track:

Extended Abstracts

Downloads:

Download PDF

Abstract:

In the multi-agent path-finding (MAPF) problem a plan is needed to move a set of agents from their initial location to their goals without collisions. In this paper we introduce and study the k-robust MAPF problem, where we seek a plan that is robust to k unexpected delays per agent.

DOI:

10.1609/socs.v8i1.18415


SOCS

Vol. 10 No. 1 (2017): Tenth Annual Symposium on Combinatorial Search