Information Services banner Edinburgh Research Archive The University of Edinburgh crest

Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1842/3697

This item has been viewed 11 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Geodesic Gaussian kernels for value function approximation.pdf2.57 MBAdobe PDFView/Open
Title: Geodesic Gaussian kernels for value function approximation
Authors: Sugiyama, Masashi
Hachiya, Hirotaka
Towell, Christopher
Vijayakumar, Sethu
Issue Date: 2008
Journal Title: Autonomous Robots
Volume: 25
Issue: 3
Page Numbers: 287-304
Publisher: Springer
Abstract: The least-squares policy iteration approach works efficiently in value function approximation, given appropriate basis functions. Because of its smoothness, the Gaussian kernel is a popular and useful choice as a basis function. However, it does not allow for discontinuity which typically arises in real-world reinforcement learning tasks. In this paper, we propose a new basis function based on geodesic Gaussian kernels, which exploits the non-linear manifold structure induced by the Markov decision processes. The usefulness of the proposed method is successfully demonstrated in simulated robot arm control and Khepera robot navigation.
Keywords: Reinforcement learning
Value function approximation
Markov decision process
Least-squares policy iteration
Gaussian kernel
URI: http://www.springerlink.com/content/4j2g52m1272hj185/
http://hdl.handle.net/1842/3697
Appears in Collections:Informatics Publications

Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback