Arrow Research search
Back to SoCS

SoCS 2015

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

Conference Paper Extended Abstracts Algorithms and Complexity · Artificial Intelligence · Automated Planning and Scheduling

Abstract

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.

Authors

Keywords

  • Heuristic search
  • Multi-agent
  • pathfinding
  • optimal
  • cbs
  • ma-cbs

Context

Venue
International Symposium on Combinatorial Search
Archive span
2010-2024
Indexed papers
598
Paper id
1036562614301045179