Evolving Co-Adapted Subcomponents in Assembler Encoding

نویسنده

  • Tomasz Praczyk
چکیده

The paper presents a new Artificial Neural Network (ANN) encoding method called Assembler Encoding (AE). It assumes that the ANN is encoded in the form of a program (Assembler Encoding Program, AEP) of a linear organization and of a structure similar to the structure of a simple assembler program. The task of the AEP is to create a Connectivity Matrix (CM) which can be transformed into the ANN of any architecture. To create AEPs, and in consequence ANNs, genetic algorithms (GAs) are used. In addition to the outline of AE, the paper also presents a new AEP encoding method, i.e., the method used to represent the AEP in the form of a chromosome or a set of chromosomes. The proposed method assumes the evolution of individual components of AEPs, i.e., operations and data, in separate populations. To test the method, experiments in two areas were carried out, i.e., in optimization and in a predator-prey problem. In the first case, the task of AE was to create matrices which constituted a solution to the optimization problem. In the second case, AE was responsible for constructing neural controllers used to control artificial predators whose task was to capture a fast-moving prey.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Forming Neural Networks by Means of Assembler Encoding-Preliminary Report

This paper presents a new neural network encoding method called Assembler Encoding. The method was tentatively tested in the predator-prey problem. In the experiments, neural networks created by means Assembler Encoding, were used to control predators whose task was to capture a fast moving prey behaving according to a simple strategy. To compare Assembler Encoding with another neural network e...

متن کامل

Encoding subcomponents in cooperative co-evolutionary recurrent neural networks

Cooperative coevolution employs evolutionary algorithms to solve a high-dimensional search problem by decomposing it into low-dimensional subcomponents. Efficient problem decomposition methods or encoding schemes group interacting variables into separate subcomponents in order to solve them separately where possible. It is important to find out which encoding schemes efficiently group separabil...

متن کامل

Discovering Fuzzy Classification Rules with Genetic Programming and Co-evolution

In essence, data mining consists of extracting knowledge from data. This paper proposes a co-evolutionary system for discovering fuzzy classification rules. The system uses two evolutionary algorithms: a genetic programming (GP) algorithm evolving a population of fuzzy rule sets and a simple evolutionary algorithm evolving a population of membership function definitions. The two populations co-...

متن کامل

Assembler Encoding Versus Connectivity Matrix Encoding in the Inverted Pendulum Problem with a Hidden State

Assembler Encoding is the Artificial Neural Network encoding method. To date, Assembler Encoding has been tested in the optimization problem and in the so-called predator-prey problem. The paper reports experiments in a next test problem, i.e. in the inverted pendulum problem. To compare Assembler Encoding with other Artificial Neural Network encoding methods in the experiments, two direct enco...

متن کامل

Using Assembler Encoding to Solve Inverted Pendulum Problem

Assembler Encoding is Artificial Neural Network encoding method. To date, Assembler Encoding has been tested in two problems, i.e. in an optimization problem in which a solution is in the form of a matrix and in the so-called predatorprey problem in which the task of ANN is to control agent-predators whose common goal is to capture a fast moving agent-prey. The next problem in which Assembler E...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computer Science

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2007