A METHOD OF REPRESENTING AUTOMATA WITH DECISION TREES FOR GENETIC PROGRAMMING



Read the full article 

Abstract

The paper proposes a new method for representation of automaton as an individual in an evolutionary algorithm based on a decision trees. Application of this method greatly reduces amount of memory needed for running evolutionary algorithm. The method of genetic programming based on the proposed representation is created. Efficiency of this method is illustrated on the example of solving one of the variants of “Artificial ant” problem.


Keywords: genetic programming, decision tree, finite state machine, automata-based programming 
Copyright 2001-2017 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика