Abstract: Most of existing path finding problems focused on searching a path with the minimum cost, such as shortest-path length and shortest travel time. In this paper, we consider a new path finding ...

Abstract: Multi-agent path finding (MAPF) involves finding collision-free paths for multiple agents while minimizing the total path costs. Explicit estimation conflict-based search (EECBS) represents ...