The automatic inference of state invariants in TIM

被引:90
作者
Fox, M [1 ]
Long, D [1 ]
机构
[1] Univ Durham, Dept Comp Sci, Durham DH1 3HP, England
关键词
D O I
10.1613/jair.544
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As planning is applied to larger and richer domains the effort involved in constructing domain descriptions increases and becomes a significant burden on the human application designer. If general planners are to be applied successfully to large and complex domains it is necessary to provide the domain designer with some assistance in building correctly encoded domains. One way of doing this is to provide domain-independent techniques for extracting, from a domain description, knowledge that is implicit in that description and that can assist domain designers in debugging domain descriptions. This knowledge can also be exploited to improve the performance of planners: several researchers have explored the potential of state invariants in speeding up the performance of domain-independent planners. In this paper we describe a process by which state invariants can be extracted from the automatically inferred type structure of a domain. These techniques are being developed for exploitation by STAN, a Graphplan based planner that employs state analysis techniques to enhance its performance.
引用
收藏
页码:367 / 421
页数:55
相关论文
共 14 条
[1]  
[Anonymous], ARTIFICIAL INTELLIGE
[2]  
Blum A., 1995, IJCAI
[3]  
FIKES R, 1971, ARTIFICIAL INTELLIGE, V2
[4]   Accelerating partial-order planners: Some techniques for effective search control and pruning [J].
Gerevini, A ;
Schubert, L .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1996, 5 :95-137
[5]  
GEREVINI A, 1998, AAAI
[6]  
GEREVINI A, 1996, AIPS 96
[7]  
GRANT TJ, 1996, THESIS RIJKSUNIVERSI
[8]  
KAUTZ H, 1998, 4 INT C ART INT PLAN
[9]  
KELLEHER G, 1992, P ECAI92
[10]  
KOEHLER J, 1997, P 4 EUR C PLANN