Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract)

Shahaf S. Shperberg; Ariel Felner; Nathan R. Sturtevant; Eyal Shimony; Avi Hayoun

Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract)

Shahaf S. Shperberg
, Ariel Felner
, Nathan R. Sturtevant
, Eyal Shimony
, Avi Hayoun

Ben-Gurion University of the Negev
University of Alberta

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them”well behaved”.

Original language	English
Title of host publication	Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020
Editors	Christian Bessiere
Publisher	International Joint Conferences on Artificial Intelligence
Pages	4775-4779
Number of pages	5
ISBN (Electronic)	9780999241165
State	Published - 2020
Externally published	Yes
Event	29th International Joint Conference on Artificial Intelligence, IJCAI 2020 - Yokohama, Japan Duration: 1 Jan 2021 → …

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
Volume	2021-January
ISSN (Print)	1045-0823

Conference

Conference	29th International Joint Conference on Artificial Intelligence, IJCAI 2020
Country/Territory	Japan
City	Yokohama
Period	1/01/21 → …

Bibliographical note

Publisher Copyright:
© 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

Funding

Partially supported by ISF grant #844/17, by BSF grant #2017692, by NSF grant #1815660, by the Frankel center for CS at BGU, by CIFAR and NSERC.

Funders	Funder number
National Science Foundation	1815660
Canadian Institute for Advanced Research
Natural Sciences and Engineering Research Council of Canada
United States-Israel Binational Science Foundation	2017692
Israel Science Foundation	844/17

Cite this

Shperberg, S. S., Felner, A., Sturtevant, N. R., Shimony, E., & Hayoun, A. (2020). Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract). In C. Bessiere (Ed.), Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020 (pp. 4775-4779). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2021-January). International Joint Conferences on Artificial Intelligence.

Shperberg, Shahaf S. ; Felner, Ariel ; Sturtevant, Nathan R. et al. / Bidirectional heuristic search : Expanding nodes by a lower bound (extended abstract). Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020. editor / Christian Bessiere. International Joint Conferences on Artificial Intelligence, 2020. pp. 4775-4779 (IJCAI International Joint Conference on Artificial Intelligence).

@inproceedings{3bf4d3c2c76340ffb159898b36d99e62,

title = "Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract)",

abstract = "Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them{\textquotedblright}well behaved{\textquotedblright}.",

author = "Shperberg, \{Shahaf S.\} and Ariel Felner and Sturtevant, \{Nathan R.\} and Eyal Shimony and Avi Hayoun",

note = "Publisher Copyright: {\textcopyright} 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.; 29th International Joint Conference on Artificial Intelligence, IJCAI 2020 ; Conference date: 01-01-2021",

year = "2020",

language = "אנגלית",

series = "IJCAI International Joint Conference on Artificial Intelligence",

publisher = "International Joint Conferences on Artificial Intelligence",

pages = "4775--4779",

editor = "Christian Bessiere",

booktitle = "Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020",

}

Shperberg, SS, Felner, A, Sturtevant, NR, Shimony, E & Hayoun, A 2020, Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract). in C Bessiere (ed.), Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020. IJCAI International Joint Conference on Artificial Intelligence, vol. 2021-January, International Joint Conferences on Artificial Intelligence, pp. 4775-4779, 29th International Joint Conference on Artificial Intelligence, IJCAI 2020, Yokohama, Japan, 1/01/21.

Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract). / Shperberg, Shahaf S.; Felner, Ariel; Sturtevant, Nathan R. et al.
Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020. ed. / Christian Bessiere. International Joint Conferences on Artificial Intelligence, 2020. p. 4775-4779 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2021-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bidirectional heuristic search

T2 - 29th International Joint Conference on Artificial Intelligence, IJCAI 2020

AU - Shperberg, Shahaf S.

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

AU - Shimony, Eyal

AU - Hayoun, Avi

PY - 2020

Y1 - 2020

N2 - Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them”well behaved”.

AB - Recent work on bidirectional search defined a lower bound on costs of paths between pairs of nodes, and introduced a new algorithm, NBS, which is based on this bound. Building on these results, we introduce DVCBS, a new algorithm that aims to to further reduce the number of expansions. Generalizing beyond specific algorithms, we then propose a method for enhancing heuristics by propagating such lower bounds (lb-propagation) between frontiers. This lb-propagation can be used in existing algorithms, often improving their performance, as well as making them”well behaved”.

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85097339735

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 4775

EP - 4779

BT - Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020

A2 - Bessiere, Christian

PB - International Joint Conferences on Artificial Intelligence

Y2 - 1 January 2021

ER -

Shperberg SS, Felner A, Sturtevant NR, Shimony E, Hayoun A. Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract). In Bessiere C, editor, Proceedings of the 29th International Joint Conference on Artificial Intelligence, IJCAI 2020. International Joint Conferences on Artificial Intelligence. 2020. p. 4775-4779. (IJCAI International Joint Conference on Artificial Intelligence).

Bidirectional heuristic search: Expanding nodes by a lower bound (extended abstract)

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this