91 citations · 491 across the 19 of their papers we have counts for
Showing 2016 · cs.AIShow all
2 papers · 2 filters
cs.AI2016★ 67 cited
Optimal Target Assignment and Path Finding for Teams of Agents
Hang Ma, Sven Koenig
We study the TAPF (combined target-assignment and path-finding) problem for teams of agents in known terrain, which generalizes both the anonymous and non-anonymous multi-agent pat…
cs.AI2016★ 28 cited
Multi-Agent Path Finding with Delay Probabilities
Hang Ma, T. K. Satish Kumar, Sven Koenig
Several recently developed Multi-Agent Path Finding (MAPF) solvers scale to large MAPF instances by searching for MAPF plans on 2 levels: The high-level search resolves collisions…