,
Eduard Eiben
,
Fedor V. Fomin
,
Petr A. Golovach
Creative Commons Attribution 4.0 International license
We study Transient Multiagent Pathfinding, a variant of the classical Multi-Agent Pathfinding problem in which a set of agents must be routed without collisions from designated start vertices to designated destination vertices in a graph. We analyze the problem within the above-and-below-guarantee paradigm of parameterized complexity. In particular, we consider the natural upper bound ℒ, given by the sum of the shortest-path distances between pairs of agents' terminals (corresponding to sequential routing of the agents). The parameterization is given by the gap ζ = ℒ - λ between this bound and the target makespan λ, together with the number k of agents. Our main result establishes fixed-parameter tractability for the combined parameter k + ζ. Matching lower bounds show that parameterization by k alone is W[1]-hard, and that parameterization by ζ alone is W[1]-hard when terminals are not required to be distinct. On the positive side, if all terminals are distinct, the problem becomes fixed-parameter tractable when parameterized solely by ζ. Finally, we show that Transient Multiagent Pathfinding is unlikely to admit a polynomial kernel when parameterized by k + ζ. Together, our results provide an almost complete characterization of the parameterized complexity landscape of the problem for the considered parameters.
@InProceedings{bentert_et_al:LIPIcs.IPEC.2026.20,
author = {Bentert, Matthias and Eiben, Eduard and Fomin, Fedor V. and Golovach, Petr A.},
title = {{Routing Multiple Agents Below the Sum of Distances}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.20},
URN = {urn:nbn:de:0030-drops-281932},
doi = {10.4230/LIPIcs.IPEC.2026.20},
annote = {Keywords: Multi-Agent Pathfinding, Parameterized Complexity, Motion Planning}
}