Fitted Q iteration with CMACs

Proceedings of the 2007 IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning, ADPRL 2007

Volumn , Issue , 2007, Pages 1-8

  Timmer, Stephan ^a   Riedmiller, Martin ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DATA ACQUISITION; ITERATIVE METHODS; LEARNING ALGORITHMS; STATE SPACE METHODS;

CMAC ARCHITECTURE; FUNCTION APPROXIMATORS; Q-LEARNING;

REINFORCEMENT LEARNING;

EID: 34548767315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ADPRL.2007.368162     Document Type: Conference Paper

References (15)

1. C. Watkins, "Learning from delayed rewards," Ph.D. dissertation, University of Cambridge, England, 1989.
2. D. P. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming. Belmont Massachusetts: Athena Scientific, 1996.
3. D. Ernst, P. Geurts, and L. Wehenkel, "Tree-based batch mode reinforcement learning," Journal of Machine Learning Research, vol. 6, pp. 503-556, April 2005.
4. G. J. Gordon, "Stable function approximation in dynamic programming," in Proceedings of the Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell, Eds. San Francisco, CA: Morgan Kaufmann, 1995, pp. 261-268.
5. S. P. Singh, T. Jaakkola, and M. I. Jordan, "Reinforcement learning with soft state aggregation," in Advances in Neural Information Processing Systems : Proceedings of the 1994 conference, G. Tesauro, D. Touretzky, and T. Leen, Eds., vol. 7. The MIT Press, 1995, pp. 361-368.
6. D. Ormoneit and S. Sen, "Kernel-based reinforcement learning," Machine Learning, vol. 49, no. 2-3, pp. 161-178, 2002.
7. M. Riedmiller, "Neural fitted q iteration - first experiences with a data efficient neural reinforcement learning method," in Proceedings of the Sixteenth European Conference on Machine Learning, Porto, Portugal, 2005, pp. 317-328.
8. M. G. Lagoudakis and R. Parr, "Least-squares policy iteration," Journal of Machine Learning Research, vol. 4, pp. 1107-1149, 2203a.
9. J. A Boyan, "Technical update: Least-squares temporal difference learning," Machine Learning, vol. 49, no. 2-3, pp. 233-246, 2002.
10. R. S. Sutton, "Generalization in reinforcement learning: Successful examples using sparse coarse coding," in Proceedings of the International Conference on Advances in Neural Information Processing Systems, D. S. Touretzky, M. C. Mozer, and M. E. Hasselmo, Eds., vol. 8. The MIT Press, 1996, pp. 1038-1044.
11. S. P. Singh and R. S. Sutton, "Reinforcement learning with replacing eligibility traces," Machine Learning, vol. 22, no. 1-3, pp. 123-158, 1996.
12. G. J. Gordon, "Stable function approximation in dynamic programming," Carnegie Mellon University, Pittsburgh, PA 15213, Tech. Rep. CMU-CS95-103, January 1995.
13. D. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
14. R. Schoknecht and M. Riedmiller, "Reinforcement learning on explicitly specified time-scales," Neural Computing, vol. 12, no. 2, pp. 61-80, 2003.
15. R. Sutton and A. Barto, Reinforcement Learning, An Introduction. Cambridge, Massachusetts: The MIT Press, 1998.