Iterative-deepening Bidirectional Heuristic Search with Restricted Memor

Shahaf S. Shperberg; Steven Danishevski; Ariel Felner; Nathan R. Sturtevant

Iterative-deepening Bidirectional Heuristic Search with Restricted Memor

Shahaf S. Shperberg
, Steven Danishevski
, Ariel Felner
, Nathan R. Sturtevant

Ben-Gurion University of the Negev
University of Alberta

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

Abstract

This extended abstract presents a bidirectional heuristic search algorithm called IDBiHS that operates under restricted memory. Several variants of this algorithm are introduced for different types of memory restrictions, and are compared against existing algorithms with similar restrictions.

Original language	English
Title of host publication	14th International Symposium on Combinatorial Search, SoCS 2021
Editors	Hang Ma, Ivan Serina
Publisher	Association for the Advancement of Artificial Intelligence
Pages	194-196
Number of pages	3
ISBN (Electronic)	9781713834557
State	Published - 2021
Externally published	Yes
Event	14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China Duration: 26 Jul 2021 → 30 Jul 2021

Publication series

Name	14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference	14th International Symposium on Combinatorial Search, SoCS 2021
Country/Territory	China
City	Guangzhou, Virtual
Period	26/07/21 → 30/07/21

Bibliographical note

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

Cite this

Shperberg, S. S., Danishevski, S., Felner, A., & Sturtevant, N. R. (2021). Iterative-deepening Bidirectional Heuristic Search with Restricted Memor. In H. Ma, & I. Serina (Eds.), 14th International Symposium on Combinatorial Search, SoCS 2021 (pp. 194-196). (14th International Symposium on Combinatorial Search, SoCS 2021). Association for the Advancement of Artificial Intelligence.

Shperberg, Shahaf S. ; Danishevski, Steven ; Felner, Ariel et al. / Iterative-deepening Bidirectional Heuristic Search with Restricted Memor. 14th International Symposium on Combinatorial Search, SoCS 2021. editor / Hang Ma ; Ivan Serina. Association for the Advancement of Artificial Intelligence, 2021. pp. 194-196 (14th International Symposium on Combinatorial Search, SoCS 2021).

@inproceedings{6fdf09c0410443f6a0483f4d42dd7dea,

title = "Iterative-deepening Bidirectional Heuristic Search with Restricted Memor",

abstract = "This extended abstract presents a bidirectional heuristic search algorithm called IDBiHS that operates under restricted memory. Several variants of this algorithm are introduced for different types of memory restrictions, and are compared against existing algorithms with similar restrictions.",

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

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

year = "2021",

language = "אנגלית",

series = "14th International Symposium on Combinatorial Search, SoCS 2021",

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

pages = "194--196",

editor = "Hang Ma and Ivan Serina",

booktitle = "14th International Symposium on Combinatorial Search, SoCS 2021",

}

Shperberg, SS, Danishevski, S, Felner, A & Sturtevant, NR 2021, Iterative-deepening Bidirectional Heuristic Search with Restricted Memor. in H Ma & I Serina (eds), 14th International Symposium on Combinatorial Search, SoCS 2021. 14th International Symposium on Combinatorial Search, SoCS 2021, Association for the Advancement of Artificial Intelligence, pp. 194-196, 14th International Symposium on Combinatorial Search, SoCS 2021, Guangzhou, Virtual, China, 26/07/21.

Iterative-deepening Bidirectional Heuristic Search with Restricted Memor. / Shperberg, Shahaf S.; Danishevski, Steven; Felner, Ariel et al.
14th International Symposium on Combinatorial Search, SoCS 2021. ed. / Hang Ma; Ivan Serina. Association for the Advancement of Artificial Intelligence, 2021. p. 194-196 (14th International Symposium on Combinatorial Search, SoCS 2021).

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

TY - GEN

T1 - Iterative-deepening Bidirectional Heuristic Search with Restricted Memor

AU - Shperberg, Shahaf S.

AU - Danishevski, Steven

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

PY - 2021

Y1 - 2021

N2 - This extended abstract presents a bidirectional heuristic search algorithm called IDBiHS that operates under restricted memory. Several variants of this algorithm are introduced for different types of memory restrictions, and are compared against existing algorithms with similar restrictions.

AB - This extended abstract presents a bidirectional heuristic search algorithm called IDBiHS that operates under restricted memory. Several variants of this algorithm are introduced for different types of memory restrictions, and are compared against existing algorithms with similar restrictions.

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

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

AN - SCOPUS:85124604397

T3 - 14th International Symposium on Combinatorial Search, SoCS 2021

SP - 194

EP - 196

BT - 14th International Symposium on Combinatorial Search, SoCS 2021

A2 - Ma, Hang

A2 - Serina, Ivan

PB - Association for the Advancement of Artificial Intelligence

T2 - 14th International Symposium on Combinatorial Search, SoCS 2021

Y2 - 26 July 2021 through 30 July 2021

ER -

Iterative-deepening Bidirectional Heuristic Search with Restricted Memor

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this