k-Robust Multi-Agent Path Finding

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.

Socs 2017 Proceedings Cover

Downloads

Published

2021-09-01

How to Cite

Atzmon, D., Felner, A., Stern, R., Wagner, G., Barták, R., & Zhou, N.-F. (2021). k-Robust Multi-Agent Path Finding. Proceedings of the International Symposium on Combinatorial Search, 8(1), 157–158. https://doi.org/10.1609/socs.v8i1.18415

Issue

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

Section

Extended Abstracts