Comparing front-to-front and front-to-end heuristics in bidirectional search

Lior Siag, Shahaf S. Shperberg, Ariel Felner, Nathan R. Sturtevant

Research output: Contribution to journalConference articlepeer-review


Most recent theoretical and algorithmic work in bidirectional heuristic search (BiHS) used front-to-end (F2E) heuristics that estimate the distance to the start and goal states. In this paper, we start exploring front-to-front (F2F) heuristics, which estimate the distance between any pair of states. Devising efficient algorithms that use F2F heuristics is a challenging task. Thus, it is important to first understand the benefits of using F2F heuristics compared to F2E heuristics. To this end, we theoretically and experimentally demonstrate that there is a great potential in using F2F heuristics implying that F2F BiHS is a promising area of future research.

Original languageEnglish
Pages (from-to)158-162
Number of pages5
JournalThe International Symposium on Combinatorial Search
Issue number1
StatePublished - 1 Jan 2023
Event16th International Symposium on Combinatorial Search, SoCS 2023 - Prague, Czech Republic
Duration: 14 Jul 202316 Jul 2023

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this