On the Complexity of Solving Markov Decision Problems.
Michael L. LittmanThomas L. DeanLeslie Pack KaelblingPublished in: UAI (1995)
Keyphrases
- markov decision problems
- linear programming
- state space
- optimal policy
- decision theoretic
- partially observable
- reinforcement learning
- markov decision processes
- utility function
- decision problems
- computational complexity
- stochastic shortest path
- infinite horizon
- expected utility
- queueing networks
- decision processes
- transition probabilities
- random walk
- supervised learning
- machine learning
- search space
- average cost
- objective function