Identifying Useful Subgoals in Reinforcement Learning by Local Graph Partitioning

Authors

Özgür Şimşek, University of Massachusetts - Amherst
Alicia P. Wolfe, University of Massachusetts - Amherst
Andrew G. Barto, University of Massachusetts - Amherst

Publication Date

2005

Abstract

We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition graphs—those that are constructed using only the most recent experiences of the agent. The local scope of our subgoal discovery method allows it to successfully identify the type of subgoals we seek—states that lie between two densely-connected regions of the state space—while producing an algorithm with low computational cost.

Comments

This paper was harvested from CiteSeer

Recommended Citation

Şimşek, Özgür; Wolfe, Alicia P.; and Barto, Andrew G., "Identifying Useful Subgoals in Reinforcement Learning by Local Graph Partitioning" (2005). Computer Science Department Faculty Publication Series. 19.
Retrieved from https://scholarworks.umass.edu/cs_faculty_pubs/19