By Topic

Reinforcement learning under incomplete perception using stochastic gradient ascent and recurrent neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
A. Onat ; Grad. Sch. of Eng., Kyoto Univ., Japan ; N. Kosino ; M. Kuramitu ; H. Kita

One of the important problems in reinforcement learning is the problem of incomplete perception, i.e., how to select the optimal action when the perception of the learning agent is not sufficient in detecting the states of the environment. One of the proposed solutions to this problem is to utilize recurrent neural networks for the architecture of the learning agent to build an internal dynamic model of the environment and to take actions based on the states of the model. Another approach is the stochastic gradient ascent method (SGA), proposed by Kimura et al. (1996), as a learning method for this problem. However, the SGA, which selects actions based on immediate percepts, can only achieve suboptimal performance under incomplete perception. This paper studies a combination of these techniques, where SGA is applied to recurrent neural networks. Computer simulations show that a learning agent using the proposed method can achieve optimal performance under incomplete perception

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:5 )

Date of Conference: