Parsing-based Approaches for Verification and Recognition of Hierarchical Plans. Barták, R., Adrien Maillard, undefined, & Cardoso, R. C. In Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019), pages 49–56, 2019. A follow-up paper was later accepted at ICTAI 2020.![Parsing-based Approaches for Verification and Recognition of Hierarchical Plans [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex 1 download Hierarchical planning, in particular, Hierarchical Task Networks, was proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Plan verification assumes a complete plan as input, and the objective is finding a task that decomposes to this plan. In plan recognition, a prefix of the plan is given and the objective is finding a task that decomposes to the (shortest) plan with the given prefix. This paper describes how to verify and recognize plans using a common method known from formal grammars, by parsing.
@InProceedings{HPlan2019paper7,
author = {Roman Bart{\'a}k and Adrien Maillard, and Rafael C. Cardoso},
title = {Parsing-based Approaches for Verification and Recognition of Hierarchical Plans},
booktitle = {Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)},
year = {2019},
pages = {49--56},
abstract = {Hierarchical planning, in particular, Hierarchical Task Networks, was proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Plan verification assumes a complete plan as input, and the objective is finding a task that decomposes to this plan. In plan recognition, a prefix of the plan is given and the objective is finding a task that decomposes to the (shortest) plan with the given prefix. This paper describes how to verify and recognize plans using a common method known from formal grammars, by parsing.},
url_paper = {https://openreview.net/pdf?id=HJgRIrHWt4},
note = {A follow-up paper was later accepted at ICTAI 2020.}
}
Downloads: 1
{"_id":"ayJJYPj4estb6zJDo","bibbaseid":"bartk-adrienmaillard-cardoso-parsingbasedapproachesforverificationandrecognitionofhierarchicalplans-2019","author_short":["Barták, R.","Adrien Maillard, undefined","Cardoso, R. C."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Roman"],"propositions":[],"lastnames":["Barták"],"suffixes":[]},{"propositions":[],"lastnames":["Adrien","Maillard"],"firstnames":[""],"suffixes":[]},{"firstnames":["Rafael","C."],"propositions":[],"lastnames":["Cardoso"],"suffixes":[]}],"title":"Parsing-based Approaches for Verification and Recognition of Hierarchical Plans","booktitle":"Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)","year":"2019","pages":"49–56","abstract":"Hierarchical planning, in particular, Hierarchical Task Networks, was proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Plan verification assumes a complete plan as input, and the objective is finding a task that decomposes to this plan. In plan recognition, a prefix of the plan is given and the objective is finding a task that decomposes to the (shortest) plan with the given prefix. This paper describes how to verify and recognize plans using a common method known from formal grammars, by parsing.","url_paper":"https://openreview.net/pdf?id=HJgRIrHWt4","note":"A follow-up paper was later accepted at ICTAI 2020.","bibtex":"@InProceedings{HPlan2019paper7,\n author = {Roman Bart{\\'a}k and Adrien Maillard, and Rafael C. Cardoso},\n title = {Parsing-based Approaches for Verification and Recognition of Hierarchical Plans},\n booktitle = {Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)},\n year = {2019},\n pages = {49--56},\n abstract = {Hierarchical planning, in particular, Hierarchical Task Networks, was proposed as a method to describe plans by decomposition of tasks to sub-tasks until primitive tasks, actions, are obtained. Plan verification assumes a complete plan as input, and the objective is finding a task that decomposes to this plan. In plan recognition, a prefix of the plan is given and the objective is finding a task that decomposes to the (shortest) plan with the given prefix. This paper describes how to verify and recognize plans using a common method known from formal grammars, by parsing.},\n url_paper = {https://openreview.net/pdf?id=HJgRIrHWt4},\n note = {A follow-up paper was later accepted at ICTAI 2020.}\n}\n\n\n\n\n\n\n\n","author_short":["Barták, R.","Adrien Maillard, undefined","Cardoso, R. C."],"key":"HPlan2019paper7","id":"HPlan2019paper7","bibbaseid":"bartk-adrienmaillard-cardoso-parsingbasedapproachesforverificationandrecognitionofhierarchicalplans-2019","role":"author","urls":{" paper":"https://openreview.net/pdf?id=HJgRIrHWt4"},"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"hierarchical-task.net/bibtex/hplan-publications.bib","dataSources":["T9LQLt3D2MDhrCfjh"],"keywords":[],"search_terms":["parsing","based","approaches","verification","recognition","hierarchical","plans","barták","adrien maillard","cardoso"],"title":"Parsing-based Approaches for Verification and Recognition of Hierarchical Plans","year":2019,"downloads":1}