Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10408108" target="_blank" >RIV/00216208:11320/19:10408108 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.5220/0007470002260231" target="_blank" >http://dx.doi.org/10.5220/0007470002260231</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5220/0007470002260231" target="_blank" >10.5220/0007470002260231</a>
Alternative languages
Result language
angličtina
Original language name
Combining Strengths of Optimal Multi-Agent Path Finding Algorithms
Original language description
The problem of multi-agent path finding (MAPF) is studied in this paper. Solving MAPF optimally is a computationally hard problem and many different optimal algorithms have been designed over the years. These algorithms have good runtimes for some problem instances, while performing badly for other instances. Interestingly, these hard instances are often different across the algorithms. This leads to an idea of combining the strengths of different algorithms in such a way that an input problem instance is split into disjoint subproblems and each subproblem is solved by appropriate algorithm resulting in faster computation than using either of the algorithms for the whole instance. By manual problem decomposition we will empirically show that the above idea is viable. We will also sketch a possible future work on automated problem decomposition.
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/GA19-02183S" target="_blank" >GA19-02183S: Smart Swarms: From Theory to Practice</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
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 11th International Conference on Agents and Artificial Intelligence
ISBN
978-989-758-350-6
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
226-231
Publisher name
scitepress
Place of publication
neuveden
Event location
Prague
Event date
Feb 19, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—