Formalizing planning knowledge for hierarchical planning
- 1 February 1990
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 6 (1) , 12-24
- https://doi.org/10.1111/j.1467-8640.1990.tb00126.x
Abstract
A hierarchical planning system achieves efficiency by planning with the most important conditions first, and considering details later in the planning process. Few attempts have been made to formalize the structure of the planning knowledge for hierarchical planning. For a given domain, there is usually more than one way to define its planning knowledge. Some of the definitions can lead to efficient planning, while others may not. In this paper, we provide a set of restrictions which defines the relationships between a non‐primitive action and its set of subactions. When satisfied, these restrictions guarantee improved efficiency for hierarchical planning. One important feature of these restrictions is that they are syntactic and therefore do not depend on the particular structure of any plan. Along with these restrictions, we also provide algorithms for preprocessing the planning knowledge of a hierarchical planner. When used during planning, the preprocessed operator hierarchies can enable a planner to significantly reduce its search space.Keywords
This publication has 4 references indexed in Scilit:
- Planning for conjunctive goalsArtificial Intelligence, 1987
- Domain-independent planning Representation and plan generationArtificial Intelligence, 1984
- Planning in a hierarchy of abstraction spacesArtificial Intelligence, 1974
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971