Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory

Authors

  • Shahaf S. Shperberg Ben-Gurion University, Be'er Sheva, Israel
  • Steven Danishevski Ben-Gurion University, Be'er Sheva, Israel
  • Ariel Felner Ben-Gurion University, Be'er Sheva, Israel
  • Nathan R. Sturtevant University of Alberta, Edmonton, Canada

DOI:

https://doi.org/10.1609/socs.v12i1.18581

Keywords:

Problem Solving Using Search, Time, Memory, And Solution Quality Trade-offs

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.
SoCS-2021 Proceedings Cover

Downloads

Published

2021-07-22

How to Cite

Shperberg, S. S., Danishevski, S., Felner, A., & Sturtevant, N. R. (2021). Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory. Proceedings of the International Symposium on Combinatorial Search, 12(1), 194–196. https://doi.org/10.1609/socs.v12i1.18581

Issue

Vol. 12 No. 1 (2021): Fourteenth International Symposium on Combinatorial Search

Section

Extended Abstracts