Multiagent Cooperating Learning Methods by Indirect Media Communication(Neural Netoworks and Bioengineering)

スポンサーリンク

概要

• 論文の詳細を見る

• Reinforcement Learning (RL) is an efficient learning method for solving problems that learning agents have no knowledge about the environment a priori. Ant Colony System (ACS) provides an indirect communication method among cooperating agents, which is an efficient method for solving combinatorial optimization problems. Based on the cooperating method of the indirect communication in ACS and the update policy of reinforcement values in RL, this paper proposes the Q-ACS multiagent cooperating learning method that can be applied to both Markov Decision Processes (MDPs) and combinatorial optimization problems. The advantage of the Q-ACS method is for the learning agents to share episodes beneficial to the exploitation of the accumulated knowledge and utilize the learned reinforcement values efficiently. Further, taking the visited times into account, this paper proposes the T-ACS multiagent learning method. The merit of the T-ACS method is that the learning agents share better policies beneficial to the exploration during agent's learning processes. Meanwhile, considering the Q-ACS and the T-ACS as homogeneous multiagent learning methods, in the light of indirect media communication among heterogeneous multiagent, this paper presents a heterogeneous multiagent RL method, the D-ACS that composites the learning policy of the Q-ACS and the T-ACS, and takes different updating policies of reinforcement values. The agents in our methods are given a simply cooperating way exchanging information in the form of reinforcement values updated in the common model of all agents. Owning the advantages of exploring the unknown environment actively and exploiting learned knowledge effectively, the proposed methods are able to solve both problems with MDPs and combinatorial optimization problems effectively. The results of experiments on hunter game and traveling salesman problem demonstrate that our methods perform competitively with representative methods on each domain respectively.

• 2003-11-01

著者

• TATSUMI Shoji

  Faculty of Engineering, Osaka City University

• Tatsumi Shoji

  Faculty Of Engineering Osaka City University

• Tatsumi S

  Osaka City Univ. Osaka‐shi Jpn

• Zhao Gang

  Fujitsu Kansai-chubu Net-tech Limited

• Zhao Gang

  National Astronomical Observatories Chinese Acad. Of Sci. Beijing Chn

• SUN Ruoying

  Faculty of Engineering, Osaka City University

• Sun Ruoying

  Faculty Of Engineering Osaka City University

関連論文

• Parallel Genetic Algorithm for Constrained Clustering
• Parallel Genetic Algorithms Based on a Multiprocessor System FIN and Its Application
• Boltzmann Machine and Parallel Genetic Algorithms Based on the Fin
• A PARALLEL IMPLEMENTATION OF THE LEARNING CLASSIFIER SYSTEMS ON THE FIN-1
• Substellar Companions to Evolved Intermediate-Mass Stars : HD 145457 and HD 180314
• Detection of Small-Amplitude Oscillations in the G-Giant HD 76294 (ζ Hydrae)
• Calculation of Photoionized Plasmas with a Detailed-Configuration-Accounting Atomic Model
• Multiagent Cooperating Learning Methods by Indirect Media Communication(Neural Netoworks and Bioengineering)
• On the Spectroscopic Determination of Atmospheric Parameters and O/Fe Abundances of RR Lyrae Stars
• Multiagent Cooperating Learning Methods by Indirect Media Communication
• Na I D Lines in the SN 2002ap Spectrum
• On the Abundance of Potassium in Metal-Poor Stars
• α Element Abundances in Mildly Metal-Poor Stars
• Convergence of the Q-ae Learning on Deterministic MDPs and Its Efficiency on the Stochastic Environment
• RTP-Q: A Reinforcement Learning System with Time Constraints Exploration Planning for Accelerating the Learning Rate
• Q-ee Learning : A Novel Q-Learning Method with Exploitation and Exploration
• An Accelerated k-Certainty Exploration Method
• Electron Impact Excitation of Ti XVIII
• Applying Genetic Algorithm to Conceptual Clustering
• Algorithms for Matrix Multiplication and the FFT on a Processor Array with Separable Buses(Regular Section)
• Solving an All-Pairs Shortest Paths Problem on a Processor Array with Separable Buses
• A Pattern Defect Inspection Method by Grayscale Image Comparison without Precise Image Alignment
• Electron Impact Excitation of N-like Ca XIV

もっと見る 閉じる

スポンサーリンク