Efficient Abstraction Selection in Reinforcement Learning

Authors
Publication date 2013
Host editors
  • A.M. Frisch
  • P. Gregory
Book title Proceedings, The Tenth Symposium on Abstraction, Reformulation, and Approximation (SARA 2013)
ISBN
  • 9781577356301
Event Symposium on Abstraction, Reformulation, and Approximation; 10 (Leavenworth, Wash.): 2013.07.11-12
Pages (from-to) 123-127
Publisher Palo Alto, California: AAAI Press
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract This paper introduces a novel approach for abstraction selection in reinforcement learning problems modelled as factored Markov decision processes (MDPs), for which a state is described via a set of state components. In abstraction selection, an agent must choose an abstraction from a set of candidate abstractions, each build up from a different combination of state components.
Document type Conference contribution
Note Extended abstract
Language English
Published at http://www.aaai.org/ocs/index.php/SARA/SARA13/paper/view/7259/6271
Permalink to this page
Back