On genetic algorithms and lindenmayer systems
This paper describes a system for simulating the evolution of artificial 2D plant morphologies. Virtual plant genotypes are inspired by the mathematical formalism known as Lindenmayer systems (L-systems). The phenotypes are the branching structures resulting from the derivation and graphic interpretation of the genotypes. Evolution is simulated using a genetic algorithm with a fitness function inspired by current evolutionary hypotheses concerning the factors that have had the greatest effect on plant evolution. The system also provides interactive selection, allowing the user to direct simulated evolution towards preferred phenotypes. Simulation results demonstrate many interesting structures, suggesting that artificial evolution constitutes a powerful tool for (1) exploring the large, complex space of branching structures found in nature, and (2) generating novel ones. Finally, we emphasize that Lindenmayer systems constitute a highly suitable encoding for artificial evolution studies.
KeywordsGenetic Algorithm Fitness Function Computer Graphic Graphic Interpretation Artificial Evolution
Unable to display preview. Download preview PDF.
- 1.Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, (1991)Google Scholar
- 2.Dawkins, R.: The Blind Watchmaker. Harlow Longman, (1986)Google Scholar
- 3.Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)Google Scholar
- 4.Jacob, C: Genetic L-system Programming. Parallel Problem Solving from Nature III (PPSN'III), Lecture Notes in Computer Science, Vol. 866, Ed. Y. Davidor and P. Schwefel. Springer-Verlag, Berlin (1994) 334–343Google Scholar
- 5.Jefferson, D., Collins, R., Cooper, C., Dyer, M., Flowers, M., Korf, R., Taylor, C, Wang, A.: Evolution as a Theme in Artificial Life: The Genesys/Tracker System. In: Artificial Life II: Proceedings of the second workshop on the synthesis and simulation of living systems, Vol. X, SFI Studies in the Sciences of Complexity, Ed. C. Langton, C. Tylor, J. D. Farmer, and S. Rasmussen. Addison-Wesley, Redwood City (1991)Google Scholar
- 6.Koza, J.: Genetic Programming: on the Programming of Computers by Means of Natural Selectio. MIT Press, (1992)Google Scholar
- 8.Mitchell, M. 1996. An Introduction to Genetic Algorithms. MIT Press, (1996)Google Scholar
- 9.Niklas, K.: Computer Simulated Plant Evolution. Scientific American (May 1985), (1985)Google Scholar
- 10.Niklas, K.: Biophysical limitations on plant form and evolution. Plant Evolutionary Biology, Ed. L. D. Gottlieb and S. K. Jain. Chapman and Hall Ltd, (1988)Google Scholar
- 11.Niklas, K.: The Evolutionary Biology of Plants. The university of Chicago Press, Chicago (1997)Google Scholar
- 13.Prusinkiewics, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer-Verlag, (1990).Google Scholar
- 16.Sims, K.: Evolving Virtual Creatures. Proceedings of SIGGRAPH '94, in Computer Graphics. ACM SIGGRAPH, 28(4) (1994) 15–22Google Scholar