Parameterized Algorithms for Multiagent Pathfinding on Trees

The classical Multiagent Pathfinding problem has been extensively studied not only within the artificial intelligence research community, but also by scholars in the areas of theoretical computer science and computational geometry. The problem asks for a minimum-makespan schedule that routes 𝑘 agents (or robots) from their starting points to their destinations in a graph, while avoiding collisions, and is known to be NP-hard even on the fundamental class of trees. In this article we present two fixed parameter algorithms parameterized by 𝑘: the first yields a collision-free schedule on trees whose makespan deviates from the optimum by at most an additive polynomial function of 𝑘, and the second solves Multiagent Pathfinding optimally on the class of irreducible trees, i. e. , trees with no vertices of degree 2. Both results rely on novel tools and insights into the properties of optimal schedules.

Authors

• Argyrios Deligkas Royal Holloway, University of London
• Eduard Eiben Royal Holloway, University of London
• Robert Ganian Algorithms and Complexity Group, TU Wien, Vienna, Austria
• Iyad Kanj
• M. S. Ramanujan University of Warwick

Keywords

• Multiagent Pathfinding
• Trees
• Parameterized Complexity