A case-based approach to heuristic planning Articles uri icon

publication date

  • January 2013

start page

  • 184

end page

  • 201

issue

  • 1

volume

  • 39

international standard serial number (ISSN)

  • 0924-669X

electronic international standard serial number (EISSN)

  • 1573-7497

abstract

  • Most of the great success of heuristic search as an approach to AI Planning is due to the right design of domain-independent heuristics. Although many heuristic planners perform reasonably well, the computational cost of computing the heuristic function in every search node is very high, causing the planner to scale poorly when increasing the size of the planning tasks. For tackling this problem, planners can incorporate additional domain-dependent heuristics in order to improve their performance. Learning-based planners try to automatically acquire these domain-dependent heuristics using previous solved problems. In this work, we present a case-based reasoning approach that learns abstracted state transitions that serve as domain control knowledge for improving the planning process. The recommendations from the retrieved cases are used as guidance for pruning or ordering nodes in different heuristic search algorithms applied to planning tasks. We show that the CBR guidance is appropriate for a considerable number of planning benchmarks.

keywords

  • case-based reasoning; automated planning; search algorithms