TY - GEN
T1 - Reinforcement learning in multi-dimensional state-action space using random rectangular coarse coding and Gibbs sampling
AU - Kimura, Hajime
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - This paper presents a coarse coding technique and an action selection scheme for reinforcement learning (RL) in multi-dimensional and continuous state-action spaces following conventional and sound RL manners. RL in high-dimensional continuous domains includes two issues: One is a generalization problem for value-function approximation, and the other is a sampling problem for action selection over multi-dimensional continuous action spaces. The proposed method combines random rectangular coarse coding with an action selection scheme using Gibbs-sampling. The random rectangular coarse coding is very simple and quite suited both to approximate Q-functions in high-dimensional spaces and to execute Gibbs sampling. Gibbs sampling enables us to execute action selection following Boltsmann distribution over high-dimensional action space. The algorithm is demonstrated through Rod in maze problem and a redundant-arm reaching task comparing with conventional regular grid approaches.
AB - This paper presents a coarse coding technique and an action selection scheme for reinforcement learning (RL) in multi-dimensional and continuous state-action spaces following conventional and sound RL manners. RL in high-dimensional continuous domains includes two issues: One is a generalization problem for value-function approximation, and the other is a sampling problem for action selection over multi-dimensional continuous action spaces. The proposed method combines random rectangular coarse coding with an action selection scheme using Gibbs-sampling. The random rectangular coarse coding is very simple and quite suited both to approximate Q-functions in high-dimensional spaces and to execute Gibbs sampling. Gibbs sampling enables us to execute action selection following Boltsmann distribution over high-dimensional action space. The algorithm is demonstrated through Rod in maze problem and a redundant-arm reaching task comparing with conventional regular grid approaches.
UR - http://www.scopus.com/inward/record.url?scp=51349128679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349128679&partnerID=8YFLogxK
U2 - 10.1109/IROS.2007.4399401
DO - 10.1109/IROS.2007.4399401
M3 - Conference contribution
AN - SCOPUS:51349128679
SN - 1424409128
SN - 9781424409129
T3 - IEEE International Conference on Intelligent Robots and Systems
SP - 88
EP - 95
BT - Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2007
T2 - 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2007
Y2 - 29 October 2007 through 2 November 2007
ER -