Abstract
This paper presents recent extensions to the GRT planner, a domain-independent heuristic state-space planner for STRIPS worlds. The planner computes off-line, in a pre-processing phase, estimates for the distances between each problem’s fact and the goals. These estimates are utilized during a forward search phase, in order to obtain values for the distances between the intermediate states and the goals.
The paper focuses on several problems that arise from the backward heuristic computation and presents ways to cope with them. Moreover, two methods, which concern automatic domain enrichment and automatic irrelevant objects elimination, are presented. Finally, the planner has been equipped with a hill-climbing strategy and a closed list of visited states for pruning purposes. Performance results show that GRT exhibits significant improvement over its AIPS-00 competition version.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Blum and M. Furst, Fast Planning Through Planning Graph Analysis, Artificial Intelligence 90 (1997) 281–300.
B. Bonet and H. Geffner, Heuristic Planning: New Results, in: Proceedings 5th European Conference on Planning, Durham, UK, LNAI 1809, Springer (1999), pp. 360–372.
B. Bonet and H. Geffner, HSP: Heuristic Search Planner, entry at the AIPS-98 Planning competition, Pittsburgh, 1998.
B. Bonet, G. Loerincs and H. Geffner, A robust and fast action selection mechanism for planning, 14th Intl. Conf. of the AAAI, Providence, AAAI Press, 1997, pp. 714–719.
R.E. Fikes and N.J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189–208.
A. Gerevini and L. Schubert, Inferring State Constraints for Domain-Independent Planning, 15th International Conference of the AAAI, Wisconsin: AAAI Press, 1998, pp. 905–912.
D. McDermott, Using regression-match graphs to control search in planning, Artificial Intelligence 109(1-2) (1999) pp. 111–159.
J. Hoffmann, A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm, Technical Report No. 133, Institut für Informatik, Freiburg, January 2000.
J. Koehler, and J. Hoffmann, On Reasonable and Forced Goals Orderings and their Use in an Agenda-Driven Planning Algorithm, Journal of Artificial Intelligence Research, 12(2000) pp. 339–386.
B. Nebel, Y, Dimopoulos and J. Koehler, Ignoring Irrelevant Facts and Operators in Plan Generation, 4th European Conference on Planning, 1997.
I. Refanidis and I. Vlahavas, GRT: A Domain Independent Heuristic for STRIPS Worlds based on Greedy Regression Tables, 5th European Conference on Planning, Durham, UK, LNAI 1809, Springer (1999), pp. 347–359.
I. Refanidis and I. Vlahavas, On Determining and Completing Incomplete States in STRIPS Domains, IEEE International Conference on Information, Intelligence and Systems, Washington, US, 1999, pp. 289–296.
M. Veloso, Learning by Analogical Reasoning in General Problem Solving, Ph.D. diss. Computer Science Dept., Carnegie Mellon Univ. (also available as techincal report: CMU-CS-92-174), 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Refanidis, I., Vlahavas, I. (2001). The GRT Planner: New Results. In: Nareyek, A. (eds) Local Search for Planning and Scheduling. LSPS 2000. Lecture Notes in Computer Science(), vol 2148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45612-0_8
Download citation
DOI: https://doi.org/10.1007/3-540-45612-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42898-5
Online ISBN: 978-3-540-45612-4
eBook Packages: Springer Book Archive