More Succinct Grounding of HTN Planning Problems

More Succinct Grounding of HTN Planning Problems – Preliminary Results. Behnke, G., Höller, D., Pascal Bercher, undefined, & Biundo, S. In Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019), pages 40–48, 2019. A follow-up paper was later accepted at AAAI 2020.

Paper abstract bibtex

Planning systems usually operate on grounded representations of the planning problems during search. Further, planners that use translations into other combinatorial problems also often perform their translations based on a grounded model. Planning models, however, are commonly defined in a lifted formalism. As such, one of the first preprocessing steps a planner performs is to generate a grounded representation. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings than the previously published method. We expect this decrease in size to lead to more efficient planners.

@InProceedings{HPlan2019paper6,
  author    = {Gregor Behnke and Daniel H\"{o}ller and Pascal Bercher, and Susanne Biundo},
  title     = {More Succinct Grounding of HTN Planning Problems -- Preliminary Results},
  booktitle = {Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)},
  year      = {2019},
  pages     = {40--48},
  abstract  = {Planning systems usually operate on grounded representations of the planning problems during search. Further, planners that use translations into other combinatorial problems also often perform their translations based on a grounded model. Planning models, however, are commonly defined in a lifted formalism. As such, one of the first preprocessing steps a planner performs is to generate a grounded representation. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings than the previously published method. We expect this decrease in size to lead to more efficient planners.},
  url_paper = {https://openreview.net/pdf?id=H1lgDHr-FE},
  note      = {A follow-up paper was later accepted at AAAI 2020.}
}

Downloads: 0

{"_id":"DSCquwLKQqKZxT7FR","bibbaseid":"behnke-hller-pascalbercher-biundo-moresuccinctgroundingofhtnplanningproblemspreliminaryresults-2019","author_short":["Behnke, G.","Höller, D.","Pascal Bercher, undefined","Biundo, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Gregor"],"propositions":[],"lastnames":["Behnke"],"suffixes":[]},{"firstnames":["Daniel"],"propositions":[],"lastnames":["Höller"],"suffixes":[]},{"propositions":[],"lastnames":["Pascal","Bercher"],"firstnames":[""],"suffixes":[]},{"firstnames":["Susanne"],"propositions":[],"lastnames":["Biundo"],"suffixes":[]}],"title":"More Succinct Grounding of HTN Planning Problems – Preliminary Results","booktitle":"Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)","year":"2019","pages":"40–48","abstract":"Planning systems usually operate on grounded representations of the planning problems during search. Further, planners that use translations into other combinatorial problems also often perform their translations based on a grounded model. Planning models, however, are commonly defined in a lifted formalism. As such, one of the first preprocessing steps a planner performs is to generate a grounded representation. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings than the previously published method. We expect this decrease in size to lead to more efficient planners.","url_paper":"https://openreview.net/pdf?id=H1lgDHr-FE","note":"A follow-up paper was later accepted at AAAI 2020.","bibtex":"@InProceedings{HPlan2019paper6,\n author = {Gregor Behnke and Daniel H\\\"{o}ller and Pascal Bercher, and Susanne Biundo},\n title = {More Succinct Grounding of HTN Planning Problems -- Preliminary Results},\n booktitle = {Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)},\n year = {2019},\n pages = {40--48},\n abstract = {Planning systems usually operate on grounded representations of the planning problems during search. Further, planners that use translations into other combinatorial problems also often perform their translations based on a grounded model. Planning models, however, are commonly defined in a lifted formalism. As such, one of the first preprocessing steps a planner performs is to generate a grounded representation. In this paper we present a new approach for grounding HTN planning problems that produces smaller groundings than the previously published method. We expect this decrease in size to lead to more efficient planners.},\n url_paper = {https://openreview.net/pdf?id=H1lgDHr-FE},\n note = {A follow-up paper was later accepted at AAAI 2020.}\n}\n\n","author_short":["Behnke, G.","Höller, D.","Pascal Bercher, undefined","Biundo, S."],"key":"HPlan2019paper6","id":"HPlan2019paper6","bibbaseid":"behnke-hller-pascalbercher-biundo-moresuccinctgroundingofhtnplanningproblemspreliminaryresults-2019","role":"author","urls":{" paper":"https://openreview.net/pdf?id=H1lgDHr-FE"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"hierarchical-task.net/bibtex/hplan-publications.bib","dataSources":["T9LQLt3D2MDhrCfjh"],"keywords":[],"search_terms":["more","succinct","grounding","htn","planning","problems","preliminary","results","behnke","höller","pascal bercher","biundo"],"title":"More Succinct Grounding of HTN Planning Problems – Preliminary Results","year":2019}