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.
| Original language | English |
|---|---|
| Title of host publication | 14th International Symposium on Combinatorial Search, SoCS 2021 |
| Editors | Hang Ma, Ivan Serina |
| Publisher | Association for the Advancement of Artificial Intelligence |
| Pages | 185-187 |
| Number of pages | 3 |
| ISBN (Electronic) | 9781713834557 |
| State | Published - 2021 |
| Externally published | Yes |
| Event | 14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China Duration: 26 Jul 2021 → 30 Jul 2021 |
Publication series
| Name | 14th International Symposium on Combinatorial Search, SoCS 2021 |
|---|
Conference
| Conference | 14th International Symposium on Combinatorial Search, SoCS 2021 |
|---|---|
| Country/Territory | China |
| City | Guangzhou, Virtual |
| Period | 26/07/21 → 30/07/21 |
Bibliographical note
Publisher Copyright:Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.