Robust Multi-Agent Path Finding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10392112" target="_blank" >RIV/00216208:11320/18:10392112 - isvavai.cz</a>
Result on the web
<a href="https://aaai.org/ocs/index.php/SOCS/SOCS18/paper/viewFile/17954/17094" target="_blank" >https://aaai.org/ocs/index.php/SOCS/SOCS18/paper/viewFile/17954/17094</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Robust Multi-Agent Path Finding
Original language description
In the multi-agent path-finding (MAPF) problem, the task is to find a plan for moving a set of agents from their initial locations to their goals without collisions. Following this plan, however, may not be possible due to unexpected events that delay some of the agents. We explore the notion of k- robust MAPF, where the task is to find a plan that can be followed even if a limited number of such delays occur. k- robust MAPF is especially suitable for agents with a control mechanism that guarantees that each agent is within a limited number of steps away from its pre-defined plan. We propose sufficient and required conditions for finding a k-robust plan, and show how to convert several MAPF solvers to find such plans. Then, we show the benefit of using a k-robust plan during execution, and for finding plans that are likely to succeed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/8G15027" target="_blank" >8G15027: INTEGRATION OF HEURISTIC SEARCH AND COMPILATION-BASED TECHNIQUES FOR MULTI-AGENT PATH-FINDING</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Eleventh International Symposium on Combinatorial Search, SOCS 2018, Stockholm, Sweden - 14-15 July 2018
ISBN
978-1-57735-802-2
ISSN
—
e-ISSN
neuvedeno
Number of pages
8
Pages from-to
2-9
Publisher name
AAAI Press
Place of publication
Palo Alto
Event location
Stockholm, Sweden
Event date
Jul 14, 2018
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—