Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
Foivos Fioravantes,
Dušan Knop,
Jan Matyáš Křištan
et al.
Abstract: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 man… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.