JPL Technical Report Server

A Novel Parsing-based Approach for Verification of Hierarchical Plans

Show simple item record

dc.contributor.author Bartak, Roman
dc.contributor.author Ondrckova, Simona
dc.contributor.author Maillard, Adrien H
dc.contributor.author Behnke, Gregor
dc.contributor.author Bercher, Pascal
dc.date.accessioned 2022-01-10T19:47:23Z
dc.date.available 2022-01-10T19:47:23Z
dc.date.issued 2020-11-09
dc.identifier.citation 32th International Conference on Tools with Artificial Intelligence, Baltimore, Maryland, November 9-11, 2020
dc.identifier.clearanceno CL#20-4201
dc.identifier.uri http://hdl.handle.net/2014/53062
dc.description.abstract Hierarchical Task Networks were proposed as amethod to describe plans by decomposition of tasks to subtasksuntil primitive tasks, actions, are obtained. Valid plans –sequences of actions – must adhere both to causal dependenciesbetween the actions and to the structure given by the decompositionof the goal task. Plan verification aims at finding if a givenplan is valid, that is, if it is causally consistent and it can beobtained by decomposition of some task. The paper describes anovel parsing-based approach for hierarchical plan verificationthat is orders of magnitude faster than existing methods.
dc.description.sponsorship NASA/JPL en_US
dc.language.iso en_US
dc.publisher Pasadena, CA: Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2020
dc.title A Novel Parsing-based Approach for Verification of Hierarchical Plans
dc.type Preprint


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account