Enriching non-parametric bidirectional search algorithms - Extended abstract

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

Enriching non-parametric bidirectional search algorithms - Extended abstract

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

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

Abstract

NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.

Original language	English
Title of host publication	Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
Editors	Pavel Surynek, William Yeoh
Publisher	AAAI press
Pages	196-197
Number of pages	2
ISBN (Electronic)	9781577358084
State	Published - 2019
Externally published	Yes
Event	12th International Symposium on Combinatorial Search, SoCS 2019 - Napa, United States Duration: 16 Jul 2019 → 17 Jul 2019

Publication series

Name	Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019

Conference

Conference	12th International Symposium on Combinatorial Search, SoCS 2019
Country/Territory	United States
City	Napa
Period	16/07/19 → 17/07/19

Bibliographical note

Publisher Copyright:
Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

This work was supported by Israel Science Foundation (ISF) grant #844/17 to Ariel Felner and Eyal Shimony, by BSF grant #2017692, by NSF grant #1815660 and by the Frankel center for CS at BGU.

Funders	Funder number
National Science Foundation	1815660
United States-Israel Binational Science Foundation	2017692
Israel Science Foundation	844/17

Cite this

Shperberg, S. S., Felner, A., Sturtevant, N. R., Shimony, S. E., & Hayoun, A. (2019). Enriching non-parametric bidirectional search algorithms - Extended abstract. In P. Surynek, & W. Yeoh (Eds.), Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 (pp. 196-197). (Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019). AAAI press.

Shperberg, Shahaf S. ; Felner, Ariel ; Sturtevant, Nathan R. et al. / Enriching non-parametric bidirectional search algorithms - Extended abstract. Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019. editor / Pavel Surynek ; William Yeoh. AAAI press, 2019. pp. 196-197 (Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019).

@inproceedings{b8dea6ca99aa4cbcadf707c04e03e1c1,

title = "Enriching non-parametric bidirectional search algorithms - Extended abstract",

abstract = "NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.",

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

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

year = "2019",

language = "אנגלית",

series = "Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019",

publisher = "AAAI press",

pages = "196--197",

editor = "Pavel Surynek and William Yeoh",

booktitle = "Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019",

}

Shperberg, SS, Felner, A, Sturtevant, NR, Shimony, SE & Hayoun, A 2019, Enriching non-parametric bidirectional search algorithms - Extended abstract. in P Surynek & W Yeoh (eds), Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019. Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019, AAAI press, pp. 196-197, 12th International Symposium on Combinatorial Search, SoCS 2019, Napa, United States, 16/07/19.

Enriching non-parametric bidirectional search algorithms - Extended abstract. / Shperberg, Shahaf S.; Felner, Ariel; Sturtevant, Nathan R. et al.
Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019. ed. / Pavel Surynek; William Yeoh. AAAI press, 2019. p. 196-197 (Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019).

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

TY - GEN

T1 - Enriching non-parametric bidirectional search algorithms - Extended abstract

AU - Shperberg, Shahaf S.

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

AU - Shimony, Solomon E.

AU - Hayoun, Avi

PY - 2019

Y1 - 2019

N2 - NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.

AB - NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.

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

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

AN - SCOPUS:85086833344

T3 - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019

SP - 196

EP - 197

BT - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019

A2 - Surynek, Pavel

A2 - Yeoh, William

PB - AAAI press

T2 - 12th International Symposium on Combinatorial Search, SoCS 2019

Y2 - 16 July 2019 through 17 July 2019

ER -

Enriching non-parametric bidirectional search algorithms - Extended abstract

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this