A heuristic search approach to planning with continuous resources in stochastic domains

Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam

Research output: Contribution to journalArticlepeer-review

46 Scopus citations

Abstract

We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms. HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those parts of the state space that could be reached from the start state by following an optimal policy. We show that this approach is especially effective when resource constraints limit how much of the state space is reachable. Experimental results demonstrate its effectiveness in the domain that motivates our research: automated planning for planetary exploration rovers.

Original languageEnglish
Pages (from-to)27-59
Number of pages33
JournalJournal of Artificial Intelligence Research
Volume34
DOIs
StatePublished - 1 Jan 2009

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A heuristic search approach to planning with continuous resources in stochastic domains'. Together they form a unique fingerprint.

Cite this