Validation and Implementation of ILBFS
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909253212569600 |
|---|---|
| author | Grabovski, Fred Matanel Yasur, Lior |
| author_facet | Grabovski, Fred Matanel Yasur, Lior |
| contents | Recursive Best-First Search (RBFS) is a heuristic search algorithm known for its efficient memory usage compared to traditional best-first search methods like A*. Despite its theoretical advantages, RBFS is complex and difficult to teach and to implement, limiting its widespread adoption. To address these challenges, Iterative Linear Best-First Search (ILBFS) was introduced as a simpler, more intuitive alternative while maintaining the linear space complexity of RBFS. In this paper, we present the first implementation of ILBFS, validate its memory usage and node expansion order claims, and explore critical aspects of its implementation, such as tie-breaking and node deletion mechanisms. Our findings demonstrate that ILBFS can serve as an effective stepping stone for researchers and practitioners looking to use memory efficient best-first search methods, facilitating the adoption of RBFS-like algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_01637 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Validation and Implementation of ILBFS Grabovski, Fred Matanel Yasur, Lior Data Structures and Algorithms Recursive Best-First Search (RBFS) is a heuristic search algorithm known for its efficient memory usage compared to traditional best-first search methods like A*. Despite its theoretical advantages, RBFS is complex and difficult to teach and to implement, limiting its widespread adoption. To address these challenges, Iterative Linear Best-First Search (ILBFS) was introduced as a simpler, more intuitive alternative while maintaining the linear space complexity of RBFS. In this paper, we present the first implementation of ILBFS, validate its memory usage and node expansion order claims, and explore critical aspects of its implementation, such as tie-breaking and node deletion mechanisms. Our findings demonstrate that ILBFS can serve as an effective stepping stone for researchers and practitioners looking to use memory efficient best-first search methods, facilitating the adoption of RBFS-like algorithms. |
| title | Validation and Implementation of ILBFS |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2407.01637 |