Complexity results for HTN planning

被引：123

作者：

Erol, K ^{[1
]}

Hendler, J ^{[1
]}

Nau, DS ^{[1
]}

机构：

[1] UNIV MARYLAND,INST ADV COMP STUDIES,COLLEGE PK,MD 20742

来源：

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 1996年 / 18卷 / 01期

关键词：

D O I：

10.1007/BF02136175

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Most practical work on AI planning systems during the last fifteen years has been based on Hierarchical Task Network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks, and how it compares to STRIPS-style planning.

引用

页码：69 / 93

页数：25

共 15 条

[1]

[Anonymous], P 9 EUR C ART INT

[2]

BYLNDER T, 1991, IJCI 91

[3] PLANNING FOR CONJUNCTIVE GOALS [J].

CHAPMAN, D .

ARTIFICIAL INTELLIGENCE, 1987, 32 (03) :333-377

[4]

DRUMMOND M, 1985, P IJCAI 85

[5]

EROL K, 1994, CSTR3239 U MR COMP S

[6]

EROL K, IN PRESS ARTIFICIAL

[7]

FIKES R, 1971, ARTIFICIAL INTELLIGE, V2

[8]

Hopcroft J. E., 2007, Introduction to Automata Theory, Languages and Computation

[9]

KAMBHAMPATI S, 1992, ARTIFICIAL INTEL MAY

[10]

LANSKY AL, 1988, COMPUTTIONAL INTELLI

← 1 2 →