DocumentCode
3319782
Title
Evolving artificial trees described by parametric L-systems
Author
Kokai, G. ; Toth, Zoltan ; Vanyi, R.
Author_Institution
Dept. of Comput. Sci., Friedrich-Alexander Univ. of Erlangen, Germany
Volume
3
fYear
1999
fDate
9-12 May 1999
Firstpage
1722
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.
Keywords
biology computing; botany; computer graphics; evolution (biological); genetic algorithms; graph grammars; inverse problems; parallel algorithms; rewriting systems; 3D structure drawing; Lindenmayer grammars; adaptation scheme; artificial plant morphologies; artificial tree evolution; genetic algorithms; genetic operator application probability; inverse problem; parallel processing; parametric L-systems; parametric Lindenmayer systems; populations; rewriting rules; turtle graphics system; Computer languages; Computer science; Electronic mail; Fractals; Genetic algorithms; Graphics; Informatics; Inverse problems; Morphology; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 1999 IEEE Canadian Conference on
Conference_Location
Edmonton, Alberta, Canada
ISSN
0840-7789
Print_ISBN
0-7803-5579-2
Type
conf
DOI
10.1109/CCECE.1999.804977
Filename
804977
Link To Document