Partial Order Hierarchical Reinforcement Learning

In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-tasking actions. We go further and show how a problem can be automatically decomposed into a partial-order task-hierarchy, and solved using hierarchical reinforcement learning. The problem structure determines the reduction in memory requirements and learning time.

• Type: Conference
• Year: 2008
• Where: AUSAI
• Authors: Bernhard Hengst
• Keywords: Artificial Intelligence, AUSAI 2008, Multi-tasking Actions, Partial-order Plan, Problem Structure