A sparse sampling algorithm for near-optimal planning in large Markov decision processes

Keyphrases

• Degree of Approximation 16%
• Discount Factor 16%
• Generative Models 16%
• Good Strategies 16%
• Infinite State Space 16%
• Markov Decision Process 100%
• Mentation 16%
• Near-optimal 100%
• Near-optimal Policy 16%
• Number of States 16%
• Optimal Actions 16%
• Optimal Planning 100%
• Optimal Policy 16%
• Partially Observable Markov Decision Process 16%
• Planning Scale 16%
• Real-world Problems 16%
• Reinforcement Learning Algorithm 16%
• Sampling Algorithm 100%
• Sparse Sampling 100%
• State Space Size 16%
• Stochastic Environment 16%
• Traditional Planning 16%

Computer Science

• Approximation (Algorithm) 14%
• Generative Model 14%
• Markov Decision Process 100%
• Optimal Action 14%
• Reinforcement Learning 14%
• Sampling Algorithm 100%
• State Space 28%
• Traditional Planning 14%

Mathematics

• Degree of Approximation 16%
• Discount Factor 16%
• Markov Decision Process 100%
• Optimal Policy 33%
• Partially Observable Markov Decision Process 16%
• Running Time 50%
• Stochastics 16%