Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS

Ariel Felner

doi:10.1609/socs.v6i1.18355

Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS

Ariel Felner

Ben-Gurion University of the Negev

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

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Editors	Levi Lelis, Roni Stern
Publisher	Association for the Advancement of Artificial Intelligence
Pages	28-34
Number of pages	7
ISBN (Electronic)	9781577357322
DOIs	https://doi.org/10.1609/socs.v6i1.18355
State	Published - 2015
Externally published	Yes
Event	8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel Duration: 11 Jun 2015 → 13 Jun 2015

Publication series

Name	Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
Volume	2015-January

Conference

Conference	8th Annual Symposium on Combinatorial Search, SoCS 2015
Country/Territory	Israel
City	Ein Gedi
Period	11/06/15 → 13/06/15

Bibliographical note

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

Access to Document

10.1609/socs.v6i1.18355

Cite this

Felner, A. (2015). Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. In L. Lelis, & R. Stern (Eds.), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 (pp. 28-34). (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/socs.v6i1.18355

Felner, Ariel. / Position Paper : The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. editor / Levi Lelis ; Roni Stern. Association for the Advancement of Artificial Intelligence, 2015. pp. 28-34 (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015).

@inproceedings{eccd6767f9f64426920e44b36627d26a,

title = "Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS",

abstract = "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.",

author = "Ariel Felner",

note = "Publisher Copyright: Copyright {\textcopyright} 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 8th Annual Symposium on Combinatorial Search, SoCS 2015 ; Conference date: 11-06-2015 Through 13-06-2015",

year = "2015",

doi = "10.1609/socs.v6i1.18355",

language = "אנגלית",

series = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

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

pages = "28--34",

editor = "Levi Lelis and Roni Stern",

booktitle = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

}

Felner, A 2015, Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. in L Lelis & R Stern (eds), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015, vol. 2015-January, Association for the Advancement of Artificial Intelligence, pp. 28-34, 8th Annual Symposium on Combinatorial Search, SoCS 2015, Ein Gedi, Israel, 11/06/15. https://doi.org/10.1609/socs.v6i1.18355

Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. / Felner, Ariel.
Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. ed. / Levi Lelis; Roni Stern. Association for the Advancement of Artificial Intelligence, 2015. p. 28-34 (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January).

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

TY - GEN

T1 - Position Paper

T2 - 8th Annual Symposium on Combinatorial Search, SoCS 2015

AU - Felner, Ariel

PY - 2015

Y1 - 2015

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 - http://www.scopus.com/inward/record.url?scp=85048726477&partnerID=8YFLogxK

U2 - 10.1609/socs.v6i1.18355

DO - 10.1609/socs.v6i1.18355

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

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 -

Felner A. Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS. In Lelis L, Stern R, editors, Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. Association for the Advancement of Artificial Intelligence. 2015. p. 28-34. (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015). doi: 10.1609/socs.v6i1.18355

Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this