On Modelling Multi-Agent Path Finding as a Classical Planning Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10424621" target="_blank" >RIV/00216208:11320/20:10424621 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/ICTAI50040.2020.00014" target="_blank" >https://doi.org/10.1109/ICTAI50040.2020.00014</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ICTAI50040.2020.00014" target="_blank" >10.1109/ICTAI50040.2020.00014</a>
Alternative languages
Result language
angličtina
Original language name
On Modelling Multi-Agent Path Finding as a Classical Planning Problem
Original language description
Multi-Agent Path Finding (MAPF) deals with finding collision-free paths for a set of agents. It is a special case of a planning problem with only two actions - move and wait - and with one major constraint of no collision between the agents. The paper addresses the question of how to model MAPF as a classical sequential planning problem. Several models in the PDDL language are proposed and empirically compared.
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
2020
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
International Conference on Tools with Artificial Intelligence
ISBN
978-1-72819-228-4
ISSN
2375-0197
e-ISSN
—
Number of pages
6
Pages from-to
23-28
Publisher name
IEEE
Place of publication
Neuveden
Event location
Baltimore, USA
Event date
Nov 9, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—