Linear options

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2010, Pages 31-38

  Sorg, Jonathan ^a   Singh, Satinder ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Reinforcement Learning; Temporal Abstraction

Indexed keywords

ABSTRACTING; MULTI AGENT SYSTEMS; REINFORCEMENT LEARNING;

ABSTRACT MODELING; CONTINUOUS STATE SPACE; ENVIRONMENT STATE; EXPECTATION MODELS; PLANNING ALGORITHMS; TEMPORAL ABSTRACTION; TEMPORAL DIFFERENCES; VALUE FUNCTIONS;

AUTONOMOUS AGENTS;

EID: 84868298774     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Justin A. Boyan. Technical update: Least-squares temporal difference learning. Machine Learning, 49(2-3):233-246, 2002.
2. Steven J. Bradtke and Andrew G. Barto. Linear least-squares algorithms for temporal difference learning. Machine Learning, 22(1-3):33-57, 1996.
3. T. Croonenborghs, K. Driessens, and M. Bruynooghe. Learning relational options for inductive transfer in relational reinforcement learning. Lecture Notes in Computer Science, 4894:88, 2008.
4. Thomas Dietterich. Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition. Journal of Artificial Intelligence Research, 13:227-303, 1998.
5. George Konidaris and Andy Barto. Building portable options: Skill transfer in reinforcement learning. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 895-900, 2007.
6. George Konidaris and Andy Barto. Efficient skill learning using abstraction selection. In Proceedings of the Twenty First International Joint Conference on Artificial Intelligence, pages 1107-1112, 2009.
7. Ronald Parr, Lihong Li, Gavin Taylor, Christopher Painter-Wakefield, and Michael L. Littman. An analysis of linear models, linear value-function approximation, and feature selection for reinforcement learning. In ICML '08: Proceedings of the 25th international conference on Machine learning, pages 752-759, New York, NY, USA, 2008. ACM.
8. Özgür Şimşek and Andrew G. Barto. An intrinsic reward mechanism for efficient exploration. Proceedings of the 23rd international conference on Machine learning - ICML '06, pages 833-840, 2006.
9. Vishal Soni and Satinder Singh. Using Homomorphisms to transfer options across continuous reinforcement learning domains. Proceedings of the 21st, National Conference on Artificial Intelligence, 2006.
10. Richard Sutton, Doina Precup, and Satinder Singh. Between mdps and semi-mdps: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112:181-211, 1999.
11. Richard S. Sutton. Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming. In The Seventh International Conference on Machine Learning, pages 216-224, 1990.
12. Richard S. Sutton, Csaba Szepesvari, Alborz Geramifard, and Michael Bowling. Dyna-style planning with linear function approximation and prioritized sweeping. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pages 528-536, 2008.
13. John N. Tsitsiklis and Benjamin Van Roy. An analysis of temporal-difference learning with function approximation. IEEE Transactions on Automatic Control, 42:674-690, 1997.