DMCA
Beyond Plan Length: Heuristic Search Planning for Maximum Reward Problems.
BibTeX
@MISC{Farquhar_beyondplan,
author = {Jason Farquhar and Chris Harris},
title = {Beyond Plan Length: Heuristic Search Planning for Maximum Reward Problems.},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Automatic extraction of heuristic estimates has been extremely fruitful in classical planning domains. We present a simple extension to the heuristic extraction process from the well-known HSP and FF systems which allow us to apply them to reward maximisation problems. These extensions involve computing an estimate of the maximal reward obtainable from a given state when ignoring delete lists, which are then used to guide the backward search in the FF system. The heuristics are evaluated in a simple robotic delivery task and shown to be effective in reducing the number of nodes evaluated. In this way we seek to apply recent advances in classical planning to a broader range of problems.
Keyphrases
beyond plan length maximum reward problem heuristic search planning ff system classical planning well-known hsp heuristic extraction process maximal reward obtainable backward search simple extension maximisation problem recent advance heuristic estimate delete list classical planning domain automatic extraction simple robotic delivery task
