June 12, 2012 18:12 PSP Book - 9in x 6in 07-Junichi-Takeno-c07
124 Artificial Neural Networks and Machine Evolution
Oneelementofthegeneissubjectedtobitconversion,or1and
0 are overwritten by 0 and 1, respectively. The position of the bit
conversion can be arbitrarily determined.
g
1
= (0111 0000 0001 0101 0111 0001 0101 0010)
↑ Position of mutation
g
1
= (0111 0000 0001 0101 0011 0001 0101 0010)
= (7, 0, 1, 5, 3, 1, 5, 2)
In the above example, the value of the 18th position (underlined
1) of gene g
1
changes by mutation and a new gene g
1
is created.
These gene-operated genes are reproduced to give birth to the next
generation. The procedure is repeated until genes of a desirable
fitness are found.
It is understood that the machine evolution approach can not
only be applied to the design of the above-mentioned function unit
but also be expanded to the study of the shape of the machine
systems in which the function unit operates.
Karl Sims is a famous researcher on the evolution of shape. His
studies are very interesting, and I invite the readers to study his
work.
7.2.2 Summary and Observations
This section explained the machine evolution approach. The ma-
chine evolution approach simulates the biological evolution method
called the survival of the fittest. New generations are created by
mating, and the fittest among the individuals is selected for further
mating. This biological method is adopted in the machine evolution
approach using an engineering technique. “Fittest” means that one
is adapted to the environment. Our eventual goal is the survival
of excellent generations. I also explained that this approach is a
powerful method for complex neural networks to learn successfully.
This approach is useful in that it can find specific solutions to
problems for which humans are utterly at a loss as to how to find
solutions.
In the machine evolution approach, humans specify the geno-
types, set pairing of genotypes and their phenotypes, and stipulate