Now showing items 1-6 of 6
On the Nature of Modal Truth in Plans
Chapman's paper, "Planning for Conjunctive Goals", has been widely acknowledged as a major step towards understanding the nature of nonlinear planning, and it has been one of the bases of later work by others -- but it is ...
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. ...
Toward an Analysis of Forward Pruning
Several early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree's minimax value), but this technique did not seem to ...
State-Space Search, Problem Reduction, and Iterative Deepening: A Comparative Analysis
In previous work, Korf showed that by introducing one problem- reduction step into a state- space search, one could reduce the number of node generations from 0 ((2b)2d ) to 0 (bd ), where b and d are the branching factor ...
Recognition of Volumetric Features from CAD Models: Problem Formalization and Algorithms
Automated recognition of features from CAD models has been attempted for a wide range of application domains in mechanical engineering. However, the absence of a clear mathematical formalism for the problem has made it ...