Landmark-enhanced abstraction heuristics

被引:10
作者
Domshlak, Carmel [1 ]
Katz, Michael [1 ]
Lefler, Sagi [1 ]
机构
[1] Technion Israel Inst Technol, Haifa, Israel
关键词
Classical planning; Heuristic search; Admissible heuristics; Abstractions; Landmarks; Reformulation;
D O I
10.1016/j.artint.2012.05.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Abstractions and landmarks are two of the key mechanisms for devising admissible heuristics for domain-independent planning. Here we aim at combining them by integrating landmark information into abstractions. We propose a concrete scheme for compiling landmarks into the problem specification. This scheme, which preserves all reachable properties of the original problem, is especially suited to implicit abstraction heuristics. Our formal and empirical analysis shows that landmark information can substantially improve the quality of heuristic estimates. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:48 / 68
页数:21
相关论文
共 35 条
[1]  
[Anonymous], ICAPS
[2]  
[Anonymous], 2007, AAAI
[3]  
[Anonymous], 2008, P 18 INT C AUT PLANN
[4]  
[Anonymous], 2001, P 6 EUR C PLANN ECP
[5]  
[Anonymous], 2008, AAAI
[6]   COMPLEXITY RESULTS FOR SAS(+) PLANNING [J].
BACKSTROM, C ;
NEBEL, B .
COMPUTATIONAL INTELLIGENCE, 1995, 11 (04) :625-655
[7]  
Bonet B., 2011, P 21 INT C AUT PLANN
[8]   Strengthening Landmark Heuristics via Hitting Sets [J].
Bonet, Blai ;
Helmert, Malte .
ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 :329-334
[9]  
Coles Andrew, 2008, P 18 INT C AUT PLANN, P44
[10]   Pattern databases [J].
Culberson, JC ;
Schaeffer, J .
COMPUTATIONAL INTELLIGENCE, 1998, 14 (03) :318-334