Complete, consistent goal sets: controlling the search within non-linear plan generation

Shows that a combination of search control techniques is required to solve a block stacking problem. This combination comprises goal completion, together with temporal coherence, typed preconditions and some other heuristics. It also describes the benefits and limitations of these techniques, focussing, in particular, on the use of domain knowledge to determine the completeness and consistency of the goal sets that describe the planning task