書誌事項
- タイトル別名
-
- Genetic Network Programming with Automatically Generated Macro Nodes of Variable Size
- プログラムサイズ カヘンガタ マクロノードツキ イデンテキ ネットワーク プログラミング
この論文をさがす
抄録
Recently, Genetic Network Programming (GNP) has been proposed as one of the evolutionary algorithms. It represents its solutions as directed graph structures and the distinguished abilities have been shown. However, when we apply GNP to complex problems like the real world one, GNP must have robustness against the changes of environments and evolve quickly. Therefore, we introduced Automatically Generated Macro Nodes (AGMs) to GNP (GNP with AGMs). Actually GNP with AGMs has shown higher performances than the conventional GNP in terms of the fitness and the speed of evolution. In this paper, a new mechanism, AGMs with variable size, is introduced to GNP. Conventional AGMs have the fixed number of nodes and they evolve using only genetic operations, while a new method allows AGM to add nodes by necessity and delete nodes which do not contribute to the evolution of the AGM. The proposed GNP with AGMs of variable size is expected to evolve effectively and efficiently when it is applied to agent systems and also expected to make better behavior sequences of agents more easily than the conventional GNP algorithm. In the simulations, the proposed and conventional methods are applied to a tileworld problem and they are compared with each other. From the results, GNP with AGMs of variable size shows better fitness than GNP with AGMs of fixed size and the conventional GNP when adapting ten different environments.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 126 (4), 548-555, 2006
一般社団法人 電気学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001204605510400
-
- NII論文ID
- 10017539493
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL書誌ID
- 7911668
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可