TY - GEN
T1 - Position Paper
T2 - 8th Annual Symposium on Combinatorial Search, SoCS 2015
AU - Felner, Ariel
N1 - Publisher Copyright:
Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - This paper makes two pedagogical contributions. First, we describe two macro operators for best-first search algorithms: the collapse macro where a subtree is deleted from memory and its best frontier value is stored in its root, and, the restore macro (the inverse of collapse) where the subtree is restored to its previous structure. We show that many known search algorithms can be easily described by using these macros. The second contribution is an algorithm called Iterative Linear Best-first Search (ILBFS). ILBFS is equivalent to RBFS. While RBFS uses a recursive structure, ILBFS uses the regular structure of BFS with occasionally using the collapse and restore macros. ILBFS and RBFS are identical in the nodes that they visit and have identical properties. But, I believe that ILBFS is pedagogically simpler to describe and understand; it could at least serve as a pedagogical tool for RBFS.
AB - This paper makes two pedagogical contributions. First, we describe two macro operators for best-first search algorithms: the collapse macro where a subtree is deleted from memory and its best frontier value is stored in its root, and, the restore macro (the inverse of collapse) where the subtree is restored to its previous structure. We show that many known search algorithms can be easily described by using these macros. The second contribution is an algorithm called Iterative Linear Best-first Search (ILBFS). ILBFS is equivalent to RBFS. While RBFS uses a recursive structure, ILBFS uses the regular structure of BFS with occasionally using the collapse and restore macros. ILBFS and RBFS are identical in the nodes that they visit and have identical properties. But, I believe that ILBFS is pedagogically simpler to describe and understand; it could at least serve as a pedagogical tool for RBFS.
UR - https://www.scopus.com/pages/publications/85048726477
U2 - 10.1609/socs.v6i1.18355
DO - 10.1609/socs.v6i1.18355
M3 - Conference contribution
AN - SCOPUS:85048726477
T3 - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
SP - 28
EP - 34
BT - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
A2 - Lelis, Levi
A2 - Stern, Roni
PB - Association for the Advancement of Artificial Intelligence
Y2 - 11 June 2015 through 13 June 2015
ER -