ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, Eyal Shimony
Bar-Ilan University Ben-Gurion University of the Negev
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Conflict-Based Search (CBS) and its generalization, Meta-Agent CBS are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces ICBS, an improved version of CBS. ICBS incorporates three orthogonal improvements to CBS which are systematically described and studied. Experimental results show that each of these improvements reduces the runtime over basic CBS by up to 20x in many cases. When all three improvements are combined, an even larger improvement is achieved, producing state-ofthe art results for a number of domains.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIRobotic Path Planning Algorithms
Multi-Agent Systems and Negotiation · Natural Language Processing Techniques
参考文献 3
此处列出前 3 条
引用本文 108
按被引量排序,此处列出前 3 条