Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning. Staud, M. In Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021), pages 16–20, 2021. ![Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper ![Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning [link]](https://bibbase.org/img/filetypes/link.svg "link")
Presentation abstract bibtex We introduce a new method that can reduce the size of the search tree in hybrid planning. Hybrid planning fuses task insertion HTN planning with POCL planning. As planning is a computationally difficult problem, the size of the search tree can grow exponentially to the size of the problem.
We create so-called plan templates in a preprocessing step of the domain. They can be used to replace an abstract task in a partial plan. This task then no longer needs to be decomposed.
We provide empirical evidence in favor of this approach and show that the use of plan templates can drastically reduce the size of the search tree in hybrid planners. We use a PANDA-like planner as a testbed and publicly available planning domains to verify our claims.
@InProceedings{HPlan2021paper3,
author = {Michael Staud},
title = {Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning},
booktitle = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},
year = {2021},
pages = {16--20},
abstract = {We introduce a new method that can reduce the size of the search tree in hybrid planning. Hybrid planning fuses task insertion HTN planning with POCL planning. As planning is a computationally difficult problem, the size of the search tree can grow exponentially to the size of the problem.<br/>
We create so-called plan templates in a preprocessing step of the domain. They can be used to replace an abstract task in a partial plan. This task then no longer needs to be decomposed.<br/>
We provide empirical evidence in favor of this approach and show that the use of plan templates can drastically reduce the size of the search tree in hybrid planners. We use a PANDA-like planner as a testbed and publicly available planning domains to verify our claims.},
url_paper = {https://hierarchical-task.net/publications/hplan/2021/HPlan2021-paper3.pdf},
url_presentation = {https://www.youtube.com/watch?v=u3UE3-txp1o}
}
Downloads: 0
{"_id":"2PBfdxjrHk3h7yfL4","bibbaseid":"staud-domainanalysisapreprocessingmethodthatreducesthesizeofthesearchtreeinhybridplanning-2021","author_short":["Staud, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michael"],"propositions":[],"lastnames":["Staud"],"suffixes":[]}],"title":"Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning","booktitle":"Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)","year":"2021","pages":"16–20","abstract":"We introduce a new method that can reduce the size of the search tree in hybrid planning. Hybrid planning fuses task insertion HTN planning with POCL planning. As planning is a computationally difficult problem, the size of the search tree can grow exponentially to the size of the problem.<br/> We create so-called plan templates in a preprocessing step of the domain. They can be used to replace an abstract task in a partial plan. This task then no longer needs to be decomposed.<br/> We provide empirical evidence in favor of this approach and show that the use of plan templates can drastically reduce the size of the search tree in hybrid planners. We use a PANDA-like planner as a testbed and publicly available planning domains to verify our claims.","url_paper":"https://hierarchical-task.net/publications/hplan/2021/HPlan2021-paper3.pdf","url_presentation":"https://www.youtube.com/watch?v=u3UE3-txp1o","bibtex":"@InProceedings{HPlan2021paper3,\n author = {Michael Staud},\n title = {Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning},\n booktitle = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},\n year = {2021},\n pages = {16--20},\n abstract = {We introduce a new method that can reduce the size of the search tree in hybrid planning. Hybrid planning fuses task insertion HTN planning with POCL planning. As planning is a computationally difficult problem, the size of the search tree can grow exponentially to the size of the problem.<br/>\n We create so-called plan templates in a preprocessing step of the domain. They can be used to replace an abstract task in a partial plan. This task then no longer needs to be decomposed.<br/>\n We provide empirical evidence in favor of this approach and show that the use of plan templates can drastically reduce the size of the search tree in hybrid planners. We use a PANDA-like planner as a testbed and publicly available planning domains to verify our claims.},\n url_paper = {https://hierarchical-task.net/publications/hplan/2021/HPlan2021-paper3.pdf},\n url_presentation = {https://www.youtube.com/watch?v=u3UE3-txp1o}\n}\n\n","author_short":["Staud, M."],"key":"HPlan2021paper3","id":"HPlan2021paper3","bibbaseid":"staud-domainanalysisapreprocessingmethodthatreducesthesizeofthesearchtreeinhybridplanning-2021","role":"author","urls":{" paper":"https://hierarchical-task.net/publications/hplan/2021/HPlan2021-paper3.pdf"," presentation":"https://www.youtube.com/watch?v=u3UE3-txp1o"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"hierarchical-task.net/bibtex/hplan-publications.bib","dataSources":["T9LQLt3D2MDhrCfjh"],"keywords":[],"search_terms":["domain","analysis","preprocessing","method","reduces","size","search","tree","hybrid","planning","staud"],"title":"Domain Analysis: A Preprocessing Method that Reduces the Size of the Search Tree in Hybrid Planning","year":2021}