Integrating sample-based planning and model-based reinforcement learning

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 612-617

  Walsh, Thomas J ^a   Goschin, Sergiu ^a   Littman, Michael L ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; PLANNING; REINFORCEMENT LEARNING;

COMPUTATION TIME; MODEL-BASED REINFORCEMENT LEARNING; NEAR-OPTIMAL POLICIES; NUMBER OF STATE; SAMPLE COMPLEXITY;

LEARNING ALGORITHMS;

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

References (17)

1. Balla, R.-K., and Fern, A. 2009. UCT for tactical assault planning in real-time strategy games. In IJCAI.
2. Boutilier, C; Dearden, R.; and Goldszmidt, M. 2000. Stochastic dynamic programming with factored representations. Artificial Intelligence 121(1):49-107.
3. Coquelin, P.-A., and Munos, R. 2007. Bandit algorithms for tree search. In UAI.
4. Croonenborghs, T.; Ramon, J.; Blocked, H.; and Bruynooghe, M. 2007. Online learning and exploiting relational models in reinforcement learning. In IJCAI.
5. Degris, T; Sigaud, O.; and Wuillemin, P.-H. 2006. Learning the structure of factored Markov decision processes in reinforcement learning problems. In ICML.
6. Gelly, S., and Silver, D. 2007. Combining online and offline knowledge in UCT. In ICML.
7. Kearns, M.; Mansour, Y.; and Ng, A. Y. 2002. A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning 49:193-208.
8. Kocsis, L., and Szepesvari, C. 2006. Bandit based Monte-Carlo planning. In ECML.
9. Lang, T, and Toussaint, M. 2009. Approximate inference for planning in stochastic relational worlds. In ICML.
10. Li, L.; Littman, M. L.; and Walsh, T. J. 2008. Knows what it knows: A framework for self-aware learning. In ICML.
11. Li, L. 2009. A Unifying Framework for Computational Reinforcement Learning Theory. Ph.D. Dissertation, Rutgers University, NJ, USA.
12. Pasula, H. M.; Zettlemoyer, L. S.; and Kaelbling, L. P. 2007. Learning symbolic models of stochastic domains. Journal of Artificial Intelligence Research 29:309-352.
13. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley.
14. Silver, D.; Sutton, R. S.; and Müller, M. 2008. Sample-based learning and search with permanent and transient memories. In ICML.
15. Strehl, A. L.; Li, L.; and Littman, M. L. 2009. Reinforcement learning in finite MDPs: PAC analysis. Journal of Machine Learning Research 10(2) :413-444.
16. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press.
17. Walsh, T. J.; Szita, I.; Diuk, C; and Littman, M. L. 2009. Exploring compact reinforcement-learning representations with linear regression. In UAI.