作者
Eli Boyarski, Ariel Felner, Guni Sharon, Roni Stern
发表日期
2015/4/8
研讨会论文
Twenty-Fifth International Conference on Automated Planning and Scheduling
简介
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.
学术搜索中的文章
E Boyarski, A Felner, G Sharon, R Stern - Proceedings of the International Conference on …, 2015