An extended probabilistic model building genetic network programming using both of good and bad individuals

Xianneng Li, Shingo Mabu, Kotaro Hirasawa*

*この研究の対応する著者

研究成果: Article査読

11 被引用数 (Scopus)

抄録

Classical estimation of distribution algorithms (EDAs) generally use truncation selection to estimate the distribution of the good individuals while ignoring the bad ones. However, various researches in evolutionary algorithms (EAs) have reported that the bad individuals may affect and help solving the problem. This paper proposes a new method to use the bad individuals by studying the substructures rather than the entire individual structures to solve reinforcement learning (RL) problems, which generally factorize their entire solutions to the sequences of state-action pairs. This work was studied in a recent graph-based EDA named probabilistic model building genetic network programming (PMBGNP), which could solve RL problems successfully, to propose an extended PMBGNP. The effectiveness of this work is verified in an RL problem, namely robot control. Compared to other related work, results show that the proposed method can significantly speed up the evolution efficiency.

本文言語English
ページ(範囲)339-347
ページ数9
ジャーナルIEEJ Transactions on Electrical and Electronic Engineering
8
4
DOI
出版ステータスPublished - 2013 7月

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「An extended probabilistic model building genetic network programming using both of good and bad individuals」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル