{"type":"ScholarlyArticle","title":"Computing Programs for Generalized Planning as Heuristic Search (Extended Abstract)","authors":[{"name":"Javier Segovia-Aguas","slug":"javier-segovia-aguas","given":"Javier","family":"Segovia-Aguas","affiliation":"Dept. Information and Communication Technologies , Universitat Pompeu Fabra , Spain"},{"name":"Sergio Jiménez Celorrio","slug":"sergio-jimenez-celorrio","given":"Sergio","family":"Jiménez Celorrio","affiliation":"Valencian Research Institute for Artificial Intelligence , Universitat Politècnica de València , Spain"},{"name":"Anders Jonsson","slug":"anders-jonsson","given":"Anders","family":"Jonsson","affiliation":"Dept. Information and Communication Technologies , Universitat Pompeu Fabra , Spain"}],"abstract":"Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP).  This paper adapts the planning as heuristic search paradigm to the particularities of GP, and presents the first native heuristic search approach to GP. First, the paper defines a program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our program-based solution space, and that is guided by different evaluation and heuristic functions.","doi":"10.24963/ijcai.2022/746","url":"https://ijcai.org/proceedings/2022/746","pdf":"https://ijcai.org/proceedings/2022/0746.pdf","markdown":"https://ijcai.org/proceedings/2022/746.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/746","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":746,"pages":{"first":5334,"last":5338},"keywords":["Artificial Intelligence: General"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987260","length_sec":91,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985403","length_sec":599,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Alur et al., 2018] Rajeev Alur, Rishabh Singh, Dana Fis- man, and Armando Solar-Lezama. Search-based program synthesis. Communications of the ACM, 61(12):84-93, 2018.","title":"Search-based program synthesis","authors":"Rajeev Alur, Rishabh Singh, Dana Fisman, Armando Solar-Lezama","year":"2018","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. Artificial Intelligence, 129: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":3,"raw":"[Bonet et al., 2010] Blai Bonet, Hector Palacios, and Hector Geffner. Automatic derivation of finite-state machines for behavior control. In AAAI, volume 24, 2010.","title":"Automatic derivation of finite-state machines for behavior control","authors":"Blai Bonet, Hector Palacios, Hector Geffner","year":"2010","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Boolos et al., 2002] George S Boolos, John P Burgess, and Richard C Jeffrey. Computability and logic. Cambridge university press, 2002.","title":"Computability and logic","authors":"John P George S Boolos, Richard C Burgess, Jeffrey","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dandamudi, 2005] Sivarama P Dandamudi. Installing and using nasm. Guide to Assembly Language Programming in Linux, 2005.","title":"Installing and using nasm","authors":"P Sivarama, Dandamudi","year":"2005","venue":"Guide to Assembly Language Programming in Linux","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Francès et al., 2021] Guillem Francès, Blai Bonet, and Hec- tor Geffner. Learning general planning policies from small examples without supervision. In AAAI, 2021.","title":"Learning general planning policies from small examples without supervision","authors":"Guillem Francès, Blai Bonet, Hector Geffner","year":"2021","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Francès, 2017] Guillem Francès. Effective planning with expressive languages. PhD thesis, Universitat Pompeu Fabra, 2017.","title":"Effective planning with expressive languages","authors":"Guillem Francès","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gulwani et al., 2017] Sumit Gulwani, Oleksandr Polozov, Rishabh Singh, et al. Program synthesis. Foundations and Trends in Programming Languages, 2017.","title":"Program synthesis","authors":"Sumit Gulwani, Oleksandr Polozov, Rishabh Singh","year":"2017","venue":"Foundations and Trends in Programming Languages","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward Plan- ning System. JAIR, 26:191-246, 2006.","title":"The Fast Downward Planning System","authors":"Malte Helmert","year":"2006","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hoffmann, 2003] Jörg Hoffmann. The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables. JAIR, 20:291-341, 2003.","title":"The metric-ff planning system: Translating \"ignoring delete lists\" to numeric state variables","authors":"Jörg Hoffmann","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Hu and De Giacomo, 2013] Yuxiao Hu and Giuseppe De Giacomo. A generic technique for synthesizing bounded finite-state controllers. In ICAPS, 2013.","title":"Yuxiao Hu and Giuseppe De Giacomo. A generic technique for synthesizing bounded finite-state controllers","authors":"De Hu, Giacomo","year":"2013","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hu and Levesque, 2011] Yuxiao Hu and Hector J. Levesque. A correctness result for reasoning about one-dimensional planning problems. In IJCAI, pages 2638-2643, 2011.","title":"A correctness result for reasoning about one-dimensional planning problems","authors":"Levesque Hu, Yuxiao Hu, Hector J Levesque","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/439"},{"position":13,"raw":"[Illanes and McIlraith, 2019] León Illanes and Sheila A McIlraith. Generalized planning via abstraction: arbitrary numbers of objects. In AAAI, volume 33, pages 7610- 7618, 2019.","title":"Generalized planning via abstraction: arbitrary numbers of objects","authors":"Mcilraith Illanes, León Illanes, Sheila A Mcilraith","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Jimenez and Jonsson, 2015] Sergio Jimenez and Anders Jonsson. Computing plans with control flow and proce- dures using a classical planner. In International Sympo- sium on Combinatorial Search, 2015.","title":"Computing plans with control flow and procedures using a classical planner","authors":"Jonsson Jimenez, Sergio Jimenez, Anders Jonsson","year":"2015","venue":"International Symposium on Combinatorial Search","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jiménez et al., 2019] Sergio Jiménez, Javier Segovia- Aguas, and Anders Jonsson. A review of generalized planning. KER, 34:1-28, 2019.","title":"A review of generalized planning","authors":"Jiménez","year":"2019","venue":"KER","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Korf et al., 2005] Richard E Korf, Weixiong Zhang, Ignacio Thayer, and Heath Hohwald. Frontier search. Journal of the ACM, 52(5):715-748, 2005.","title":"Frontier search","authors":"Weixiong Richard E Korf, Ignacio Zhang, Heath Thayer, Hohwald","year":"2005","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lipovetzky and Geffner, 2017] Nir Lipovetzky and Hector Geffner. Best-first width search: Exploration and exploita- tion in classical planning. In AAAI, volume 31, 2017.","title":"Best-first width search: Exploration and exploitation in classical planning","authors":"Geffner Lipovetzky, Nir Lipovetzky, Hector Geffner","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lotinac et al., 2016] Damir Lotinac, Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Automatic genera- tion of high-level state features for generalized planning. In IJCAI, pages 3199-3205, 2016.","title":"Automatic generation of high-level state features for generalized planning","authors":"Damir Lotinac, Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/453"},{"position":19,"raw":"[Martín and Geffner, 2004] Mario Martín and Hector Geffner. Learning generalized policies from planning examples using concept languages. Applied Intelligence, 20:9-19, 2004.","title":"Learning generalized policies from planning examples using concept languages","authors":"Geffner Martín, Mario Martín, Hector Geffner","year":"2004","venue":"Applied Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nau et al., 2003] Dana S Nau, Tsz-Chiu Au, Okhtay Il- ghami, Ugur Kuter, J William Murdock, Dan Wu, and Fusun Yaman. Shop2: An htn planning system. JAIR, 20:379-404, 2003.","title":"Shop2: An htn planning system","authors":"Tsz-Chiu Dana S Nau, Okhtay Au, Ugur Ilghami, William Kuter, Dan Murdock, Fusun Wu, Yaman","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Segovia-Aguas et al., 2016] Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Generalized planning with procedural domain control knowledge. In ICAPS, 2016.","title":"Generalized planning with procedural domain control knowledge","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2016","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Segovia-Aguas et al., 2017] Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Generating context-free grammars using classical planning. In IJCAI, 2017.","title":"Generating context-free grammars using classical planning","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/613"},{"position":23,"raw":"[Segovia-Aguas et al., 2019] Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Computing programs for generalized planning using a classical planner. Artificial Intelligence, 272:52-85, 2019.","title":"Computing programs for generalized planning using a classical planner","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2019","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Segovia-Aguas et al., 2020] Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Generalized planning with positive and negative examples. In AAAI, volume 34, pages 9949-9956, 2020.","title":"Generalized planning with positive and negative examples","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Segovia-Aguas et al., 2021] Javier Segovia-Aguas, Sergio Jiménez, and Anders Jonsson. Generalized planning as heuristic search. In ICAPS, volume 31, pages 569-577, 2021.","title":"Generalized planning as heuristic search","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson","year":"2021","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Segovia-Aguas et al., 2022] Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson, and Laura Sebastiá. Scaling-up generalized planning as heuristic search with landmarks. arXiv preprint arXiv:2205.04850, 2022.","title":"Scaling-up generalized planning as heuristic search with landmarks","authors":"Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson, Laura Sebastiá","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Siddharth et al., 2011] Srivastava Siddharth, Immerman Neil, Zilberstein Shlomo, and Zhang Tianjiao. Directed search for generalized plans using classical planners. In ICAPS, volume 21, 2011.","title":"Directed search for generalized plans using classical planners","authors":"Immerman Srivastava Siddharth, Zilberstein Neil, Zhang Shlomo, Tianjiao","year":"2011","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Skiena, 1998] Steven S Skiena. The algorithm design man- ual: Text, volume 1. Springer Science & Business Media, 1998.","title":"The algorithm design manual: Text","authors":"S Steven, Skiena","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Winner and Veloso, 2003] Elly Winner and Manuela Veloso. Distill: Learning domain-specific planners by example. In ICML, pages 800-807, 2003.","title":"Distill: Learning domain-specific planners by example","authors":"Veloso Winner, Elly Winner, Manuela Veloso","year":"2003","venue":"ICML","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}