Close category search window
 

A study on multi-agent reinforcement learning problem based on hierarchical modular fuzzy model

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
$31 $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

1 Author(s)
Watanabe, T. ; Osaka Electro-Commun. Univ., Neyagawa, Japan

Reinforcement learning is a promising approach to realize intelligent agent such as autonomous mobile robots. In order to apply the reinforcement learning to actual sized problem, the ldquocurse of dimensionalityrdquo problem in partition of sensory states should be avoided maintaining computational efficiency. The paper describes a hierarchical modular reinforcement learning that profit sharing learning algorithm is combined with Q-learning reinforcement learning algorithm hierarchically in multi-agent pursuit environment. As the model structure for such huge problem, I propose a modular fuzzy model extending SIRMs architecture. Through numerical experiments, I found that the proposed method has good convergence property of learning compared with the conventional algorithms.

Published in:
Fuzzy Systems, 2009. FUZZ-IEEE 2009. IEEE International Conference on

Date of Conference: 20-24 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.