Learning by Automatic Option Discovery from Conditionally Terminating Sequences

Abstract. This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure online in order to identify action sequences which are used frequently together with states that are visited during the execution of such sequences. The tree is then used to implicitly run corresponding options. Effectiveness of the method is demonstrated empirically.

• Type: Conference
• Year: 2006
• Where: ECAI
• Authors: Sertan Girgin, Faruk Polat, Reda Alhajj
• Keywords: Artificial Intelligence, ECAI 2006, Possible Optimal Policies, Reinforcement Learning Framework, Specialized Tree Structure