Jason Farquhar

Learn More
Introduction In an on-line planning problem an agent must select and execute a sequence of actions to maximise some objective criterion, where the time and resources used in action selection count in assessing overall solution quality. Such problems are representative of a broad class of bounded rational (Russell & Wefald 1989) real world planning problems,(More)
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(More)
  • 1