抄録
This paper proposed a novel EDA, where a directed graph network is used to represent its chromosome. In the proposed algorithm, a probabilistic model is constructed from the promising individuals of the current generation using reinforcement learning, and used to produce the new population. The node connection probability is studied to develop the probabilistic model, therefore pairwise interactions can be demonstrated to identify and recombine building blocks in the proposed algorithm. The proposed algorithm is applied to a problem of agent control, i.e., autonomous robot control. The experimental results show the superiority of the proposed algorithm comparing with the conventional algorithms.
本文言語 | English |
---|---|
ホスト出版物のタイトル | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
ページ | 37-44 |
ページ数 | 8 |
DOI | |
出版ステータス | Published - 2011 |
イベント | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 - New Orleans, LA 継続期間: 2011 6月 5 → 2011 6月 8 |
Other
Other | 2011 IEEE Congress of Evolutionary Computation, CEC 2011 |
---|---|
City | New Orleans, LA |
Period | 11/6/5 → 11/6/8 |
ASJC Scopus subject areas
- 計算理論と計算数学
- 理論的コンピュータサイエンス