Symbolic Heuristic Search for Factored Markov Decision ProcessesWe describe a planning algorithm that integrates two approaches to solving Markov decision processes with large state spaces. State abstraction is used to avoid evaluating states individually. Forward search from a start state, guided by an admissible heuristic, is used to avoid evaluating all states. We combine these two approaches in a novel way that exploits symbolic model-checking techniques and demonstrates their usefulness for decision-theoretic planning.
Document ID
20030034769
Acquisition Source
Headquarters
Document Type
Other
Authors
Morris, Robert (NASA Ames Research Center Moffett Field, CA, United States)
Feng, Zheng-Zhu (Massachusetts Univ. Amherst, MA, United States)
Hansen, Eric A. (Mississippi State Univ. Mississippi State, MS, United States)