Sike Zeng

Virtual Obstacles Regulation for Multi-Agent Path Finding

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 a state-of-the-art variant of the widely used conflict-based search (CBS) method, offering bounded-suboptimal