.png){kind=icon}
返回
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
.png){kind=icon}
OA
AI
DOI：10.1609/socs.v6i1.18343.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息