TY - GEN
T1 - Conflict-based search for optimal multi-agent path finding
AU - Sharon, Guni
AU - Stern, Roni
AU - Felner, Ariel
AU - Sturtevant, Nathan
PY - 2012/12/1
Y1 - 2012/12/1
N2 - We present a new two-level search algorithm for optimal multi-agent path finding called Conflict Based Search (CBS). At the high level, a search is performed on a tree based on conflicts between agents. At the low level, a search is performed only for a single agent at a time. Experimental results on various problems shows a speedup of up to a full order of magnitude over previous approaches.
AB - We present a new two-level search algorithm for optimal multi-agent path finding called Conflict Based Search (CBS). At the high level, a search is performed on a tree based on conflicts between agents. At the low level, a search is performed only for a single agent at a time. Experimental results on various problems shows a speedup of up to a full order of magnitude over previous approaches.
UR - https://www.scopus.com/pages/publications/84893343362
M3 - Conference contribution
AN - SCOPUS:84893343362
SN - 9781577355847
T3 - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
SP - 190
BT - Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
T2 - 5th International Symposium on Combinatorial Search, SoCS 2012
Y2 - 19 July 2012 through 21 July 2012
ER -