state space planning
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 2)

H-INDEX

2
(FIVE YEARS 0)

Author(s):  
Francesco Percassi ◽  
Alfonso E. Gerevini ◽  
Enrico Scala ◽  
Ivan Serina ◽  
Mauro Vallati

2004 ◽  
pp. 69-83 ◽  
Author(s):  
Malik Ghallab ◽  
Dana Nau ◽  
Paolo Traverso

2003 ◽  
Vol 145 (1-2) ◽  
pp. 1-32 ◽  
Author(s):  
Ioannis Refanidis ◽  
Ioannis Vlahavas

2001 ◽  
Vol 15 ◽  
pp. 115-161 ◽  
Author(s):  
I. Refanidis ◽  
I. Vlahavas

This paper presents GRT, a domain-independent heuristic planning system for STRIPS worlds. GRT solves problems in two phases. In the pre-processing phase, it estimates the distance between each fact and the goals of the problem, in a backward direction. Then, in the search phase, these estimates are used in order to further estimate the distance between each intermediate state and the goals, guiding so the search process in a forward direction and on a best-first basis. The paper presents the benefits from the adoption of opposite directions between the preprocessing and the search phases, discusses some difficulties that arise in the pre-processing phase and introduces techniques to cope with them. Moreover, it presents several methods of improving the efficiency of the heuristic, by enriching the representation and by reducing the size of the problem. Finally, a method of overcoming local optimal states, based on domain axioms, is proposed. According to it, difficult problems are decomposed into easier sub-problems that have to be solved sequentially. The performance results from various domains, including those of the recent planning competitions, show that GRT is among the fastest planners.


Sign in / Sign up

Export Citation Format

Share Document