Beyond Plan Length: heuristic search planning for maximum reward problems
Farquhar, Jason and Harris, Chris (2001) Beyond Plan Length: heuristic search planning for maximum reward problems. UNSPECIFIED
Download
Full text not available from this repository.
Description/Abstract
Recently automatic extraction of heuristic estimates has been shown to be extremely fruitful when applied to classical planning domains. We present a simple extension to the heuristic extraction process from the well-known HSP system that allows us to apply it to reward maximisation problems. This extension involves computing an estimate of the maximal reward obtainable from a given state by ignoring delete lists. We also describe how to improve the accuracy of this estimate using any available mutual exclusion information. In this way we seek to apply recent advances in classical planning to a broader range of problems, ultimately to include both both probabilistic and decision theoretic problems.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Additional Information: | Submitted to: European Conference on Planning 2001 (ECP-01) May 20001. |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control |
| Item ID: | 255889 |
| Date Deposited: | 18 May 2001 |
| Last Modified: | 01 Mar 2012 10:44 |
| Contributors: | Farquhar, Jason (Author) Harris, Chris (Author) |
| Date: | May 2001 |
| Additional Information: | Submitted to: European Conference on Planning 2001 (ECP-01) May 20001. |
| Status: | Published |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/255889 |
Actions (login required)
 |
View Item |
