文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Genetic L-system programming breeding and evolving artificial flowers with Mathematica
侵权投诉

Genetic L-system programming breeding and evolving artificial flowers with Mathematica

Parallel rewrite systems in the form of stringbased L-systems are used for modeling and visualizing growth processes of artificial plants. A package implementing context-sensitive (m,n)-L-systems is presented which takes full advantage of Mathematicas expr

entate a drawing tool, known as a turtle, in three-dimensional space (rotate,yaw, pitch), thus translating a one-dimensional string into a 3D-object resemb–ling a plant.

2Genetic L-system programming

Genetic Programming (GP) has been introduced as a method to automaticallydevelop populations of computer programs through simulated evolution [3,4].Considering L-systems as rulebased development programs it is easy to defineprogram evolution. Each program encoded as a symbolic expression has to beinterpreted and is assigned a fitness value dependent on the optimization taskto be solved. On the basis of these fitnesses the individual programs strugglefor survival of the fittest“ and for the chance to become members of the nextgeneration. In order to introduce variations into the program encoding struc-tures genetic operators like mutation or crossover – gleaned from nature´smutating and recombining operators on cell genomes – are applied. The evo-lution process develops new populations of programs from generation togeneration, the interplay of modifying operators and selection hopefully lead–ing to ever better programs.

2.1Encoding L-systems

In order to use expression evolution for L-systems a proper encoding schemehas to be defined which will be done for the more general case of IL-systems(with I referring to the number of context symbols). In context-sensitive IL-systems the rewriting of a letter depends on m of its left and n of its rightneighbors, where m and n are fixed integers. These systems are denoted as(m,n)L-systems which resemble context-sensitive Chomsky grammars, but –as L-system rewriting is parallel in nature – every symbol is rewritten in eachderivation step; this is especially important whenever there is an overlap ofcontext strings. The following L-system representations are used in our IL-system package which is part of MathEvolvica.

Each IL-system rule has the form l < p > r → s with l, p, r and s denoting theleft context, predecessor, right context and successor, respectively. The sym-bols "<" and ">" separate context and predecessor strings. Thus each rule canbe represented by an expression of the form

LRule[ LEFT[ l ], PRED[ p ], RIGHT[ r ], SUCC[ s ] ]. Accordingly, an L-system with its axiom and rule set is encoded by an expres-sion of the form

LSystem[ _AXIOM, LRULES[ __LRule] ]

using Mathematica pattern notation.

IMS´95, First Int. Mathematica Symposium, Southampton, UK, 1995, Computational Mechanics Pub.

上一页第4页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email