Monte-Carlo Planning in Large POMDPs
暂无分享,去创建一个
[1] Gerald Tesauro,et al. On-line Policy Improvement using Monte-Carlo Search , 1996, NIPS.
[2] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[3] D.A. Castanon,et al. Rollout Algorithms for Stochastic Scheduling Problems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).
[4] Yishay Mansour,et al. Approximate Planning in Large POMDPs via Reusable Trajectories , 1999, NIPS.
[5] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[6] Reid G. Simmons,et al. Heuristic Search Value Iteration for POMDPs , 2004, UAI.
[7] Joelle Pineau,et al. Anytime Point-Based Approximations for Large POMDPs , 2006, J. Artif. Intell. Res..
[8] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.
[9] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.
[10] David Silver,et al. Combining online and offline knowledge in UCT , 2007, ICML '07.
[11] David Silver,et al. Combining Online and Offline Learning in UCT , 2007 .
[12] Joelle Pineau,et al. Online Planning Algorithms for POMDPs , 2008, J. Artif. Intell. Res..
[13] David Hsu,et al. SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2008, Robotics: Science and Systems.
[14] Yngvi Björnsson,et al. Simulation-Based Approach to General Game Playing , 2008, AAAI.
[15] Richard J. Lorentz. Amazons Discover Monte-Carlo , 2008, Computers and Games.
[16] David Hsu,et al. POMDPs for robotic tasks with mixed observability , 2009, Robotics: Science and Systems.
[17] Oliver Brock,et al. SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces , 2009 .