Rule accumulation method based on Credit Genetic Network Programming

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.

[1]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[2]  Kotaro Hirasawa,et al.  Genetic Network Programming and Its Application to the Multiagent System , 2002 .

[3]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

[4]  Martha E. Pollack,et al.  Introducing the Tileworld: Experimentally Evaluating Agent Architectures , 1990, AAAI.

[5]  Chris Watkins,et al.  Learning from delayed rewards , 1989 .

[6]  George E. Monahan,et al.  A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 2007 .

[7]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[8]  Shingo Mabu,et al.  A Graph-Based Evolutionary Algorithm: Genetic Network Programming (GNP) and Its Extension Using Reinforcement Learning , 2007, Evolutionary Computation.

[9]  Kotaro Hirasawa,et al.  A study of evolutionary multiagent models based on symbiosis , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Wei Cai,et al.  A Genetic Algorithm Approach to Multi-Agent Itinerary Planning in Wireless Sensor Networks , 2011, Mob. Networks Appl..

[12]  Mahesan Niranjan,et al.  On-line Q-learning using connectionist systems , 1994 .

[13]  E. A. Guggenheim,et al.  Boltzmann's Distribution Law , 1956 .

[14]  G. Monahan State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 1982 .

[15]  Shingo Mabu,et al.  Genetic Network Programming with Rule Accumulation and its Application to Tile-World Problem , 2009, J. Adv. Comput. Intell. Intell. Informatics.

[16]  Shingo Mabu,et al.  Enhanced rule extraction and classification mechanism of genetic network programming for stock trading signal generation , 2011, GECCO '11.

[17]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[18]  Shingo Mabu,et al.  An Intrusion-Detection Model Based on Fuzzy Class-Association-Rule Mining Using Genetic Network Programming , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[19]  Franziska Klügl-Frohnmeyer,et al.  Evolution for modeling: a genetic programming framework for sesam , 2011, GECCO.

[20]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[21]  Riccardo Poli,et al.  Fitness Causes Bloat , 1998 .

[22]  Kotaro Hirasawa,et al.  A Double-Deck Elevator Group Supervisory Control System Using Genetic Network Programming , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).