Skip to main content

Evolution programs evolved

  • Basic Concepts of Evolutionary Computation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1141))

Abstract

Growth grammars in the form of parallel rewrite systems (L-systems) are used to model morphogenetic processes of plant structures. With the help of evolutionary programming techniques developmental programs are bred which encode plants that exhibit characteristic growth patterns advantageous in competitive environments.

Program evolution is demonstrated on the basis of extended genetic programming on symbolic expressions with genetic operators and expression generation strongly relying on templates and pattern matching.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Green, N., Voxel space automata: Modeling with stochastic growth processes in voxel space, Computer Graphics, ACM SIGGRAPH, 23(3), 1989, pp. 175–184.

    Google Scholar 

  2. Jacob, C., Genetic L-System Programming, Parallel Problem Solving from Nature — PPSN III, LNCS 866, Springer, Berlin, 1994, pp. 334–343.

    Google Scholar 

  3. Jacob, C., MathEvolvica — Simulierte Evolution von Entwicklungsprogrammen der Natur, Dissertation, Arbeitsberichte des Instituts für mathematische Maschinen und Datenverarbeitung, Band 28, Nummer 10, Erlangen, 1995.

    Google Scholar 

  4. Jacob, C., Modeling Growth with L-Systems & Mathematica, Mathematica in Education and Research, Vol. 4, No. 3, TELOS Springer, 1995.

    Google Scholar 

  5. Jacob, C., Evolving Evolution Programs: Genetic Programming and L-Systems, in: Koza, J.R., Goldberg, D.E., Fogel, D.B., and Riolo, R.L. (eds.), Genetic Programming 1996, MIT Press, Cambridge, MA, 1996.

    Google Scholar 

  6. Koza, J., Genetic Programming, MIT-Press, Cambridge, MA, 1992.

    Google Scholar 

  7. Koza, J., Discovery of rewrite rules in Lindenmayer systems and state transition rules in cellular automata via genetic programming, Symposium on Pattern Formation — SPF-93, Claramont, CA, 1993.

    Google Scholar 

  8. Koza, J., Genetic Programming II, MIT-Press, Cambridge, MA, 1994.

    Google Scholar 

  9. Kurth, W., Growth Grammar Interpreter GROGRA 2.4, Berichte des Forschungszentrums Waldökosysteme, Universität Göttingen, Reihe B, Band 38, 1994.

    Google Scholar 

  10. Lindenmayer, A., and Rozenberg, G. (eds.), Automata, Languages, Development, North-Holland, 1975.

    Google Scholar 

  11. Niklas, K.J., Computer-simulated Plant Evolution, in: Scientific American, 254 (March), 1986, pp. 68–75.

    Google Scholar 

  12. Peitgen, H.-O., Jürgens, H., Saupe, D., Chaos and Fractals, New Frontiers of Science, Springer-Verlag, 1993.

    Google Scholar 

  13. Prusinkiewicz, P., and Lindenmayer, A., The Algorithmic Beauty of Plants, Springer, New York, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacob, C. (1996). Evolution programs evolved. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_968

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_968

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

  • Online ISBN: 978-3-540-70668-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics