Showing cs.MAShow all
3 papers · 1 filter
cs.MA2025
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…
cs.MA2025
Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees
Kegan J. Strawn, Thomy Phan, Eric Wang +3
Existing multi-agent path finding (MAPF) solvers do not account for uncertain behavior of uncontrollable agents. We present a novel variant of Enhanced Conflict-Based Search (ECBS)…
cs.MA2024
MAPFAST: A Deep Algorithm Selector for Multi Agent Path Finding using Shortest Path Embeddings
Jingyao Ren, Vikraman Sathiyanarayanan, Eric Ewing +2
Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization. While many algorithms have been develop…