Sapa: A multi-objective metric temporal planner

被引:75
作者
Do, MB [1 ]
Kambhampati, S [1 ]
机构
[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85287 USA
关键词
D O I
10.1613/jair.1156
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning-graph based methods for deriving heuristics that are sensitive to both cost and makespan (ii) techniques for adjusting the heuristic estimates to take action interactions and metric resource limitations into account and (iii) a linear time greedy post-processing technique to improve execution flexibility of the solution plans. An implementation of Sapa using many of the techniques presented in this paper was one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition, held at AIPS-02. We describe the technical details of extracting the heuristics and present an empirical evaluation of the current implementation of Sapa.
引用
收藏
页码:155 / 194
页数:40
相关论文
共 30 条
[1]  
BACCHUS F, 2001, P IJCAI 01
[2]  
BONET B, 1997, P AAAI 97
[3]  
CHAJEWSKA U, 1998, P UAI 98
[4]  
CHIEN S, 2000, P SPAC 2000
[5]  
DASGUPTA P, 2001, MULTIOBJECTIVE HEURI
[6]  
DO M, 2002, P AIPS 02
[7]  
DO MB, 2001, P ECP 01
[8]  
DO MB, 2003, P ICAPS 03
[9]  
EDELKAMP S, 2001, PLANSIG WORKSH
[10]  
FOX M, 2002, 3 INT PLANNING COMPE