Formalizing planning knowledge for hierarchical planning
作者:
Qiang Yang,
期刊:
Computational Intelligence
(WILEY Available online 1990)
卷期:
Volume 6,
issue 1
页码: 12-24
ISSN:0824-7935
年代: 1990
DOI:10.1111/j.1467-8640.1990.tb00126.x
出版商: Blackwell Publishing Ltd
关键词: automated reasoning;problem solving;hierarchical planning;search control;knowledge representation;raisonnement automatisé résolution de problèmes;planification hiérarchique;contrǒle de recherche;représentation des connaissances
数据来源: WILEY
摘要:
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 spac
点击下载:
PDF
(1276KB)
返 回