{"type":"ScholarlyArticle","title":"Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)","authors":[{"name":"Mohammad Yousefi","slug":"mohammad-yousefi","given":"Mohammad","family":"Yousefi","affiliation":"School of Computing , The Australian National University"},{"name":"Pascal Bercher","slug":"pascal-bercher","given":"Pascal","family":"Bercher","affiliation":"School of Computing , The Australian National University"}],"abstract":"Building upon recent advancements in formalising Fully Observable Non-Deterministic (FOND) Hierarchical Task Network (HTN) planning, we present the first approach to find strong solutions for HTN problems with uncertainty in action outcomes. We present a search algorithm, along with a compilation that relaxes a FOND HTN problem to a deterministic one. This allows the utilisation of existing grounders and heuristics from the deterministic HTN planning literature.","doi":"10.24963/ijcai.2024/751","url":"https://ijcai.org/proceedings/2024/751","pdf":"https://ijcai.org/proceedings/2024/0751.pdf","markdown":"https://ijcai.org/proceedings/2024/751.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/751","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Planning and Scheduling","track":"Main Track","number":751,"pages":{"first":6796,"last":6804},"keywords":["Planning and Scheduling: PS: Planning under uncertainty","Planning and Scheduling: PS: Search in planning and scheduling","Planning and Scheduling: PS: Planning algorithms","Planning and Scheduling: PS: Hierarchical planning"],"videos":[],"references":[{"position":1,"raw":"[Alford et al., 2012] Ron Alford, Vikas Shivashankar, Ugur Kuter, and Dana S. Nau. HTN problem spaces: Structure, algorithms, termination. In Proc. of the 5th SoCS, pages 2-9. AAAI Press, 2012.","title":"HTN problem spaces: Structure, algorithms, termination","authors":"Ron Alford, Vikas Shivashankar, Ugur Kuter, Dana S Nau","year":"2012","venue":"Proc. of the 5th SoCS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alford et al., 2015] Ron Alford, Pascal Bercher, and David W. Aha. Tight bounds for HTN planning. In Proc. of the 25th ICAPS, pages 7-15. AAAI Press, 2015.","title":"Tight bounds for HTN planning","authors":"Ron Alford, Pascal Bercher, David W Aha","year":"2015","venue":"Proc. of the 25th ICAPS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Behnke et al., 2020] Gregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher, and Susanne Biundo. On succinct groundings of HTN planning problems. In Proc. of the 34th AAAI, pages 9775-9784. AAAI Press, 2020.","title":"On succinct groundings of HTN planning problems","authors":"Gregor Behnke, Daniel Höller, Alexander Schmid, Pascal Bercher, Susanne Biundo","year":"2020","venue":"Proc. of the 34th AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bercher et al., 2017] Pascal Bercher, Gregor Behnke, Daniel Höller, and Susanne Biundo. An admissible HTN planning heuristic. In Proc. of the 26th IJCAI, pages 480-488. IJCAI, 2017.","title":"An admissible HTN planning heuristic","authors":"Pascal Bercher, Gregor Behnke, Daniel Höller, Susanne Biundo","year":"2017","venue":"Proc. of the 26th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/68"},{"position":5,"raw":"[Bercher et al., 2019] Pascal Bercher, Ron Alford, and Daniel Höller. A survey on hierarchical planning -one abstract idea, many concrete realizations. In Proc. of the 28th IJCAI, pages 6267-6275. IJCAI, 2019.","title":"A survey on hierarchical planning -one abstract idea, many concrete realizations","authors":"Pascal Bercher, Ron Alford, Daniel Höller","year":"2019","venue":"Proc. of the 28th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/875"},{"position":6,"raw":"[Bertoli et al., 2003] Piergiorgio Bertoli, Alessandro Cimatti, Ugo Dal Lago, and Marco Pistore. Extending PDDL to nondeterminism, limited sensing and iterative conditional plans. In ICAPS workshop on PDDL, informal proceedings, pages 15-24, 2003.","title":"Extending PDDL to nondeterminism, limited sensing and iterative conditional plans","authors":"Piergiorgio Bertoli, Alessandro Cimatti, Ugo Dal Lago, Marco Pistore","year":"2003","venue":"ICAPS workshop on PDDL, informal proceedings","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bonet and Geffner, 1999] Blai Bonet and Hector Geffner. Planning as heuristic search: New results. In Proc. of the 5th ECP, pages 360-372. Springer, 1999.","title":"Planning as heuristic search: New results","authors":"Geffner Bonet, Blai Bonet, Hector Geffner","year":"1999","venue":"Proc. of the 5th ECP","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bonet and Geffner, 2000] Blai Bonet and Hector Geffner. Planning with incomplete information as heuristic search in belief space. In Proc. of the 5th AIPS, pages 52-61. AAAI Press, 2000.","title":"Planning with incomplete information as heuristic search in belief space","authors":"Geffner ; ] Blai Bonet, Hector Bonet, Geffner","year":"2000","venue":"Proc. of the 5th AIPS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bonet and Geffner, 2001] Blai Bonet and Héctor Geffner. Planning as heuristic search. AIJ, 129:5-33, 2001.","title":"Planning as heuristic search","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2001","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bonet and Geffner, 2005] Blai Bonet and Héctor Geffner. An algorithm better than AO*? In Proc. of the 20th AAAI, pages 1343-1347. AAAI Press, 2005.","title":"An algorithm better than AO*?","authors":"Geffner Bonet, Blai Bonet, Héctor Geffner","year":"2005","venue":"Proc. of the 20th AAAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chen and Bercher, 2021] Dillon Chen and Pascal Bercher. Fully observable nondeterministic HTN planning -for- malisation and complexity results. In Proc. of the 31st ICAPS, pages 74-84. AAAI Press, 2021.","title":"Fully observable nondeterministic HTN planning -formalisation and complexity results","authors":"Dillon Chen, Pascal Bercher","year":"2021","venue":"Proc. of the 31st ICAPS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Chen and Bercher, 2022] Dillon Z. Chen and Pascal Bercher. Flexible FOND HTN planning: A complexity analysis. In Proc. of the 32nd ICAPS, pages 26-34. AAAI Press, 2022.","title":"Flexible FOND HTN planning: A complexity analysis","authors":"Dillon Z Chen, Pascal Bercher","year":"2022","venue":"Proc. of the 32nd ICAPS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Cimatti et al., 2003] A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. AIJ, 147(1):35-84, 2003.","title":"Weak, strong, and strong cyclic planning via symbolic model checking","authors":"A Cimatti, M Pistore, M Roveri, P Traverso","year":"2003","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Edelkamp and Schrödl, 2012] Stefan Edelkamp and Stefan Schrödl. Heuristic Search: Theory and Applications. Mor- gan Kaufmann, 2012.","title":"Heuristic Search: Theory and Applications","authors":"Schrödl Edelkamp","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Erol et al., 1994] Kutluhan Erol, James A. Hendler, and Dana Nau. UMCP: A sound and complete procedure for hierarchical task-network planning. In Proc. of the 2nd AIPS, pages 249-254. AAAI Press, 1994.","title":"UMCP: A sound and complete procedure for hierarchical task-network planning","authors":"Erol","year":"1994","venue":"Proc. of the 2nd AIPS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Erol et al., 1996] Kutluhan Erol, James Hendler, and Dana Nau. Complexity results for HTN planning. AMAI, 18(1):69-93, 1996.","title":"Complexity results for HTN planning","authors":"Erol","year":"1996","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Fox and Long, 2003] Maria Fox and Derek Long. PDDL2.1: An extension to PDDL for expressing temporal planning domains. JAIR, 20:61-124, 2003.","title":"PDDL2.1: An extension to PDDL for expressing temporal planning domains","authors":"Maria Fox, Derek Long","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fu et al., 2011] Jicheng Fu, Vincent Ng, Farokh B. Bastani, and I-Ling Yen. Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In Proc. of the 22nd IJCAI, pages 1949-1954. AAAI Press, 2011.","title":"Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems","authors":"Jicheng Fu, Vincent Ng, Farokh B Bastani, I-Ling Yen","year":"2011","venue":"Proc. of the 22nd IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/326"},{"position":19,"raw":"[Geier and Bercher, 2011] Thomas Geier and Pascal Bercher. On the decidability of HTN planning with task insertion. In Proc. of the 22nd IJCAI, pages 1955-1961. AAAI Press, 2011.","title":"On the decidability of HTN planning with task insertion","authors":"Bercher Geier, Thomas Geier, Pascal Bercher","year":"2011","venue":"Proc. of the 22nd IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/327"},{"position":20,"raw":"[Ghallab et al., 2014] Malik Ghallab, Dana Nau, and Paolo Traverso. The actor's view of automated planning and act- ing: A position paper. AIJ, 208:1-17, 2014.","title":"The actor's view of automated planning and acting: A position paper","authors":"Malik Ghallab, Dana Nau, Paolo Traverso","year":"2014","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Ghallab et al., 2016] Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning and Acting. Cambridge University Press, 2016.","title":"Automated Planning and Acting","authors":"Malik Ghallab, Dana Nau, Paolo Traverso","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Goldman and Boddy, 1996] Robert P. Goldman and Mark S. Boddy. Expressive planning and explicit knowl- edge. In Proc. of the 3rd AIPS, pages 110-117. AAAI Press, 1996.","title":"Expressive planning and explicit knowledge","authors":"Robert P Goldman, Mark S Boddy","year":"1996","venue":"Proc. of the 3rd AIPS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Berhard Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:253-302, 2001.","title":"The FF planning system: Fast plan generation through heuristic search","authors":"Nebel Hoffmann, Jörg Hoffmann, Berhard Nebel","year":"2001","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Höller and Bercher, 2021] Daniel Höller and Pascal Bercher. Landmark generation in HTN planning. In Proc. of the 35th AAAI, pages 11826-11834. AAAI Press, 2021.","title":"Landmark generation in HTN planning","authors":"Bercher Höller, Daniel Höller, Pascal Bercher","year":"2021","venue":"Proc. of the 35th AAAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Höller et al., 2020] Daniel Höller, Pascal Bercher, and Gre- gor Behnke. Delete-and ordering-relaxation heuristics for HTN planning. In Proc. of the 29th IJCAI, pages 4076- 4083. IJCAI, 2020.","title":"Delete-and ordering-relaxation heuristics for HTN planning","authors":"Daniel Höller, Pascal Bercher, Gregor Behnke","year":"2020","venue":"Proc. of the 29th IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/564"},{"position":26,"raw":"[Höller et al., 2021] Daniel Höller, Gregor Behnke, Pascal Bercher, and Susanne Biundo. The PANDA framework for hierarchical planning. KI, 35:391-396, 2021.","title":"The PANDA framework for hierarchical planning","authors":"Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo","year":"2021","venue":"KI","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Höller and Behnke, 2021] Daniel Höller and Gregor Behnke. Loop detection in the PANDA planning system. In Proc. of the 31st ICAPS, pages 168-173. AAAI Press, 2021.","title":"Loop detection in the PANDA planning system","authors":"Behnke ; ] Daniel Höller, Gregor Höller, Behnke","year":"2021","venue":"Proc. of the 31st ICAPS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Höller et al., 2018] Daniel Höller, Pascal Bercher, Gregor Behnke, and Susanne Biundo. A generic method to guide HTN progression search with classical heuristics. In Proc. of the 28th ICAPS, pages 114-122. AAAI Press, 2018.","title":"A generic method to guide HTN progression search with classical heuristics","authors":"Daniel Höller, Pascal Bercher, Gregor Behnke, Susanne Biundo","year":"2018","venue":"Proc. of the 28th ICAPS","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Höller et al., 2020a] Daniel Höller, Gregor Behnke, Pascal Bercher, Susanne Biundo, Humbert Fiorino, Damien Pel- lier, and Ron Alford. HDDL: An extension to PDDL for expressing hierarchical planning problems. In Proc. of the 34th AAAI, pages 9883-9891. AAAI Press, 2020.","title":"HDDL: An extension to PDDL for expressing hierarchical planning problems","authors":"Höller","year":"2020","venue":"Proc. of the 34th AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Höller et al., 2020b] Daniel Höller, Pascal Bercher, Gregor Behnke, and Susanne Biundo. HTN planning as heuristic progression search. JAIR, 67:835-880, 2020.","title":"HTN planning as heuristic progression search","authors":"Höller","year":"2020","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Kissmann and Edelkamp, 2009] Peter Kissmann and Stefan Edelkamp. Solving fully-observable non-deterministic planning problems via translation into a general game. In Proc. of the 32nd KI, pages 1-8. Springer, 2009.","title":"Peter Kissmann and Stefan Edelkamp. Solving fully-observable non-deterministic planning problems via translation into a general game","authors":"Edelkamp Kissmann","year":"2009","venue":"Proc. of the 32nd KI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Kuter and Nau, 2004] Ugur Kuter and Dana Nau. Forward- chaining planning in nondeterministic domains. In Proc. of the 19th AAAI, pages 513-518. AAAI Press, 2004.","title":"Forwardchaining planning in nondeterministic domains","authors":"Nau ; ] Ugur Kuter, Dana Kuter, Nau","year":"2004","venue":"Proc. of the 19th AAAI","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Kuter et al., 2005] Ugur Kuter, Dana S. Nau, Marco Pistore, and Paolo Traverso. A hierarchical task-network planner based on symbolic model checking. In Proc. of the 15th ICAPS, pages 300-309. AAAI Press, 2005.","title":"A hierarchical task-network planner based on symbolic model checking","authors":"Ugur Kuter, Dana S Nau, Marco Pistore, Paolo Traverso","year":"2005","venue":"Proc. of the 15th ICAPS","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Kuter et al., 2009] Ugur Kuter, Dana Nau, Marco Pistore, and Paolo Traverso. Task decomposition on abstract states, for planning under nondeterminism. AIJ, 173(5):669-695, 2009.","title":"Task decomposition on abstract states, for planning under nondeterminism","authors":"Ugur Kuter, Dana Nau, Marco Pistore, Paolo Traverso","year":"2009","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Mattmüller et al., 2010] Robert Mattmüller, Manuela Or- tlieb, Malte Helmert, and Pascal Bercher. Pattern database heuristics for fully observable nondeterministic planning. In Proc. of the 20th ICAPS, pages 105-112. AAAI Press, 2010.","title":"Pattern database heuristics for fully observable nondeterministic planning","authors":"Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher","year":"2010","venue":"Proc. of the 20th ICAPS","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Nau et al., 2003] Dana Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dan Wu, and Fusun Ya- man. SHOP2: An HTN planning system. JAIR, 20:379- 404, 2003.","title":"SHOP2: An HTN planning system","authors":"Dana Nau, Tsz-Chiu Au, Okhtay Ilghami, Ugur Kuter, J William Murdock, Dan Wu, Fusun Yaman","year":"2003","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Nilsson, 1982] Nils J Nilsson. Principles of artificial intel- ligence. Springer Science & Business Media, 1982.","title":"Principles of artificial intelligence","authors":"Nils J Nilsson","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Patra et al., 2019] Sunandita Patra, Malik Ghallab, Dana Nau, and Paolo Traverso. Acting and planning using op- erational models. In Proc. of the 19th AAAI, pages 7691- 7698. AAAI Press, 2019.","title":"Acting and planning using operational models","authors":"Patra","year":"2019","venue":"Proc. of the 19th AAAI","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Patra et al., 2020] Sunandita Patra, James Mason, Amit Ku- mar, Malik Ghallab, Paolo Traverso, and Dana Nau. In- tegrating acting, planning, and learning in hierarchical op- erational models. In Proc. of the 30th ICAPS, pages 478- 487. AAAI Press, 2020.","title":"Integrating acting, planning, and learning in hierarchical operational models","authors":"Patra","year":"2020","venue":"Proc. of the 30th ICAPS","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Patra et al., 2021] Sunandita Patra, James Mason, Malik Ghallab, Dana Nau, and Paolo Traverso. Deliberative act- ing, planning and learning with hierarchical operational models. AIJ, 299:103523, 2021.","title":"Deliberative acting, planning and learning with hierarchical operational models","authors":"Patra","year":"2021","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Pereira et al., 2022] Ramon Pereira, André Pereira, Fred- erico Messa, and Giuseppe De Giacomo. Iterative depth- first search for FOND planning. In Proc. of the 32nd ICAPS, pages 90-99. AAAI Press, 2022.","title":"Iterative depthfirst search for FOND planning","authors":"Ramon Pereira, André Pereira, Frederico Messa, Giuseppe De, Giacomo","year":"2022","venue":"Proc. of the 32nd ICAPS","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Pryor and Collins, 1996] Louise Pryor and Gregg Collins. Planning for contingencies: A decision-based approach. JAIR, 4:287-339, 1996.","title":"Planning for contingencies: A decision-based approach","authors":"Louise Pryor, Gregg Collins","year":"1996","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Scala and Vallati, 2021] Enrico Scala and Mauro Vallati. Effective grounding for hybrid planning problems repre- sented in PDDL. The Knowledge Engineering Review, 36:e9, 2021.","title":"Effective grounding for hybrid planning problems represented in PDDL","authors":"Enrico Scala, Mauro Vallati","year":"2021","venue":"The Knowledge Engineering Review","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Yoon et al., 2007] Sungwook Yoon, Alan Fern, and Robert Givan. FF-Replan: A baseline for probabilistic planning. In Proc. of the 17th ICAPS, pages 352-359. AAAI Press, 2007.","title":"FF-Replan: A baseline for probabilistic planning","authors":"Yoon","year":"2007","venue":"Proc. of the 17th ICAPS","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Yousefi and Bercher, 2024] Mohammad Yousefi and Pascal Bercher. Experimental setup for the IJCAI 2024 paper: \"Laying the foundations for solving FOND HTN prob- lems: Grounding, search, heuristics (and benchmark prob- lems)\". doi: 10.5281/zenodo.11172885, 2024.","title":"Experimental setup for the IJCAI 2024 paper","authors":"Mohammad Yousefi, Pascal Bercher","year":"2024","venue":"Laying the foundations for solving FOND HTN problems: Grounding, search, heuristics (and benchmark problems)","doi":"10.5281/zenodo.11172885","url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}