On the Verification of Totally-Ordered HTN Plans

Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans and the only technique supporting state constraints. In th...

Full description

Saved in:
Bibliographic Details
Main Authors: Bartak, Roman, Ondrckova, Simona, Behnke, Gregor, Bercher, Pascal
Format: Conference Proceeding
Language:English
Subjects:
Artificial intelligence
Conferences
hierarchical planning
HTN
parsing
Runtime
total-order
verification
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Verifying HTN plans is an intractable problem with two existing approaches to solve the problem. One technique is based on compilation to SAT. Another method is using parsing, and it is currently the fastest technique for verifying HTN plans and the only technique supporting state constraints. In this paper, we propose an extension of the parsing-based approach to verify totally-ordered HTN plans more efficiently. This problem is known to be tractable if no state constraints are included, and we show theoretically and empirically that the modified parsing approach achieves better performance than the currently fastest HTN plan verifier when applied to totally-ordered HTN plans.
ISSN:2375-0197
DOI:10.1109/ICTAI52525.2021.00043