Further Improved Heuristics for Conflict-Based Search

Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Conflict-Based Search (CBS) is a leading two-level algorithm for optimal Multi-Agent Path Finding (MAPF). At the high level, CBS expands nodes by resolving conflicts. Recently, admissible heuristics were added to the high level of CBS. We enhance all known heuristic functions for CBS by using information about the cost of resolving certain conflicts, with only a small computational overhead. We experimentally demonstrate that the improved heuristics contribute to making CBS even more efficient.

Original languageEnglish
Title of host publication14th International Symposium on Combinatorial Search, SoCS 2021
EditorsHang Ma, Ivan Serina
PublisherAssociation for the Advancement of Artificial Intelligence
Pages213-215
Number of pages3
ISBN (Electronic)9781713834557
StatePublished - 1 Jan 2021
Event14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China
Duration: 26 Jul 202130 Jul 2021

Publication series

Name14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference14th International Symposium on Combinatorial Search, SoCS 2021
Country/TerritoryChina
CityGuangzhou, Virtual
Period26/07/2130/07/21

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Further Improved Heuristics for Conflict-Based Search'. Together they form a unique fingerprint.

Cite this