DocumentCode
2781452
Title
Rule accumulation method based on Credit Genetic Network Programming
Author
Wang, Lutao ; Xu, Wei ; Mabu, Shingo ; Hirasawa, Kotaro
Author_Institution
Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu, Japan
fYear
2012
fDate
10-15 June 2012
Firstpage
1
Lastpage
8
Abstract
As a new promising evolutionary computation method, Genetic Network Programming (GNP) is good at generating action rules for multi-agent control in dynamic environments. However, some unimportant nodes exist in the program of GNP. These nodes serve as some redundant information which decreases the performance of GNP and the quality of the generated rules. In order to prune these nodes, this paper proposes a novel method named Credit GNP, where a credit branch is added to each node. When the credit branch is visited, the node is neglected and its function is not executed, so that the unimportant nodes could be jumped. The probability of visiting this credit branch and to which node it is jumped is determined by both evolution and Sarsa-learning, therefore, the unimportant nodes could be pruned automatically. Simulation results on the Tile-world problem show that the proposed method could get better programs and generate better and more general rules.
Keywords
genetic algorithms; learning (artificial intelligence); multi-agent systems; probability; Sarsa-learning; Tile-world problem; action rule generation; automatic unimportant node pruning; credit branch; credit genetic network programming; dynamic environment; evolutionary computation method; multiagent control; probability; redundant information; rule accumulation method; Economic indicators; Genetics; Integrated circuits; Learning; Testing; Tiles; Training;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2012 IEEE Congress on
Conference_Location
Brisbane, QLD
Print_ISBN
978-1-4673-1510-4
Electronic_ISBN
978-1-4673-1508-1
Type
conf
DOI
10.1109/CEC.2012.6253004
Filename
6253004
Link To Document