Minimizing node expansions in bidirectional search with consistent heuristics

Eshed Shaham; Ariel Felner; Nathan R. Sturtevant; Jeffrey S. Rosenschein

Minimizing node expansions in bidirectional search with consistent heuristics

Eshed Shaham
, Ariel Felner
, Nathan R. Sturtevant
, Jeffrey S. Rosenschein

Hebrew University of Jerusalem
Ben-Gurion University of the Negev
University of Denver

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

27 Scopus citations

Abstract

A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.

Original language	English
Title of host publication	Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018
Editors	Vadim Bulitko, Sabine Storandt
Publisher	AAAI press
Pages	81-89
Number of pages	9
ISBN (Electronic)	9781577358022
State	Published - 2018
Externally published	Yes
Event	11th International Symposium on Combinatorial Search, SoCS 2018 - Stockholm, Sweden Duration: 14 Jul 2018 → 15 Jul 2018

Publication series

Name	Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

Conference

Conference	11th International Symposium on Combinatorial Search, SoCS 2018
Country/Territory	Sweden
City	Stockholm
Period	14/07/18 → 15/07/18

Bibliographical note

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

Funding

The work was partially supported by the Israel Science Foundation (ISF) under grant #844/17 to Ariel Felner. This research has also been partially supported by the HUJI Cy-ber Security Research Center in conjunction with the Israel National Cyber Directorate (INCD) in the Prime Minister’s Office.

Funders	Funder number
Hebrew University of Jerusalem
Israel Science Foundation	844/17

Cite this

Shaham, E., Felner, A., Sturtevant, N. R., & Rosenschein, J. S. (2018). Minimizing node expansions in bidirectional search with consistent heuristics. In V. Bulitko, & S. Storandt (Eds.), Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018 (pp. 81-89). (Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018). AAAI press.

Shaham, Eshed ; Felner, Ariel ; Sturtevant, Nathan R. et al. / Minimizing node expansions in bidirectional search with consistent heuristics. Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018. editor / Vadim Bulitko ; Sabine Storandt. AAAI press, 2018. pp. 81-89 (Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018).

@inproceedings{7a5dda582c1342b890cbd3491167547d,

title = "Minimizing node expansions in bidirectional search with consistent heuristics",

abstract = "A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.",

author = "Eshed Shaham and Ariel Felner and Sturtevant, \{Nathan R.\} and Rosenschein, \{Jeffrey S.\}",

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

year = "2018",

language = "אנגלית",

series = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

publisher = "AAAI press",

pages = "81--89",

editor = "Vadim Bulitko and Sabine Storandt",

booktitle = "Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018",

}

Shaham, E, Felner, A, Sturtevant, NR & Rosenschein, JS 2018, Minimizing node expansions in bidirectional search with consistent heuristics. in V Bulitko & S Storandt (eds), Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018. Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018, AAAI press, pp. 81-89, 11th International Symposium on Combinatorial Search, SoCS 2018, Stockholm, Sweden, 14/07/18.

Minimizing node expansions in bidirectional search with consistent heuristics. / Shaham, Eshed; Felner, Ariel; Sturtevant, Nathan R. et al.
Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018. ed. / Vadim Bulitko; Sabine Storandt. AAAI press, 2018. p. 81-89 (Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018).

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

TY - GEN

T1 - Minimizing node expansions in bidirectional search with consistent heuristics

AU - Shaham, Eshed

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

AU - Rosenschein, Jeffrey S.

PY - 2018

Y1 - 2018

N2 - A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.

AB - A* is optimally effective with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. Among bidirectional algorithms the Fractional MM algorithm is optimally effective (given the correct parameters) among admissible algorithms. This paper generalizes the bidirectional result to more complex settings where more information on the problem domain can be exploited: (1) When the cost of the minimal edge ? is known. (2) When the algorithm knows that the heuristics are consistent. This characterization uses a novel algorithm called MT. MT is similar to Fractional MM and is also optimally effective, but simpler to analyze.

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

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

AN - SCOPUS:85074929198

T3 - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

SP - 81

EP - 89

BT - Proceedings of the 11th International Symposium on Combinatorial Search, SoCS 2018

A2 - Bulitko, Vadim

A2 - Storandt, Sabine

PB - AAAI press

T2 - 11th International Symposium on Combinatorial Search, SoCS 2018

Y2 - 14 July 2018 through 15 July 2018

ER -

Minimizing node expansions in bidirectional search with consistent heuristics

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this