Efficient reinforcement learning with relocatable action models

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 572-577

  Leffler, Bethany R ^a   Littman, Michael L ^a   Edmunds, Timothy ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; ROBOTICS;

ENVIRONMENT MODELING FRAMEWORKS; RELOCATABLE ACTION MODELS;

LEARNING ALGORITHMS;

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

References (15)

1. Brafman, R. I., and Tennenholtz, M. 2002. R-MAX-a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213-231.
2. Fiechter, C.-N. 1994. Efficient reinforcement learning. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 88-97. Association of Computing Machinery.
3. Guestrin, C.; Patrascu, R.; and Schuurmans, D. 2002. Algorithm-directed exploration for model-based reinforcement learning in factored MDPs. In Proceedings of the International Conference on Machine Learning, 235-242.
4. Kakade, S.; Kearns, M.; and Langford, J. 2003. Exploration in metric state spaces. In Proceedings of the 20th International Conference on Machine Learning.
5. Kakade, S. M. 2003. On the Sample Complexity of Reinforcement Learning. Ph.D. Dissertation, Gatsby Computational Neuroscience Unit, University College London.
6. Kearns, M. J., and Koller, D. 1999. Efficient reinforcement learning in factored MDPs. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), 740-747.
7. Kearns, M. J., and Singh, S. P. 2002. Near-optimal reinforcement learning in polynomial time. Machine Learning 49(2-3):209-232.
8. Koenig, S., and Simmons, R. G. 1993. Complexity analysis of real-time reinforcement learning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 99-105. Menlo Park, CA: AAAI Press/MIT Press.
9. Leffler, B. R.; Littman, M. L.; Strehl, A. L.; and Walsh, T. 2005. Efficient exploration with latent structure. In Proceedings of Robotics: Science and Systems.
10. Russell, S. J., and Norvig, P. 1994. Artificial Intelligence: A Modern Approach. Englewood Cliffs, NJ: Prentice-Hall.
11. Sherstov, A. A., and Stone, P. 2005. Improving action selection in MDP's via knowledge transfer. In Proceedings of the Twentieth National Conference on Artificial Intelligence.
12. Strehl, A. L.; Li, L.; and Littman, M. L. 2006. Incremental model-based learners with formal learning-time guarantees. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI 2006).
13. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. The MIT Press.
14. Sutton, R. S. 1988. Learning to predict by the method of temporal differences. Machine Learning 3(1):9-44.
15. Tesauro, G. 1995. Temporal difference learning and TD-Gammon. Communications of the ACM 58-67.