Scheduling Models for 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%3A10372051" target="_blank" >RIV/00216208:11320/17:10372051 - isvavai.cz</a>
Result on the web
<a href="http://svancara.net/files/MISTA_2017_paper_44.pdf" target="_blank" >http://svancara.net/files/MISTA_2017_paper_44.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Scheduling Models for Multi-Agent Path Finding
Original language description
Multi-agent path finding (MAPF) deals with the problem of finding a colli- sion free path for a set of agents. The agents are located at nodes of a directed graph, they can move over the arcs, and each agent has its own destination node. It is not possible for two agents to be at the same node at the same time. This paper suggests to model the MAPF problem using scheduling techniques, namely, nodes are seen as unary resources. We present three models of the problem. One model is motivated by network flows, another model uses classical unary resource constraints together with path constraints, and the last model works with optional activities. We compare the efficiency of models experimentally.
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 8th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2017)
ISBN
—
ISSN
2305-249X
e-ISSN
neuvedeno
Number of pages
12
Pages from-to
189-200
Publisher name
Neuveden
Place of publication
Neuveden
Event location
Kuala Lumpur, Malaysia
Event date
Dec 5, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—