Tree-MAPF: On the Complexity of Optimizing Multi Agent Path Finding on Tree Graphs
In its general form, Multi-Agent Path Finding (MAPF) is well known to be NP-hard for various optimization objectives. But determining the complexity boundary for restricted topologies remains a key theoretical challenge. This paper investigates the complexity of MAPF on tree topologies. While recent work has establishe...