Monte-Carlo planning in large POMDPs

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Silver, David ^a   Veness, Joel ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN KNOWLEDGE; MONTE CARLO METHODS; TREES (MATHEMATICS);

'CURRENT; AGENT BELIEFS; BLACK-BOX SIMULATORS; CURSE OF DIMENSIONALITY; MONTE CARLO ALGORITHMS; MONTE CARLO SAMPLING; ON-LINE PLANNING; PERFORMANCE; PROPERTY; TREE-SEARCH;

PROBABILITY DISTRIBUTIONS;

EID: 85161963598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multi-armed bandit problem. Machine Learning, 47(2-3):235{256, 2002.
2. D. Bertsekas and D. Castañon. Rollout algorithms for stochastic scheduling problems. Journal of Heuristics, 5(1):89{108, 1999.
3. R. Coulom. Efficient selectivity and backup operators in Monte-Carlo tree search. In 5th International Conference on Computer and Games, 2006-05-29, pages 72-83, 2006.
4. H. Finnsson and Y. Björnsson. Simulation-based approach to general game playing. In 23rd Conference on Artificial Intelligence, pages 259-264, 2008.
5. S. Gelly and D. Silver. Combining online and offline learning in UCT. In 17th International Conference on Machine Learning, pages 273-280, 2007.
6. L. Kaelbling, M. Littman, and A. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1995.
7. M. Kearns, Y. Mansour, and A. Ng. Approximate planning in large POMDPs via reusable trajectories. In Advances in Neural Information Processing Systems 12. MIT Press, 2000.
8. L. Kocsis and C. Szepesvari. Bandit based Monte-Carlo planning. In 15th European Conference on Machine Learning, pages 282-293, 2006.
9. H. Kurniawati, D. Hsu, and W. Lee. SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. In Robotics: Science and Systems, 2008.
10. R. Lorentz. Amazons discover Monte-Carlo. In Computers and Games, pages 13-24, 2008.
11. S. Ong, S. Png, D. Hsu, and W. Lee. POMDPs for robotic tasks with mixed observability. In Robotics: Science and Systems, 2009.
12. J. Pineau, G. Gordon, and S. Thrun. Anytime point-based approximations for large POMDPs. Journal of Artificial Intelligence Research, 27:335-380, 2006.
13. S. Ross, J. Pineau, S. Paquet, and B. Chaib-draa. Online planning algorithms for pomdps. Journal of Artificial Intelligence Research, 32:663-704, 2008.
14. T. Smith and R. Simmons. Heuristic search value iteration for pomdps. In 20th conference on Uncertainty in Artificial Intelligence, 2004.
15. G. Tesauro and G. Galperin. Online policy improvement using Monte-Carlo search. In Advances in Neural Information Processing 9, pages 1068-1074, 1996.