Representations for artificial organisms
Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
An introduction to genetic algorithms
An introduction to genetic algorithms
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Knowledge Growth in an Artificial Animal
Proceedings of the 1st International Conference on Genetic Algorithms
Evolving behaviors in the iterated prisoner's dilemma
Evolutionary Computation
| Hi-index | 0.00 |
Since the early beginnings of Evolutionary Computation, Finite State Machines (FSMs) have been applied to model organisms. We present a new approach to evolve such artificial organisms. The FSMs are subject to a difficult navigation and searching task in heterogeneous environments. We give a definition of FSM-species and investigate their formation. The results show that species are formed as the organisms agree on a common 'genetic broadcast language' and take advantage of the fruitful effects of recombination. As observed in natural ecosystems, higher abiotic diversity leads to higher biotic diversity.