Safe state abstraction and reusable continuing subtasks in hierarchical reinforcement learning

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

Volumn 4830 LNAI, Issue , 2007, Pages 58-67

  Hengst, Bernhard ^a,b  

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Decomposition; Hierarchical reinforcement learning; State abstraction; Task hierarchies

Indexed keywords

ABSTRACTING; AUTOMATION; FUNCTIONS; PROBLEM SOLVING; REINFORCEMENT LEARNING;

HIERARCHICAL REINFORCEMENT LEARNING; STATE ABSTRACTION; TASK HIERARCHIES; VALUE FUNCTIONS;

REUSABILITY;

EID: 38349050495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76928-6_8     Document Type: Conference Paper

References (8)

1. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)
2. Parr, R.E.: Hierarchical Control and learning for Markov decision processes. PhD thesis, University of California at Berkeley (1998)
3. Precup, D.: Temporal Abstraction in Reinforcement Learning. PhD thesis, Univeristy of Massachusetts, Amherst (2000)
4. Dietterich, T.G.: Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research 13, 227-303 (2000)
5. Dean, T., Givan, R.: Model minimization in markov decision processes. In: AAAI / IAAI, pp. 106-111 (1997)
6. Dayan, P., Hinton, G.E.: Feudal reinforcement learning. In: NIPS. Advances in Neural Information Processing Systems, vol. 5 (1992)
7. Kaelbling, L.P.: Hierarchical learning in stochastic domains: Preliminary results. In: Machine Learning Proceedings of the Tenth International Conference, pp. 167-173. Morgan Kaufmann, San Francisco (1993)
8. Hengst, B.: Discovering Hierarchy in Reinforcement Learning. PhD thesis, School of Computer Science and Engineering, University of New South Wales, Sydney, Australia (2003)