AI RESEARCH
Conflict-Based Search for Multi Agent Path Finding with Asynchronous Actions
arXiv CS.AI
•
ArXi:2603.18866v1 Announce Type: new Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective start locations to their respective goal locations while minimizing path costs. Most existing MAPF algorithms rely on a common assumption of synchronized actions, where the actions of all agents start at the same time and always take a time unit, which may limit the use of MAPF planners in practice.