@inproceedings{820aed486871401582150021a2d11c89,
title = "Contingent Planning for Robust Multi-Agent Path Finding",
abstract = "A classical approach to Multi-agent Path Finding assumes an offline construction of collision-free paths that the agents blindly follow during execution. k-robust plans can be executed without collisions even if an agent is delayed for at most k steps. In the paper, we propose a novel concept of robustness that uses alternative paths to which the agents are diverted in case of delay. Such plans can be found with much higher chances than k-robust plans.",
author = "Michal Nekvinda and Roman Bart{\'a}k and Meir Kalech",
note = "Publisher Copyright: Copyright {\textcopyright} 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 14th International Symposium on Combinatorial Search, SoCS 2021 ; Conference date: 26-07-2021 Through 30-07-2021",
year = "2021",
month = jan,
day = "1",
language = "English",
series = "14th International Symposium on Combinatorial Search, SoCS 2021",
publisher = "Association for the Advancement of Artificial Intelligence",
pages = "185--187",
editor = "Hang Ma and Ivan Serina",
booktitle = "14th International Symposium on Combinatorial Search, SoCS 2021",
}