A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes

2002/11/01 by Michael Kearns, Yishay Mansour, Andrew Y. Ng · 2 citations
Computer Science · Mathematics · #AI-based Problem Solving and Planning #Algorithm #Artificial intelligence #Bellman equation #Computer science #Exponential function #Fraction (chemistry) #Machine Learning and Algorithms #Machine learning #Markov chain #Markov decision process #Markov process #Mathematical optimization #Mathematics #Reinforcement Learning in Robotics #Reinforcement learning #State (computer science) #State space #Time horizon #Tree (set theory)

paper · pdf · doi:10.1023/a:1017932429737

crossref issued 2002/11/01 · crossref published 2002/11/01 · crossref published-print 2002/11/01 · openalex publication_date 2002/11/01 · crossref created 2002/12/30 · openalex created_date 2016/06/24 · crossref deposited 2025/07/10 · crossref indexed 2026/03/31 · openalex updated_date 2026/07/23

Citations

• Approximate Planning for Factored POMDPs using Belief State Simplification
• Tractable Inference for Complex Stochastic Processes
• Learning to act using real-time dynamic programming
• Real-time heuristic search
• Artificial intelligence: a modern approach
• 10. Reinforcement learning
• Personal Communication

Cited by

• Improved Quantum Algorithms for Reinforcement Learning Under a Generative Model
• Markov decision process [wikipedia]