\n \n \n
\n
\n\n \n \n \n \n \n \n Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020).\n \n \n \n \n\n\n \n Gregor Behnke; Daniel Höller; and Pascal Bercher.,\n editors.\n \n\n\n \n\n\n\n 2021.\n
\n\n
\n\n
\n\n
\n\n \n \n ![\"Proceedings](\"//bibbase.org/img/filetypes/pdf.svg\"\n\t "\\"")
booklet\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 46 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@proceedings{IPC2020Booklet,\n title = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n editor = {Gregor Behnke and Daniel H{\\"o}ller and Pascal Bercher},\n url_booklet = {https://ipc2020.hierarchical-task.net/publications/IPC2020Booklet.pdf},\n abstract = {<p>Since its first edition in 1998, the International Planning Competition (IPC) has been an integral event of the planning community. For more than 20 years, it established unified input languages for planners, enabled an objective comparison between them based on an accessible benchmark set. The IPC drove the development of planners and fostered research. Thus, the IPC enabled planning researchers to compare their own work against the work of others -- not only within the competition, but also outside of it. Due to the IPC almost all contemporary planners understand (some form of) PDDL, which allows for using IPC benchmarks across a multitude of planners.</p>\n\n<p>The first two IPCs had -- in addition to the regular track -- a track on hand-tailored planners in which the planners could be provided with additional information or select their algorithms based on the input domain. Among these planners, some used Hierarchical Planning -- most notably SHOP. Following the second IPC in 2000 the hand-tailored track was discontinued. Hierarchical planning was thereafter not part of the IPC any more. Research in the field however continued.</p>\n\n<p>The International Planning Competition 2020 features for the first time a track dedicated to hierarchical planning. In contrast to the previous track on hand-tailored planners we don't want to evaluate how good planners can become given any possible additional knowledge, but ask how well planners can exploit a given hierarchical refinement structure. We therefore faced several unique challenges. We had to establish a common input language for all planners such that all of them operate on the very same model. We also had to specify a plan-output format and provide a verifier, since we had to ensure that the found plans satisfy the decompositional structure of the given task hierarchy. Further, we had to gather a comprehensive set of benchmark domains, since no such set existed before. We hope that this first competition for Hierarchical Task Network planners will foster future research into hierarchical planning and provide a common basis for many researchers -- by establishing a unified input language, a common benchmark set, and an evaluation of the state of the art in HTN planning. We hope that many future editions of this competition will follow.</p>\n\nGregor, Daniel, and Pascal<br/>\nOrganizers of the IPC 2020,<br/>\nMay 2021}\n}\n\n\n
\n\n\n
\n
Since its first edition in 1998, the International Planning Competition (IPC) has been an integral event of the planning community. For more than 20 years, it established unified input languages for planners, enabled an objective comparison between them based on an accessible benchmark set. The IPC drove the development of planners and fostered research. Thus, the IPC enabled planning researchers to compare their own work against the work of others – not only within the competition, but also outside of it. Due to the IPC almost all contemporary planners understand (some form of) PDDL, which allows for using IPC benchmarks across a multitude of planners.
The first two IPCs had – in addition to the regular track – a track on hand-tailored planners in which the planners could be provided with additional information or select their algorithms based on the input domain. Among these planners, some used Hierarchical Planning – most notably SHOP. Following the second IPC in 2000 the hand-tailored track was discontinued. Hierarchical planning was thereafter not part of the IPC any more. Research in the field however continued.
The International Planning Competition 2020 features for the first time a track dedicated to hierarchical planning. In contrast to the previous track on hand-tailored planners we don't want to evaluate how good planners can become given any possible additional knowledge, but ask how well planners can exploit a given hierarchical refinement structure. We therefore faced several unique challenges. We had to establish a common input language for all planners such that all of them operate on the very same model. We also had to specify a plan-output format and provide a verifier, since we had to ensure that the found plans satisfy the decompositional structure of the given task hierarchy. Further, we had to gather a comprehensive set of benchmark domains, since no such set existed before. We hope that this first competition for Hierarchical Task Network planners will foster future research into hierarchical planning and provide a common basis for many researchers – by establishing a unified input language, a common benchmark set, and an evaluation of the state of the art in HTN planning. We hope that many future editions of this competition will follow.
Gregor, Daniel, and Pascal
Organizers of the IPC 2020,
May 2021\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Addressing HTN Planning with Blind Depth First Search.\n \n \n \n \n\n\n \n Juan Fernandez-Olivares; Ignacio Vellido; and Luis Castillo.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 1–4, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Olivares2021SIADEX,\n title = {Addressing {HTN} Planning with Blind Depth First Search},\n author = {Fernandez-Olivares, Juan and Vellido, Ignacio and Castillo, Luis},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {1--4},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p10-p13.pdf},\n abstract = {This paper briefly describes SIADEX, the HTN planner winner of the Partial Order track in the 2020 International Planning Competition. We also show a discussion of the results regarding run time and memory usage for the different problems configured in the competition}\n}\n\n\n
\n\n\n
\n This paper briefly describes SIADEX, the HTN planner winner of the Partial Order track in the 2020 International Planning Competition. We also show a discussion of the results regarding run time and memory usage for the different problems configured in the competition\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HyperTensioN: A three-stage compiler for planning.\n \n \n \n \n\n\n \n Maurício Cecílio Magnaguagno; Felipe Meneguzzi; and Lavindra Silva.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 5–8, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Magnaguagno2021HyperTensioN,\n title = {{HyperTensioN}: {A} three-stage compiler for planning},\n author = {Maur\\'{i}cio Cec\\'{i}lio Magnaguagno and Felipe Meneguzzi and Lavindra {de} Silva},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {5--8},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p14-p17.pdf},\n abstract = {Hierarchical Task Networks (HTN) planners generate plans using a decomposition process with extra domain knowledge to guide search towards a planning task. While many HTN domain descriptions are made by experts, they may repeatedly describe the same preconditions, or methods that are rarely used or possible to be decomposed. By leveraging a three-stage compiler design we can easily support more language descriptions and preprocessing optimizations that when chained can greatly improve runtime efficiency in such domains. In this paper we present the HyperTensioN HTN planner, as it was submitted to the HTN IPC 2020.}\n}\n\n\n
\n\n\n
\n Hierarchical Task Networks (HTN) planners generate plans using a decomposition process with extra domain knowledge to guide search towards a planning task. While many HTN domain descriptions are made by experts, they may repeatedly describe the same preconditions, or methods that are rarely used or possible to be decomposed. By leveraging a three-stage compiler design we can easily support more language descriptions and preprocessing optimizations that when chained can greatly improve runtime efficiency in such domains. In this paper we present the HyperTensioN HTN planner, as it was submitted to the HTN IPC 2020.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Lifted Logic for Task Networks: TOHTN Planner Lilotane in the IPC 2020.\n \n \n \n \n\n\n \n Dominik Schreiber.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 9–12, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 20 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Schreiber2020LiloTane,\n title = {Lifted Logic for Task Networks: {TOHTN} Planner Lilotane in the {IPC} 2020},\n author = {Schreiber, Dominik},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {9--12},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p18-p21.pdf},\n abstract = {We present our contribution to the International Planning Competition (IPC) 2020. Our planner Lilotane builds upon ideas established by Tree-REX and encodes a Totally Ordered Hierarchical Task Network (TOHTN) planning problem into incremental formulae of propositional logic (SAT). Lilotane, however, instantiates reductions and actions lazily and minimalistically without the need for full grounding, hence accelerating the planning process significantly. We discuss the results of the IPC and conclude that Lilotane, scoring second in the Total Order track, is an overall competitive system, what demonstrates the viability of our approach and its significance for future research.}\n}\n\n\n
\n\n\n
\n We present our contribution to the International Planning Competition (IPC) 2020. Our planner Lilotane builds upon ideas established by Tree-REX and encodes a Totally Ordered Hierarchical Task Network (TOHTN) planning problem into incremental formulae of propositional logic (SAT). Lilotane, however, instantiates reductions and actions lazily and minimalistically without the need for full grounding, hence accelerating the planning process significantly. We discuss the results of the IPC and conclude that Lilotane, scoring second in the Total Order track, is an overall competitive system, what demonstrates the viability of our approach and its significance for future research.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n pyHiPOP – Hierarchical Partial-Order Planner.\n \n \n \n \n\n\n \n Charles Lesire; and Alexandre Albore.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 13–16, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Lesire2021pyHiPOP,\n title = {{pyHiPOP} -- {H}ierarchical Partial-Order Planner},\n author = {Lesire, Charles and Albore, Alexandre},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {13--16},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p22-p25.pdf},\n abstract = {PYHIPOP is a hierarchical partial-order planner, aimed at solving Hierarchical Task Network (HTN) planning problems. The current planner version is a re-coding of a version originally developed by Patrick Bechon (Bechon et al. 2014). In Bechon’s original work, HIPOP solved HTN problems with Task Insertion (TI-HTN), meaning that inserting new tasks in addition to the pure HTN decomposition was allowed during the search. Bechon proposed some heuristics for solving such problems using a hybrid algorithm: a POP (Partial Order Planning) algorithm with hierarchical task decomposition. HIPOP has also been extended to manage plan repair (Bechon et al. 2015), and multi-robot mission planning repair with communications losses (Bechon, Lesire, and Barbier 2020). PYHIPOP differs from the original HIPOP in:<br/>\n• PYHIPOP is coded in pure Python3; this choice has been made to ease the integration with other tools for plan repair or interactive planning;<br/>\n• PYHIPOP currently manages HTN problems only – no Task Insertion is allowed;<br/>\n• PYHIPOP’s preprocessing and grounding steps have been improved to use recent works from the state of the art;<br/>\n• PYHIPOP’s heuristics have been adapted, as its original heuristics worked well for TI-HTN, but not so well for pure HTN problems.}\n}\n\n\n
\n\n\n
\n PYHIPOP is a hierarchical partial-order planner, aimed at solving Hierarchical Task Network (HTN) planning problems. The current planner version is a re-coding of a version originally developed by Patrick Bechon (Bechon et al. 2014). In Bechon’s original work, HIPOP solved HTN problems with Task Insertion (TI-HTN), meaning that inserting new tasks in addition to the pure HTN decomposition was allowed during the search. Bechon proposed some heuristics for solving such problems using a hybrid algorithm: a POP (Partial Order Planning) algorithm with hierarchical task decomposition. HIPOP has also been extended to manage plan repair (Bechon et al. 2015), and multi-robot mission planning repair with communications losses (Bechon, Lesire, and Barbier 2020). PYHIPOP differs from the original HIPOP in:
• PYHIPOP is coded in pure Python3; this choice has been made to ease the integration with other tools for plan repair or interactive planning;
• PYHIPOP currently manages HTN problems only – no Task Insertion is allowed;
• PYHIPOP’s preprocessing and grounding steps have been improved to use recent works from the state of the art;
• PYHIPOP’s heuristics have been adapted, as its original heuristics worked well for TI-HTN, but not so well for pure HTN problems.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Totally and Partially Ordered Hierarchical Planners in PDDL4J Library.\n \n \n \n \n\n\n \n Damien Pellier; and Humbert Fiorino.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 17–18, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Pellier2021PDDL4J,\n title = {Totally and Partially Ordered Hierarchical Planners in {PDDL4J} Library},\n author = {Pellier, Damien and Fiorino, Humbert},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {17--18},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p26-p27.pdf},\n abstract = {In this paper, we outline the implementation of the TFD (Totally Ordered Fast Downward) and the PFD (Partially ordered Fast Downward) hierarchical planners that participated in the first HTN IPC competition in 2020. These two planners are based on forward-chaining task decomposition coupled with a compact grounding of actions, methods, tasks and HTN problems.}\n}\n\n\n
\n\n\n
\n In this paper, we outline the implementation of the TFD (Totally Ordered Fast Downward) and the PFD (Partially ordered Fast Downward) hierarchical planners that participated in the first HTN IPC competition in 2020. These two planners are based on forward-chaining task decomposition coupled with a compact grounding of actions, methods, tasks and HTN problems.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n AssemblyHierarchical – Connecting Devices through Cables.\n \n \n \n \n\n\n \n Gregor Behnke.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 19–20, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Behnke2021Assembly,\n title = {Assembly{H}ierarchical -- {C}onnecting Devices through Cables},\n author = {Behnke, Gregor},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {19--20},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p28-p29.pdf},\n abstract = {We report on the AssemblyHierarchical domain, which encodes the task of connecting devices through a set of availables cables.}\n}\n\n\n
\n\n\n
\n We report on the AssemblyHierarchical domain, which encodes the task of connecting devices through a set of availables cables.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n From Classical to Hierarchical: Benchmarks for the HTN Track of the International Planning Competition.\n \n \n \n \n\n\n \n Damien Pellier; and Humbert Fiorino.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 21–23, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Pellier2021Domains,\n title = {From Classical to Hierarchical: {B}enchmarks for the {HTN} Track of the International Planning Competition},\n author = {Pellier, Damien and Fiorino, Humbert},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {21--23},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p30-p32.pdf},\n abstract = {In this short paper, we outline nine classical benchmarks submitted to the first hierarchical planning track of the International Planning competition in 2020. All of these benchmarks are based on the HDDL language (H\\"oller et al. 2020). The choice of the benchmarks was based on a questionnaire sent to the HTN community (Behnke et al. 2019). They are the following: Barman, Childsnack, Rover, Satellite, Blocksworld, Depots, Gripper, and Hiking. In the rest of the paper we give a short description of these benchmarks. All are totally ordered. A first hierarchical version of the domains Barman, Childsnack, Rover, Satellite, Blocksworld were proposed by (Ramoul et al. 2017; Schreiber et al. 2019). All the domains presented here are available online as part of the PDDL4J library (Pellier and Fiorino 2018). The writing of the domains has been a collective work. We would like to thank all the other contributors, D. Ramoul, D. Schreiber and A. Lequen.}\n}\n\n\n
\n\n\n
\n In this short paper, we outline nine classical benchmarks submitted to the first hierarchical planning track of the International Planning competition in 2020. All of these benchmarks are based on the HDDL language (Höller et al. 2020). The choice of the benchmarks was based on a questionnaire sent to the HTN community (Behnke et al. 2019). They are the following: Barman, Childsnack, Rover, Satellite, Blocksworld, Depots, Gripper, and Hiking. In the rest of the paper we give a short description of these benchmarks. All are totally ordered. A first hierarchical version of the domains Barman, Childsnack, Rover, Satellite, Blocksworld were proposed by (Ramoul et al. 2017; Schreiber et al. 2019). All the domains presented here are available online as part of the PDDL4J library (Pellier and Fiorino 2018). The writing of the domains has been a collective work. We would like to thank all the other contributors, D. Ramoul, D. Schreiber and A. Lequen.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n From PCP to HTN Planning Through CFGs.\n \n \n \n \n\n\n \n Daniel Höller; Songtuan Lin; Kutluhan Erol; and Pascal Bercher.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 24–25, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Hoeller2021PCP,\n title = {From {PCP} to {HTN} Planning Through {CFG}s},\n author = {H\\"oller, Daniel and Lin, Songtuan and Erol, Kutluhan and Bercher, Pascal},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {24--25},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p33-p34.pdf},\n abstract = {The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.}\n}\n\n\n
\n\n\n
\n The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Hierarchical Task Networks Generated Using Invariant Graphs for IPC2020.\n \n \n \n \n\n\n \n Damir Lotinac; Filippos Kominis; and Anders Jonsson.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 26–30, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Lotinac2021Learned,\n title = {Hierarchical Task Networks Generated Using Invariant Graphs for {IPC}2020},\n author = {Lotinac, Damir and Kominis, Filippos and Jonsson, Anders},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {26--30},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p35-p39.pdf},\n abstract = {The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.}\n}\n\n\n
\n\n\n
\n The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HTN IPC-2020 Domains: Blocksworld-HPDDL and Multiarm-Blocksworld.\n \n \n \n \n\n\n \n Ron Alford.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 31–31, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Alford2021Blocksworld,\n title = {{HTN} {IPC}-2020 Domains: {B}locksworld-{HPDDL} and Multiarm-Blocksworld},\n author = {Alford, Ron},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {31--31},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p40-p40.pdf},\n abstract = {The Blocksworld-HDDL problems from the 2020 HTN International Planning Competition were adapted from the HTN translation papers by Alford et al.. The domain enforces a strategy of only picking up blocks to move, and placing them either in their final location or on the table. The Multiarm-Blocksworld domain extends the domain by allowing for multiple independent arms.}\n}\n\n\n
\n\n\n
\n The Blocksworld-HDDL problems from the 2020 HTN International Planning Competition were adapted from the HTN translation papers by Alford et al.. The domain enforces a strategy of only picking up blocks to move, and placing them either in their final location or on the table. The Multiarm-Blocksworld domain extends the domain by allowing for multiple independent arms.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HTN IPC-2020 Domain: Robot.\n \n \n \n \n\n\n \n Ron Alford.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 32–32, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Alford2021Robot,\n title = {{HTN} {IPC}-2020 Domain: {R}obot},\n author = {Alford, Ron},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {32--32},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p41-p41.pdf},\n abstract = {The Robot problems from the 2020 HTN International Planning Competition were adapted from the HTN translation papers by Alford et al.. The domain encodes an office delivery problem, and enforces a strategy of only picking up packages that are not in their goal location, and only placing packages in their final location. Package order and navigation are left up to the choices of the planner.}\n}\n\n\n
\n\n\n
\n The Robot problems from the 2020 HTN International Planning Competition were adapted from the HTN translation papers by Alford et al.. The domain encodes an office delivery problem, and enforces a strategy of only picking up packages that are not in their goal location, and only placing packages in their final location. Package order and navigation are left up to the choices of the planner.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HTN IPC-2020 Domain: Towers.\n \n \n \n \n\n\n \n Ron Alford.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 33–33, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Alford2021Towers,\n title = {{HTN} {IPC}-2020 Domain: {T}owers},\n author = {Alford, Ron},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {33--33},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p42-p42.pdf},\n abstract = {The Towers domain from the 2020 HTN International Planning Competition was adapted from the HTN translation papers by Alford et al.. The domain encodes a solution to the Towers of Hanoi problem, admitting a unique, optimal solution and having no branches in the search space}\n}\n\n\n
\n\n\n
\n The Towers domain from the 2020 HTN International Planning Competition was adapted from the HTN translation papers by Alford et al.. The domain encodes a solution to the Towers of Hanoi problem, admitting a unique, optimal solution and having no branches in the search space\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n HTN Planning Domain for Deployment of Cloud Applications.\n \n \n \n \n\n\n \n Ilche Georgievski.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 34–36, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Georgievski2021Deployment,\n title = {HTN Planning Domain for Deployment of Cloud Applications},\n author = {Georgievski, Ilche},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {34--36},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p43-p45.pdf},\n abstract = {Cloud providers are facing a complex problem in configuring software applications ready for deployment on their infrastructures. Hierarchical Task Network (HTN) planning can provide effective means to solve such deployment problems. We present an HTN planning domain that models deployment problems as found in realistic Cloud environments.}\n}\n\n\n\n
\n\n\n
\n Cloud providers are facing a complex problem in configuring software applications ready for deployment on their infrastructures. Hierarchical Task Network (HTN) planning can provide effective means to solve such deployment problems. We present an HTN planning domain that models deployment problems as found in realistic Cloud environments.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Snake Domain for HTN IPC 2020.\n \n \n \n \n\n\n \n Maurício Cecílio Magnaguagno.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 37–38, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Magnaguagno2021Snake,\n title = {Snake Domain for {HTN} {IPC} 2020},\n author = {Magnaguagno, Maur\\'{i}cio Cec\\'{i}lio},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {37--38},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p46-p47.pdf},\n abstract = {This is a description of the Snake domain and problem generator submitted to the HTN IPC 2020 total order track. In the Snake domain the goal is to hunt mice spread over multiple locations, with one or more snakes that get longer as they strike each mouse}\n}\n\n\n
\n\n\n
\n This is a description of the Snake domain and problem generator submitted to the HTN IPC 2020 total order track. In the Snake domain the goal is to hunt mice spread over multiple locations, with one or more snakes that get longer as they strike each mouse\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The Barman-HTN Domain for IPC 2020.\n \n \n \n \n\n\n \n Max Waters; Lin Padgham; and Sebastian Sardina.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 39–39, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Waters2021Barman,\n title = {The Barman-{HTN} Domain for {IPC} 2020},\n author = {Waters, Max and Padgham, Lin and Sardina, Sebastian},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {39--39},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p48-p48.pdf},\n abstract = {The Barman-HTN domain is an HTN decomposition of the IPC Barman domain. It extends Barman with a task network that guides cocktail creation while retaining the primitive operators that made the original so challenging for the delete- relaxation heuristic.}\n}\n\n\n
\n\n\n
\n The Barman-HTN domain is an HTN decomposition of the IPC Barman domain. It extends Barman with a task network that guides cocktail creation while retaining the primitive operators that made the original so challenging for the delete- relaxation heuristic.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The Hierarchical Satellite Domain.\n \n \n \n \n\n\n \n Bernd Schattenberg.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 40–42, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Schattenberg2021Satellite,\n title = {The Hierarchical Satellite Domain},\n author = {Schattenberg, Bernd},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {40--42},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p49-p51.pdf},\n abstract = {The Satellite domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.}\n}\n\n\n
\n\n\n
\n The Satellite domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The Hierarchical Woodworking Domain.\n \n \n \n \n\n\n \n Bernd Schattenberg; and Pascal Bercher.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 43–44, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Schattenberg2021Woodworking,\n title = {The Hierarchical Woodworking Domain},\n author = {Schattenberg, Bernd and Bercher, Pascal},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {43--44},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p52-p53.pdf},\n abstract = {The Woodworking domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.}\n}\n\n\n
\n\n\n
\n The Woodworking domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The HTN Domain ``Factories''.\n \n \n \n \n\n\n \n Malte Sönnichsen; and Dominik Schreiber.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 45–46, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Soennichsen2021Factory,\n title = {The {HTN} Domain ``Factories''},\n author = {S\\"{o}nnichsen, Malte and Schreiber, Dominik},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {45--46},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p54-p55.pdf},\n abstract = {In this paper we present the benchmark domain “Factories” for Hierarchical Task Network (HTN) planning written in the HDDL format (H\\"oller et al. 2020). In this benchmark domain, the planning objective is to construct a factory by satisfying a dependency graph on certain resources while using trucks to deliver the needed resources from one place to another. As such, our domain is a crossover of traditional logistics and transport domains with a producer-consumer problem}\n}\n\n\n
\n\n\n
\n In this paper we present the benchmark domain “Factories” for Hierarchical Task Network (HTN) planning written in the HDDL format (Höller et al. 2020). In this benchmark domain, the planning objective is to construct a factory by satisfying a dependency graph on certain resources while using trucks to deliver the needed resources from one place to another. As such, our domain is a crossover of traditional logistics and transport domains with a producer-consumer problem\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n The Smartphone Domain.\n \n \n \n \n\n\n \n Pascal Bercher; Susanne Biundo; and Bernd Schattenberg.\n\n\n \n\n\n\n In
Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 47–47, 2021. \n
\n\n
\n\n
\n\n
\n\n \n \n paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@inproceedings{Bercher2021SmartPhone,\n title = {The Smartphone Domain},\n author = {Bercher, Pascal and Biundo, Susanne and Schattenberg, Bernd},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {47--47},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p56-p56.pdf},\n abstract = {This extended abstract is about the Smartphone domain, submitted as a benchmark domain to the IPC 2020.}\n}\n\n
\n\n\n
\n This extended abstract is about the Smartphone domain, submitted as a benchmark domain to the IPC 2020.\n
\n\n\n
\n\n\n\n\n\n
![\"Loading..\"](\"//bibbase.org/img/ajax-loader.gif\")
\n\n![\"bibbase.org\"\n](\"//bibbase.org/img/logo.svg\"\n "\\"BibBase")
\n \n