67 citations · 95 across the 3 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2024
Multi-Robot Connected Fermat Spiral Coverage
Jingtao Tang, Hang Ma
We introduce the Multi-Robot Connected Fermat Spiral (MCFS), a novel algorithmic framework for Multi-Robot Coverage Path Planning (MCPP) that adapts Connected Fermat Spiral (CFS) f…
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…