Colored Multi-Agent Path Finding: Solving Approaches
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10432975" target="_blank" >RIV/00216208:11320/21:10432975 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.32473/flairs.v34i1.128535" target="_blank" >https://doi.org/10.32473/flairs.v34i1.128535</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.32473/flairs.v34i1.128535" target="_blank" >10.32473/flairs.v34i1.128535</a>
Alternative languages
Result language
angličtina
Original language name
Colored Multi-Agent Path Finding: Solving Approaches
Original language description
Multi-Agent Path Finding (MAPF) deals with the problem of finding collision-free paths for a set of agents moving in a shared environment while each agent has specified its destination. Colored MAPF generalizes MAPF by defining groups of agents that share a set of destination locations. In the paper, we evaluate several approaches to optimally solve the colored MAPF problem, namely, a method based on network flows, an extended version of conflict-based search, and two models using Boolean satisfiability. We also investigate methods for obtaining lower bounds on optimal solutions based on constraint and continuous relaxation techniques.
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
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 Thirty-Fourth International Florida Artificial Intelligence Research Society Conference
ISBN
—
ISSN
2334-0762
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
AAAI press
Place of publication
Neuveden
Event location
North Miami Beach
Event date
May 17, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—