Adding heuristics to conflict-based search for multi-agent path finding

Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K.Satish Kumar, Sven Koenig

Research output: Contribution to journalConference articlepeer-review

66 Scopus citations

Abstract

Conflict-Based Search (CBS) and its enhancements are among the strongest algorithms for the multi-agent path-finding problem. However, existing variants of CBS do not use any heuristics that estimate future work. In this paper, we introduce different admissible heuristics for CBS by aggregating cardinal conflicts among agents. In our experiments, CBS with these heuristics outperforms previous state-of-the-art CBS variants by up to a factor of five.

Original languageEnglish
Pages (from-to)83-87
Number of pages5
JournalProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume2018-June
StatePublished - 1 Jan 2018
Event28th International Conference on Automated Planning and Scheduling, ICAPS 2018 - Delft, Netherlands
Duration: 24 Jun 201829 Jun 2018

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Adding heuristics to conflict-based search for multi-agent path finding'. Together they form a unique fingerprint.

Cite this