Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding Conference Paper

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.

authors

• Sharon, Guni

published proceedings

• Proceedings of the International Conference on Automated Planning and Scheduling

author list (cited authors)

• Boyrasky, E., Felner, A., Sharon, G., & Stern, R.

citation count

• 12

complete list of authors

• Boyrasky, Eli||Felner, Ariel||Sharon, Guni||Stern, Roni

publication date

• January 2015

publisher

• Association for the Advancement of Artificial Intelligence (AAAI)  Publisher

published in

• Proceedings International Conference on Automated Planning and Scheduling, ICAPS  Journal

keywords

• 46 Information And Computing Sciences
• 4602 Artificial Intelligence
• 4605 Data Management And Data Science

Digital Object Identifier (DOI)

• 10.1609/icaps.v25i1.13725

International Standard Book Number (ISBN) 13

• 9781577357315

start page

• 47

end page

• 51

volume

• 25

URL

• http://dx.doi.org/10.1609/icaps.v25i1.13725