Abstract
In this paper, efficiency improvement of reinforcement learning using parallel processing for combination value function. We propose the method of periodically composing Q table of local learning clusters to global Q table. We apply this method to two applications. One is maze problem and an another is behavior rule detection problem for modular typed robot. Q Learning method and Monte Carlo method are compared with profit share method that learns robot behaviors. We presented computer experiments of 40 PC clusters. The convergence time and learning times are evaluated and discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
