Automatic discovery of subgoals in reinforcement learning using strongly connected components

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5506 LNCS, Issue PART 1, 2009, Pages 829-834

  Kazemitabar, Seyed Jalal ^a   Beigy, Hamid ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC DETECTION; AUTOMATIC DISCOVERY; DISCOVERY ALGORITHM; GRAPH PARTITIONING; GRAPH THEORETIC APPROACH; HIERARCHICAL STRUCTURES; LINEAR TIME; PARAMETER-TUNING; REAL-WORLD PROBLEM; STRONGLY CONNECTED COMPONENT; SUBGOALS; TIME COMPLEXITY;

ALGORITHMS; DATA PROCESSING; REINFORCEMENT LEARNING; TRANSLATION (LANGUAGES);

REINFORCEMENT;

EID: 70349120325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02490-0_101     Document Type: Conference Paper

References (9)

1. Asadi, M., Huber, M.: Reinforcement learning acceleration through autonomous subgoal discovery. In: Proceedings of The 2005 International Conference on Machine Learning, Models, Technologies and Applications, pp. 69-74 (2005)
2. Chen, F., Gao, Y., Chen, S., Ma, Z.: Connect-based subgoal discovery for options in hierarchical reinforcement learning. In: Proceedings of the 3rd International Conference on Natural Computation, pp. 698-702 (2007)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
4. Mannor, S., Menache, I., Hoze, A., Klein, U.: Dynamic abstraction in reinforcement learning via clustering. In: Proceedings of the 21st International Conference on Machine Learning, pp. 560-567 (2004)
5. McGovern, A., Barto, A.G.: Automatic discovery of subgoals in reinforcement learning using diverse density. In: Proceedings of the 18th International Conference on Machine Learning, pp. 361-368 (2001)
6. Menache, I., Mannor, S., Shimkin, N.: Q-cut - dynamic discovery of sub-goals in reinforcement learning. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) ECML 2002. LNCS, vol.2430, pp. 295-306. Springer, Heidelberg (2002)
7. Simsek, O., Barto, A.G.: Using relative novelty to identify useful temporal abstrac- tions in reinforcement learning. In: Proceedings of the 21st International Conference on Machine Learning, pp. 751-758 (2004)
8. Simsek, O., Wolfe, A.P., Barto, A.G.: Identifying useful subgoals in reinforcement learning by local graph partitioning. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 816-823 (2005)
9. Sutton, R.S., Precup, D., Singh, S.P.: Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Journal of Artificial Intelligence 112, 181-211 (1999)