{"type":"ScholarlyArticle","title":"Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces","authors":[{"name":"Akihiro Kishimoto","slug":"akihiro-kishimoto","given":"Akihiro","family":"Kishimoto","affiliation":"IBM Research , Ireland"},{"name":"Adi Botea","slug":"adi-botea","given":"Adi","family":"Botea","affiliation":"IBM Research , Ireland"},{"name":"Radu Marinescu","slug":"radu-marinescu","given":"Radu","family":"Marinescu","affiliation":"IBM Research , Ireland"}],"abstract":"Computing cycle-free solutions in cyclic AND/OR search spaces is an important AI problem.  Previous work on optimal depth-first search strongly assumes the use of consistent heuristics, the need to keep all examined states in a transposition table, and the existence of solutions.  We give a new theoretical analysis under relaxed assumptions where previous results no longer hold.  We then present a generic approachto proving unsolvability, and apply it to RBFAOO and BLDFS, two state-of-the-art algorithms. We demonstrate the performance in domain-independent nondeterministic planning","doi":"10.24963/ijcai.2019/178","url":"https://ijcai.org/proceedings/2019/178","pdf":"https://ijcai.org/proceedings/2019/0178.pdf","markdown":"https://ijcai.org/proceedings/2019/178.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/178","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Heuristic Search and Game Playing","track":"Main track","number":178,"pages":{"first":1280,"last":1288},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Heuristic Search and Game Playing: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Akagi et al., 2010] Yuima Akagi, Akihiro Kishimoto, and Alex Fukunaga. On transposition tables for single-agent search and planning: Summary of results. In Proceedings of the 3rd Symposium on Combinatorial Search, pages 1- 8, 2010.","title":"On transposition tables for single-agent search and planning: Summary of results","authors":"Akagi","year":"2010","venue":"Proceedings of the 3rd Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bellman, 1957] Richard E. Bellman. Dynamic Program- ming. Princeton University Press, 1957.","title":"Dynamic Programming","authors":"Richard E Bellman","year":"1957","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. Artificial Intelligence, 120:5- 33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonet and Geffner, 2005a] Blai Bonet and Héctor Geffner. An algorithm better than AO*? In AAAI, pages 1343- 1348, 2005.","title":"An algorithm better than AO*?","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2005","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bonet and Geffner, 2005b] Blai Bonet and Héctor Geffner. Learning in depth-first search: A unified approach to heuristic search in deterministic, non-deterministic, prob- abilistic, and game tree settings. Technical report, Univer- sidad Simon Bolivar, 2005. Available at https://bonetblai. github.io/#publications.","title":"Learning in depth-first search: A unified approach to heuristic search in deterministic, non-deterministic, probabilistic, and game tree settings","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2005","venue":null,"doi":null,"url":"https://bonetblai.github.io/#publications","internal_url":null},{"position":6,"raw":"[Bonet and Geffner, 2006] Blai Bonet and Héctor Geffner. Learning depth-first search: A unified approach to heuris- tic search in deterministic and non-deterministic settings, and its application to MDPs. In ICAPS, pages 142-151, 2006.","title":"Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs","authors":"Geffner ; ] Blai Bonet, Héctor Bonet, Geffner","year":"2006","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Campbell, 1985] Murray Campbell. The graph-history in- teraction: On ignoring position history. In 1985 ACM An- nual Conference, pages 278-280, 1985.","title":"The graph-history interaction: On ignoring position history","authors":"Murray Campbell, Campbell","year":"1985","venue":"ACM Annual Conference","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chakrabarti et al., 1989] Partha P. Chakrabarti, Sujoy Ghose, Arup Acharya, and S. C. De Sarkar. Heuristic search in restricted memory. Artificial Intelligence, 41(2):197-221, 1989.","title":"Heuristic search in restricted memory","authors":"Partha P Chakrabarti, Sujoy Ghose, Arup Acharya, S C De Sarkar","year":"1989","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eriksson et al., 2017] Salomé Eriksson, Gabriele Röger, and Malte Helmert. Unsolvability certificates for classi- cal planning. In ICAPS, pages 88-97, 2017.","title":"Unsolvability certificates for classical planning","authors":"Salomé Eriksson, Gabriele Röger, Malte Helmert","year":"2017","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eriksson et al., 2018a] Salomé Eriksson, Gabriele Röger, and Malte Helmert. Inductive certificates of unsolvability for domain-independent planning. In IJCAI, pages 5244- 5248, 2018.","title":"Inductive certificates of unsolvability for domain-independent planning","authors":"Eriksson","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/730"},{"position":11,"raw":"[Eriksson et al., 2018b] Salomé Eriksson, Gabriele Röger, and Malte Helmert. A proof system for unsolvable plan- ning tasks. In ICAPS, pages 65-73, 2018.","title":"A proof system for unsolvable planning tasks","authors":"Eriksson","year":"2018","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fu et al., 2013] Jicheng Fu, Andres C. Jaramillo, Vincent Ng, Farokh B. Bastani, and I-Ling Yen. Fast strong plan- ning for FOND problems with multi-root directed acyclic graphs. In Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, pages 87- 94, 2013.","title":"Fast strong planning for FOND problems with multi-root directed acyclic graphs","authors":"Jicheng Fu, Andres C Jaramillo, Vincent Ng, Farokh B Bastani, I-Ling Yen","year":"2013","venue":"Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hansen and Zilberstein, 2001] Eric A. Hansen and Shlomo Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129:35-62, 2001.","title":"LAO*: A heuristic search algorithm that finds solutions with loops","authors":"Eric A Hansen, Shlomo Zilberstein","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Haslum and Geffner, 2000] Patrik Haslum and Héctor Geffner. Admissible heuristics for optimal planning. In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, pages 140-149, 2000.","title":"Admissible heuristics for optimal planning","authors":"Geffner Haslum, Patrik Haslum, Héctor Geffner","year":"2000","venue":"Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Heifets and Jurisica, 2012] Abraham Heifets and Igor Ju- risica. Construction of new medicines via game proof search. In J. Hoffmann and B. Selman, editors, AAAI, pages 1564-1570, 2012.","title":"Abraham Heifets and Igor Jurisica. Construction of new medicines via game proof search","authors":"Jurisica Heifets","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Holte, 2010] Robert C. Holte. Common misconceptions concerning heuristic search. In Proceedings of the 3rd Symposium on Combinatorial Search, pages 46-51, 2010.","title":"Common misconceptions concerning heuristic search","authors":"C Robert, Holte","year":"2010","venue":"Proceedings of the 3rd Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Jiménez and Torras, 2000] Pablo Jiménez and Carme Tor- ras. An efficient algorithm for searching implicit AND/OR graphs with cycles. Artificial Intelligence, 124:1-30, 2000.","title":"Pablo Jiménez and Carme Torras. An efficient algorithm for searching implicit AND/OR graphs with cycles","authors":"Torras Jiménez","year":"2000","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kishimoto and Marinescu, 2014] Akihiro Kishimoto and Radu Marinescu. Recursive best-first AND/OR search for optimization in graphical models. In UAI, pages 400-409, 2014.","title":"Recursive best-first AND/OR search for optimization in graphical models","authors":"Marinescu Kishimoto, Akihiro Kishimoto, Radu Marinescu","year":"2014","venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kishimoto and Müller, 2004] Akihiro Kishimoto and Mar- tin Müller. A general solution to the graph history interac- tion problem. In AAAI, pages 644-649, 2004.","title":"Akihiro Kishimoto and Martin Müller. A general solution to the graph history interaction problem","authors":"Müller Kishimoto","year":"2004","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Korf, 1985] Richard E. Korf. Depth-first iterative deepen- ing: An optimal admissible tree search. Artificial Intelli- gence, 27(1):97-109, 1985.","title":"Depth-first iterative deepening: An optimal admissible tree search","authors":"Richard E Korf","year":"1985","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Korf, 1993] Richard E. Korf. Linear-space best-first search. Artificial Intelligence, 62:41-78, 1993.","title":"Linear-space best-first search","authors":"Richard E Korf","year":"1993","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Liang and Su, 2005] Qianhui A. Liang and Stanley Y. W. Su. AND/OR graph and search algorithm for discover- ing composite web services. International Journal of Web Services Research, 2(4):48-67, 2005.","title":"AND/OR graph and search algorithm for discovering composite web services","authors":"Su ; Liang, Qianhui A Liang, Y W Stanley, Su","year":"2005","venue":"International Journal of Web Services Research","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nagai, 1999] Ayumu Nagai. A new depth-first search algo- rithm for AND/OR trees. Master's thesis, The University of Tokyo, 1999.","title":"A new depth-first search algorithm for AND/OR trees","authors":"Ayumu Nagai","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nilsson, 1980] Nils J. Nilsson. Principles of Artificial Intel- ligence. Tioga Publishing Co, Palo Alto, CA, 1980.","title":"Principles of Artificial Intelligence","authors":"Nils J Nilsson","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Plaat et al., 1996] Aske Plaat, Jonathan Schaeffer, Wim Pi- jls, and Arie de Bruin. Best-first fixed-depth minimax al- gorithms. Artificial Intelligence, 87(1-2):255-293, 1996.","title":"Best-first fixed-depth minimax algorithms","authors":"Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie De Bruin","year":"1996","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Reinefeld and Marsland, 1994] Alexander Reinefeld and T. Anthony Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Ma- chine Intelligence, 16(7):701-710, 1994.","title":"Enhanced iterative-deepening search","authors":"Alexander Reinefeld, T Anthony Marsland","year":"1994","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}