Approximate Planning for Factored POMDPs using Belief State Simplification.
David A. McAllesterSatinder P. SinghPublished in: UAI (1999)
Keyphrases
- belief state
- point based value iteration
- state space
- belief space
- partially observable markov decision processes
- partial observability
- dynamic bayesian networks
- partially observable
- heuristic search
- belief revision
- planning problems
- stochastic domains
- partial knowledge
- markov decision processes
- reactive planning
- approximation methods
- partially observable markov decision process
- dynamic programming
- markov chain
- dynamical systems
- initial state
- reinforcement learning
- planning under uncertainty
- classical planning
- image sequences
- video sequences
- optimal policy
- exact solution
- bayesian networks