Tight Bounds for HTN Planning

Abstract

Although HTN planning is in general undecidable, there are many syntactically identifiable sub-classes of HTN problems that can be decided. For these sub-classes, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize a propositional HTN formalization to one that is based upon… (More)

Topics

1 Figure or Table

Slides referencing similar topics