Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding

IJCAI, pp. 3067-3074, 2016.

Cited by: 32|Views9
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments