Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Boyarski et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: