Evolving Artificial Trees Described by Parametric L-Systems

Created by W.Langdon from gp-bibliography.bib Revision:1.4208

  author =       "Gabriella K\'okai and Zolt\'an T\'oth and 
                 Robert V\'anyi",
  title =        "Evolving Artificial Trees Described by Parametric
  booktitle =    "Proceedings of the First Canadian Workshop on Soft
  year =         "1999",
  pages =        "1722--1728",
  address =      "Edmonton, Alberta, Canada",
  month =        "9 " # may,
  keywords =     "genetic algorithms, genetic programming, lindenmayer
  ISBN =         "0-7803-5579-2",
  URL =          "http://citeseer.ist.psu.edu/cache/papers/cs/23884/http:zSzzSzwww2.informatik.uni-erlangen.dezSz~kokaizSzpaperszSzppsn_g.pdf/evolving-artificial-trees-described.pdf",
  URL =          "http://citeseer.ist.psu.edu/464865.html",
  DOI =          "doi:10.1109/CCECE.1999.804977",
  abstract =     "Describes a solution of the inverse problem for
                 parametric Lindenmayer systems (L-systems) with genetic
                 algorithms. The inverse problem studied is that of
                 evolving Lindenmayer grammars to describe plants. A
                 genetic algorithm is used to evolve the rewriting rules
                 and the set of system parameters. In this paper, we
                 present on extension of the solution of G. Ochoa (1998)
                 and K.J. Mock (1998), by which genetic algorithms are
                 applied to simulate the evolution of artificial plant
                 morphologies. Three main improvements are described:
                 (1) more populations are processed in parallel; (2) an
                 adaptation scheme for the application probability of
                 genetic operators is applied; (3) the turtle graphics
                 system is modified so that 3D structures such as trees
                 can be evolved and drawn",

Genetic Programming entries for Gabriella Kokai Zoltan Toth Robert Vanyi