Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00374774" target="_blank" >RIV/68407700:21240/24:00374774 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1609/aaai.v38i16.29686" target="_blank" >https://doi.org/10.1609/aaai.v38i16.29686</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1609/aaai.v38i16.29686" target="_blank" >10.1609/aaai.v38i16.29686</a>
Alternative languages
Result language
angličtina
Original language name
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
Original language description
In the Multiagent Path Finding (MAPF for short) problem, we focus on efficiently finding non-colliding paths for a set of k agents on a given graph G, where each agent seeks a path from its source vertex to a target. An important measure of the quality of the solution is the length of the proposed schedule l, that is, the length of a longest path (including the waiting time). In this work, we propose a systematic study under the parameterized complexity framework. The hardness results we provide align with many heuristics used for this problem, whose running time could potentially be improved based on our Fixed-Parameter Tractability (FPT) results. We show that MAPF is W[1]-hard with respect to k (even if k is combined with the maximum degree of the input graph). The problem remains NP-hard in planar graphs even if the maximum degree and the makespan l are fixed constants. On the positive side, we show an FPT algorithm for k+l. As we continue, the structure of G comes into play. We give an FPT algorithm for parameter k plus the diameter of the graph G. The MAPF problem is W[1]-hard for cliquewidth of G plus l while it is FPT for treewidth of G plus l.
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
2024
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 38th AAAI Conference on Artificial Intelligence
ISBN
—
ISSN
2159-5399
e-ISSN
2374-3468
Number of pages
9
Pages from-to
17380-17388
Publisher name
AAAI Press
Place of publication
Menlo Park
Event location
Vancouver
Event date
Feb 20, 2024
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
001239323500011