Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10474401" target="_blank" >RIV/00216208:11320/23:10474401 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1609/socs.v16i1.27306" target="_blank" >https://doi.org/10.1609/socs.v16i1.27306</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/socs.v16i1.27306" target="_blank" >10.1609/socs.v16i1.27306</a>
Alternative languages
Result language
angličtina
Original language name
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]
Original language description
Multi-agent pathfinding is the task of navigating a set of agents in a shared environment without collisions. Finding an optimal plan is a computationally hard problem, therefore, one may want to sacrifice optimality for faster computation time. In this paper, we present our preliminary work on finding a valid solution using only a predefined path for each agent with the possibility of adding wait actions. This restriction makes some instances unsolvable, however, we show instances where this approach is guaranteed to find a solution.
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/LTAUSA19072" target="_blank" >LTAUSA19072: Lifelong Planning for a Smart Swarm</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
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
Sixteenth International Symposium on Combinatorial Search
ISBN
978-1-57735-882-4
ISSN
—
e-ISSN
—
Number of pages
2
Pages from-to
185-186
Publisher name
The AAAI Press
Place of publication
neuveden
Event location
Prague, Czech Republic
Event date
Jul 14, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—