Abstract

This paper presents Greedy Regression Tables (GRT), a new domain independent heuristic for STRIPS worlds. The heuristic can be used to guide the search process of any state-space planner, estimating the distance between each intermediate state and the goals. At the beginning of the problem solving process a table is created, the records of which contain the ground facts of the domain, among with estimates for their distances from the goals. Additionally, the records contain information about interactions that occur while trying to achieve different ground facts simultaneously. During the search process, the heuristic, using this table, extracts quite accurate estimates for the distances between intermediate states and the goals. A simple best-first search planner that uses this heuristic has been implemented in C++ and has been tested on several "classical" problem instances taken from the bibliography and on some new taken from the AIPS-98 planning competition. Our planner has proved to be faster in all of the cases, finding also in most (but not all) of the cases shorter solutions.

Citations