Automatic abstraction in reinforcement learning using data mining techniques

  • Authors:
  • Ghorban Kheradmandian;Mohammad Rahmati

  • Affiliations:
  • Department of Computer Eng., Amirkabir University of Technology, Tehran, Iran;Department of Computer Eng., Amirkabir University of Technology, Tehran, Iran

  • Venue:
  • Robotics and Autonomous Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we used data mining techniques for the automatic discovering of useful temporal abstraction in reinforcement learning. This idea was motivated by the ability of data mining algorithms in automatic discovering of structures and patterns, when applied to large data sets. The state transitions and action trajectories of the learning agent are stored as the data sets for data mining techniques. The proposed state clustering algorithms partition the state space to different regions. Policies for reaching different parts of the space are separately learned and added to the model in a form of options (macro-actions). The main idea of the proposed action sequence mining is to search for patterns that occur frequently within an agent's accumulated experience. The mined action sequences are also added to the model in a form of options. Our experiments with different data sets indicate a significant speedup of the Q-learning algorithm using the options discovered by the state clustering and action sequence mining algorithms.