A Novel Parsing-based Approach for Verification of Hierarchical Plans

Roman Bartak, Simona Ondrckova, Adrien Maillard, Gregor Behnke, Pascal Bercher

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Citations (Scopus)

    Abstract

    Hierarchical Task Networks were proposed as a method to describe plans by decomposition of tasks to subtasks until primitive tasks, actions, are obtained. Valid plans-sequences of actions-must adhere both to causal dependencies between the actions and to the structure given by the decomposition of the goal task. Plan verification aims at finding if a given plan is valid, that is, if it is causally consistent and it can be obtained by decomposition of some task. The paper describes a novel parsing-based approach for hierarchical plan verification that is orders of magnitude faster than existing methods.

    Original languageEnglish
    Title of host publicationProceedings - IEEE 32nd International Conference on Tools with Artificial Intelligence, ICTAI 2020
    EditorsMiltos Alamaniotis, Shimei Pan
    PublisherIEEE Computer Society
    Pages118-125
    Number of pages8
    ISBN (Electronic)9781728192284
    DOIs
    Publication statusPublished - Nov 2020
    Event32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020 - Virtual, Baltimore, United States
    Duration: 9 Nov 202011 Nov 2020

    Publication series

    NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
    Volume2020-November
    ISSN (Print)1082-3409

    Conference

    Conference32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020
    Country/TerritoryUnited States
    CityVirtual, Baltimore
    Period9/11/2011/11/20

    Fingerprint

    Dive into the research topics of 'A Novel Parsing-based Approach for Verification of Hierarchical Plans'. Together they form a unique fingerprint.

    Cite this