Tracking Branches in Trees - A Propositional Encoding for Solving Partially-Ordered HTN Planning Problems

Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention...

Full description

Saved in:
Bibliographic Details
Main Authors: Behnke, Gregor, Holler, Daniel, Biundo, Susanne
Format: Conference Proceeding
Language:English
Subjects:
Compounds
Conferences
Encoding
hierarchical planning
Planning
SAT
Task analysis
Vegetation
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Planning via SAT has proven to be an efficient and versatile planning technique. Its declarative nature allows for an easy integration of additional constraints and can harness the progress made in the SAT community without the need to adapt the planner. However, there has been only little attention to SAT planning for hierarchical domains. To ease encoding, existing approaches for HTN planning require additional assumptions, like non-recursiveness or totally-ordered methods. Both limit the expressiveness of HTN planning severely. We propose the first propositional encodings which are able to solve general, i.e., partially-ordered, HTN planning problems, based on a previous encoding for totally-ordered problems. The empirical evaluation of our encoding shows that it outperforms existing HTN planners significantly.
ISSN:2375-0197
DOI:10.1109/ICTAI.2018.00022