k-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%2F17%3A10371742" target="_blank" >RIV/00216208:11320/17:10371742 - isvavai.cz</a>
Result on the web
<a href="https://aaai.org/ocs/index.php/SOCS/SOCS17/paper/viewFile/15797/15072" target="_blank" >https://aaai.org/ocs/index.php/SOCS/SOCS17/paper/viewFile/15797/15072</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
k-Robust Multi-Agent Path Finding
Original language description
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.
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)
Others
Publication year
2017
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 Tenth International Symposium on Combinatorial Search (SoCS 2017)
ISBN
978-1-57735-790-2
ISSN
—
e-ISSN
neuvedeno
Number of pages
2
Pages from-to
157-158
Publisher name
AAAI Press
Place of publication
USA
Event location
Pittsburgh, Pennsylvania USA
Event date
Jun 16, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—