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
%0 Conference Paper
%1 kokai1999-1
%A Kókai, Gabriella
%A Tóth, Zoltán
%A Ványi, Robert
%B Proceedings of the First Canadian Workshop on Soft
Computing
%C Edmonton, Alberta, Canada
%D 1999
%K L-systems algorithms, genetic lindenmayer programming,
%P 1722--1728
%R doi:10.1109/CCECE.1999.804977
%T Evolving Artificial Trees Described by Parametric
L-Systems
%U http://citeseer.ist.psu.edu/464865.html
%X 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
%@ 0-7803-5579-2
@inproceedings{kokai1999-1,
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},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Edmonton, Alberta, Canada},
author = {K\'okai, Gabriella and T\'oth, Zolt\'an and V\'anyi, Robert},
biburl = {https://www.bibsonomy.org/bibtex/27fa29cc663c53496cd28c47a9edb0a4b/brazovayeye},
booktitle = {Proceedings of the First Canadian Workshop on Soft
Computing},
doi = {doi:10.1109/CCECE.1999.804977},
interhash = {69a1b6bba9f6c1970d3563caf6cb9580},
intrahash = {7fa29cc663c53496cd28c47a9edb0a4b},
isbn = {0-7803-5579-2},
keywords = {L-systems algorithms, genetic lindenmayer programming,},
month = {9 May},
pages = {1722--1728},
timestamp = {2008-06-19T17:43:35.000+0200},
title = {Evolving Artificial Trees Described by Parametric
{L}-Systems},
url = {http://citeseer.ist.psu.edu/464865.html},
year = 1999
}