Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding
IJCAI, pp. 3067-3074, 2016.
Multi-Agent Path Finding (MAPF) with the objective to minimize the sum of the travel times of the agents along their paths is a hard combinatorial problem. Recent work has shown that bounded-suboptimal MAPF solvers, such as Enhanced Conflict-Based Search or ECBS(w1) for short, run often faster than optimal MAPF solvers at the cost of incu...More
PPT (Upload PPT)