Empirical Hardness in Multi-Agent Pathfinding: Research Challenges and Opportunities

Jingyao Ren, Eric Ewing, T. K. Satish Kumar +2

Multi-agent pathfinding (MAPF) is the problem of finding collision-free paths for a team of agents on a map. Although MAPF is NP-hard, the hardness of solving individual instances…