DocumentCode
3401121
Title
Evolutionary control of Lsystem interpretation
Author
Ashlock, Dan ; Bryden, Kenneth M.
Author_Institution
Dept. of Math., Iowa State Univ., Ames, IA, USA
Volume
2
fYear
2004
fDate
19-23 June 2004
Firstpage
2273
Abstract
An Lsystem or Lindenmayer system consists of a grammar and an interpreter. The grammar contains an axiom, usually a short string that the grammar expands into a long, complex string. The interpreter then renders the string into an object. The first use of Lsystems was to provide morphological models of plants. In this exploratory initial study, we use an evolutionary algorithm to evolve interpreters for Lsystems. The interpreter is a graphics turtle. For a given L-system the evolutionary algorithm tunes the turtle´s parameter to cause it to drive in a constrained area of the Cartesian plane. Multiple Lsystems and planar regions are given. In some cases a startlingly small number of optima are located indicating a relatively simple fitness landscape.
Keywords
evolutionary computation; grammars; Cartesian plane; Lindenmayer system; Lsystem interpretation; evolutionary algorithm; evolutionary control; fitness landscape; grammar; graphics turtle; interpreter; long complex string; multiple Lsystems; planar regions; plant morphological models; short string; turtle parameter; Character generation; Engineering drawings; Evolutionary computation; Graphics; Mathematics; Mechanical engineering; Rendering (computer graphics); Topology; Turning; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2004. CEC2004. Congress on
Print_ISBN
0-7803-8515-2
Type
conf
DOI
10.1109/CEC.2004.1331180
Filename
1331180
Link To Document