Proceedings:
Book One
Volume
Issue:
Proceedings of the International Conference on Automated Planning and Scheduling, 25
Track:
Technical Papers
Downloads:
Abstract:
Conflict-Based Search (CBS) is a recently introduced algorithm for Multi-AgentPath Finding (MAPF) whose runtime is exponential in the number of conflictsfound between the agents' paths. We present an improved version of CBS thatbypasses conflicts thereby reducing the CBS search tree. Experimental resultsshow that this improvement reduces the runtime by an order of magnitude in manycases.
DOI:
10.1609/icaps.v25i1.13725
ICAPS
Proceedings of the International Conference on Automated Planning and Scheduling, 25