Now showing items 1-2 of 2
Complexity Results for HTN Planning
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network decomposition, but until now, there has been very little analytical work on the properties of HTN planners. ...
Complexity, Decidability and Undecidability Results for Domain- Independent Planning
In this paper, we examine how the complexity of domain- independent planning with STRIPS-like operators depends on the nature of the planning operators.<P>We show conditions under which planning is decidable and undecidable. ...