61 citations · 73 across the 4 of their papers we have counts for
Showing cs.MAShow all
2 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.MA2021★ 12 cited
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…