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

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

doi:10.1609/socs.v16i1.27296

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

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

Ben-Gurion University of the Negev
University of Alberta
Alberta Machine Intelligence Institute

Research output: Contribution to journal › Conference article › peer-review

6 Scopus citations

Abstract

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 language	English
Pages (from-to)	158-162
Number of pages	5
Journal	The International Symposium on Combinatorial Search
Volume	16
Issue number	1
DOIs	https://doi.org/10.1609/socs.v16i1.27296
State	Published - 2023
Externally published	Yes
Event	16th International Symposium on Combinatorial Search, SoCS 2023 - Prague, Czech Republic Duration: 14 Jul 2023 → 16 Jul 2023

Bibliographical note

Publisher Copyright:
© 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org).

Funding

This research was supported by The Israel US Binational Science Foundation (BSF) grant 2021643 to Ariel Felner. This work was partially funded by the Canada CIFAR AI Chairs Program. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC).

Funders	Funder number
United States - Israel Binational Science Foundation
Natural Sciences and Engineering Research Council of Canada
United States-Israel Binational Science Foundation	2021643

Access to Document

10.1609/socs.v16i1.27296

Cite this

@article{c97339ef69fa48398e6d81ce1e64e1e7,

title = "Comparing front-to-front and front-to-end heuristics in bidirectional search",

abstract = "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.",

author = "Lior Siag and Shperberg, \{Shahaf S.\} and Ariel Felner and Sturtevant, \{Nathan R.\}",

note = "Publisher Copyright: {\textcopyright} 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org).; 16th International Symposium on Combinatorial Search, SoCS 2023 ; Conference date: 14-07-2023 Through 16-07-2023",

year = "2023",

doi = "10.1609/socs.v16i1.27296",

language = "אנגלית",

volume = "16",

pages = "158--162",

journal = "The International Symposium on Combinatorial Search",

issn = "2832-9171",

publisher = "Association for the Advancement of Artificial Intelligence",

number = "1",

}

TY - JOUR

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

AU - Siag, Lior

AU - Shperberg, Shahaf S.

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85180549118

U2 - 10.1609/socs.v16i1.27296

DO - 10.1609/socs.v16i1.27296

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85180549118

SN - 2832-9171

VL - 16

SP - 158

EP - 162

JO - The International Symposium on Combinatorial Search

JF - The International Symposium on Combinatorial Search

IS - 1

T2 - 16th International Symposium on Combinatorial Search, SoCS 2023

Y2 - 14 July 2023 through 16 July 2023

ER -

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

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this