74 citations · 197 across the 16 of their papers we have counts for
3 papers · 2 filters
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Jiaoyang Li, Wheeler Ruml, Sven Koenig
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for multiple robots, is important for many applications where small runtimes are necessary, including the kind o…
Integer Programming for Multi-Robot Planning: A Column Generation Approach
Naveed Haghani, Jiaoyang Li, Sven Koenig +3
We consider the problem of coordinating a fleet of robots in a warehouse so as to maximize the reward achieved within a time limit while respecting problem and robot specific const…
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
Jiaoyang Li, Andrew Tinka, Scott Kiesel +3
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where ag…