Probabilistic policy reuse in a reinforcement learning agent

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 720-727

  Fernández, Fernando ^a   Veloso, Manuela ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INFORMATION MANAGEMENT; INFORMATION USE; PROBABILITY; REINFORCEMENT LEARNING;

EXPLORATION STRATEGY; POLICY REUSE; PROBABILISTIC POLICY; REINFORCEMENT LEARNING AGENT;

MULTI AGENT SYSTEMS;

EID: 34247199512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160762     Document Type: Conference Paper

References (19)

1. M. Bowling and M. Veloso. Bounding the suboptimality of reusing subproblems. In Proceedings of IJCAI-99, 1999.
2. J. Carroll and T. Peterson. Fixed vs. dynamic sub-transfer in reinforcement learning. In Proceedings of the International Conference on Machine Learning and Applications, 2002.
3. T. G. Dietterich. Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research, 13:227-303, 2000.
4. F. Fernández and D. Borrajo. On determinism handling while learning reduced state space representations. In Proceedings of the European Conference on Artificial Intelligence (ECAI 2002), Lyon (France), July 2002.
5. F. Fernández and M. Veloso. Exploration and policy reuse. Technical Report CMU-CS-05-172, School of Computer Science, Carnegie Mellon University, 2005.
6. B. Hengst. Discovering hierarchy in reinforcement learning with HEXQ. In Proceedings of the Nineteenth International Conference on Machine Learning, 2002.
7. R. Maclin, J. Shavlik, L. Torrey, T. Walker, and E. Wild. Giving advice about preferred actions to reinforcement learners via, knowledge-based kernel regression. In Proceedings of the Twentieth National Conference on Artificial Intelligence, July 2005. To appear.
8. M. G. Madden and T. Howley. Transfer of experience between reinforcement learning environments with progressive difficulty. Artificial Intelligence Review, 21:375-398, 2004.
9. R. B. Ollington and P. W. Vamplew. Concurrent Q-Learning: Reinforcement learning for dynamic goals and environments. International Journal of Intelligent Systems, 20:1037-1052, 2005.
10. B. Price and C. Boutilier. Accelerating reinforcement learning through implicit imitation. Journal of Artificial Intelligence Research, 19:569-629, 2003.
11. A. A. Sherstov and P. Stone. Improving action selection in MDP's via knowledge transfer. In Proceedings of the Twentieth National Conference on Artificial Intelligence, July 2005.
12. Ö. Şimşek, A. P. Wolfe, and A. G. Barto. Identifying useful subgoals in reinforcement learning by local graph partitioning. In Proceedings of the Twenty-Second International Conference on Machine Learning, 2005.
13. R. S. Sutton, D. Precup, and S. Singh. Intra-option learning about temporally abstract actions. In Proceedings of the Internacional Conference on Machine Learning (ICML'98), 1998.
14. M. E. Taylor and P. Stone. Behavior transfer for value-function-based reinforcement learning. In The Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, July 2005. To appear.
15. M. E. Taylor, P. Stone, and Y. Liu. Value functions for RL-based behavior transfer: A comparative study. In Proceedings of the Twentieth National Conference on Artificial Intelligence, July 2005. To appear.
16. S. Thrun. Efficient exploration in reinforcement learning. Technical Report C,I-CS-92-102, Carnegie Mellon University, January 1992.
17. S. Thrun and A. Schwartz. Finding structure in reinforcement learning. In Advances in Neural Information Processing Systems 7. MIT Press., 1995.
18. W. T. B. Uther. Tree Based Hierarchical Reinforcement Learning. PhD thesis, Carnegie Mellon University, August 2002.
19. C. J. C. H. Watkins. Learning from Delayed Rewards. PhD thesis, King's College, Cambridge, UK, 1989.