SHOP2: An HTN planning system

被引：452

作者：

Nau, D ^{[1
]}

Au, TC

Ilghami, O

Kuter, U

Murdock, JW

Wu, D

Yaman, F

机构：

[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA

[2] Univ Maryland, Syst Res Inst, College Pk, MD 20742 USA

[3] IBM Corp, TJ Watson Res Ctr, Hawthorne, NY 10532 USA

来源：

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH | 2003年 / 20卷 / 20期

关键词：

D O I：

10.1613/jair.1141

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.

引用

页码：379 / 404

页数：26

共 27 条

[1] AARUP M, 1994, INTELLIGENT SCHEDULI, P451
[2] AGOSTA JM, 1995, P AAAI 95 SPRING S I, P1
[3] ANDREWS S, 1995, CSTR3487 U MAR DEP C
[4] BACCHUS F, 2000, ARTIFICIAL INTELLIGE, V116
[5] Biundo S, 2001, P EUR C PLANN P EUR C PLANN
[6] BODDY M, 1989, P 11 INT JOINT C ART, P979
[7] O-PLAN - THE OPEN PLANNING ARCHITECTURE
CURRIE, K
TATE, A
[J]. ARTIFICIAL INTELLIGENCE, 1991, 52 (01) : 49 - 86
[8] Doherty P, 2001, AI MAG, V22, P95
[9] Complexity results for HTN planning
Erol, K
Hendler, J
Nau, DS
[J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1996, 18 (01) : 69 - 93
[10] EROL K, 1994, AAAI 94

← 1 2 3 →