Model Approximation for HEXQ Hierarchical Reinforcement Learning

HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In this paper we extend HEXQ with heuristics that automatically approximate the structure of the task hierarchy. Construction, learning and execution time, as well as storage requirements of a task hierarchy may be significantly reduced and traded off against solution quality.

• Type: Conference
• Year: 2004
• Where: ECML
• Authors: Bernhard Hengst
• Keywords: ECML 2004, Generated Task Hierarchy, Reinforcement Learning Algorithm, Task Hierarchy