k-Robust Multi-Agent Path Finding

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

doi:10.1609/socs.v8i1.18415

Authors

Dor Atzmon Ben-Gurion University of the Negev
Ariel Felner Ben-Gurion University of the Negev
Roni Stern Ben-Gurion University of the Negev
Glenn Wagner Carnegie Mellon University
Roman Barták Charles University
Neng-Fa Zhou City University of New York

DOI:

https://doi.org/10.1609/socs.v8i1.18415

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.

k-Robust Multi-Agent Path Finding

Authors

DOI:

Abstract

Downloads

Published

Issue

Section