Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology

Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +2

In the Multiagent Path Finding problem (MAPF for short), we focus on efficiently finding non-colliding paths for a set of $k$ agents on a given graph $G$, where each agent seeks a…