资源分类
》 资源 》论文》ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

2019-11-18 | |  94 |   59 |   0

Abstract Conflict-Based Search (CBS) and its enhancements, Meta-Agent CBS and bypassing conflicts are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces two new improvements to CBS and incorporates them into a coherent, improved version of CBS, namely ICBS. Experimental results show that each of these improvements further reduces the runtime over the existing CBS-based approaches. When all improvements are combined, an even larger improvement is achieved, producing state-of-the art results for a number of domains.

上一篇：Model-Based Genetic Algorithms for Algorithm Configuration

下一篇：Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...