200 citations · 228 across the 18 of their papers we have counts for
3 papers · 2 filters
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
Yue Zhang, Zhe Chen, Daniel Harabor +2
We study the problem of online Multi-Agent Pickup and Delivery (MAPD), where a team of agents must repeatedly serve dynamically appearing tasks on a shared map. Existing online met…
Real-Time LaCAM for Real-Time MAPF
Runzhe Liang, Rishi Veerapaneni, Daniel Harabor +2
The vast majority of Multi-Agent Path Finding (MAPF) methods with completeness guarantees require planning full-horizon paths. However, planning full-horizon paths can take too lon…
CBS with Continuous-Time Revisit
Andy Li, Zhe Chen, Danial Harabor +1
Multi-Agent Path Finding in Continuous Time (\mapfr) extends the classical MAPF problem by allowing agents to operate in continuous time. Conflict-Based Search with Continuous Time…