Optimally efficient bidirectional search

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

doi:10.24963/ijcai.2019/867

Optimally efficient bidirectional search

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

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

1 Scopus citations

Abstract

A^∗ is optimally efficient with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm.

Original language	English
Title of host publication	Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Editors	Sarit Kraus
Publisher	International Joint Conferences on Artificial Intelligence
Pages	6221-6225
Number of pages	5
ISBN (Electronic)	9780999241141
DOIs	https://doi.org/10.24963/ijcai.2019/867
State	Published - 2019
Event	28th International Joint Conference on Artificial Intelligence, IJCAI 2019 - Macao, China Duration: 10 Aug 2019 → 16 Aug 2019

Publication series

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

Conference

Conference	28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Country/Territory	China
City	Macao
Period	10/08/19 → 16/08/19

Bibliographical note

Publisher Copyright:
© 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.

Access to Document

10.24963/ijcai.2019/867

Cite this

Shaham, E., Felner, A., Sturtevant, N. R., & Rosenschein, J. S. (2019). Optimally efficient bidirectional search. In S. Kraus (Ed.), Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 (pp. 6221-6225). (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2019-August). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2019/867

@inproceedings{97f195f8597b4bf0bd2127d6f56a6bb1,

title = "Optimally efficient bidirectional search",

abstract = "A∗ is optimally efficient with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm.",

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

note = "Publisher Copyright: {\textcopyright} 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.; 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 ; Conference date: 10-08-2019 Through 16-08-2019",

year = "2019",

doi = "10.24963/ijcai.2019/867",

language = "אנגלית",

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

publisher = "International Joint Conferences on Artificial Intelligence",

pages = "6221--6225",

editor = "Sarit Kraus",

booktitle = "Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019",

}

Shaham, E, Felner, A, Sturtevant, NR & Rosenschein, JS 2019, Optimally efficient bidirectional search. in S Kraus (ed.), Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. IJCAI International Joint Conference on Artificial Intelligence, vol. 2019-August, International Joint Conferences on Artificial Intelligence, pp. 6221-6225, 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10/08/19. https://doi.org/10.24963/ijcai.2019/867

Optimally efficient bidirectional search. / Shaham, Eshed; Felner, Ariel; Sturtevant, Nathan R. et al.
Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. ed. / Sarit Kraus. International Joint Conferences on Artificial Intelligence, 2019. p. 6221-6225 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2019-August).

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

TY - GEN

T1 - Optimally efficient bidirectional search

AU - Shaham, Eshed

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

AU - Rosenschein, Jeffrey S.

PY - 2019

Y1 - 2019

N2 - A∗ is optimally efficient with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm.

AB - A∗ is optimally efficient with regard to node expansions among unidirectional admissible algorithms-those that only assume that the heuristic used is admissible. This paper studies algorithms that are optimally efficient for bidirectional search algorithms. We present the Fractional MM algorithm and its sibling, the MT algorithm, which is simpler to analyze. We then develop variants of these algorithms that are optimally efficient, each under different assumptions on the information available to the algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85074946331&partnerID=8YFLogxK

U2 - 10.24963/ijcai.2019/867

DO - 10.24963/ijcai.2019/867

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

AN - SCOPUS:85074946331

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 6221

EP - 6225

BT - Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019

A2 - Kraus, Sarit

PB - International Joint Conferences on Artificial Intelligence

T2 - 28th International Joint Conference on Artificial Intelligence, IJCAI 2019

Y2 - 10 August 2019 through 16 August 2019

ER -

Shaham E, Felner A, Sturtevant NR, Rosenschein JS. Optimally efficient bidirectional search. In Kraus S, editor, Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. International Joint Conferences on Artificial Intelligence. 2019. p. 6221-6225. (IJCAI International Joint Conference on Artificial Intelligence). doi: 10.24963/ijcai.2019/867

Optimally efficient bidirectional search

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this