Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bäck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, New York (1996)
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming-An Introduction: On the Automatic Programming of Computer Programs and its Applications. Morgan Kaufman, San Francisco, dpunkt.verlag, Heidelberg (1998)
Collins, R.J., Jefferson, D.R.: Representations for Artificial Organisms. In: Meyer, J.-A. (ed.): From Animals to Animats, Proceedings of the First International Conference on Simulation of Adaptive Behavior. MIT Press, Cambridge (1991) 382–390
Collins, R.J., Jefferson, D.R.: AntFarm: Towards Simulated Evolution. In: Langton, C.G., Taylor, C., Farmer, J.D., Rasmussen, S. (eds.): Artificial Life II. Addison Wesley, Redwood City (1991) 579–601
Fogel, D.B.: Evolving Behaviors in the Iterated Prisoner’s Dilemma. Evol. Comp. 1 (1993) 77–97
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. John Wiley, New York (1966)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
Jefferson, D.R., Collins, R.J., Cooper, C., Dyer, M., Flowers, M., Korf, R., Taylor, C., Wang, A.: Evolution as a Theme in Artificial Life: The Genesys/Tracker System. In: Langton, C.G., Taylor, C, Farmer, J.D., Rasmussen, S. (eds.): Artificial Life II. Addison-Wesley, Redwood City (1991) 549–578
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer-Verlag, Berlin Heidelberg New York (1996)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Schwefel, H.-P.: Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie: Mit einer vergleichenden Einführung in die Hill-Climbing und Zufallsstrategien. Birkhäuser, Basel (1977)
Törn, A., Žilinskas, A.: Global Optimization, Lecture Notes in Computer Science, Vol. 350. Springer-Verlag, Berlin Heidelberg New York (1989)
Wilson, S.W.: Knowledge Growth in an Artificial Animal. In: Greffenstette, J.J. (ed.), Proceedings of the First International Conference on Genetic Algorithms and Their Applications. Erlbaum, Hillsdale (1985) 16–23
EFSM homepage: http://www.bitoek.uni-bayreuth.de/MOD/Software/EFSM/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rasek, A., Dörwald, W., Hauhs, M., Kastner-Maresch, A. (1999). Species Formation in Evolving Finite State Machines. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-48304-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66452-9
Online ISBN: 978-3-540-48304-5
eBook Packages: Springer Book Archive