Representation and evolution of Lego-based assemblies

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

@InProceedings{peysakhov:2000:RL,

• author = "Maxim Peysakhov",
• title = "Representation and evolution of {Lego-based} assemblies",
• booktitle = "Graduate Student Workshop",
• year = "2000",
• editor = "Conor Ryan and Una-May O'Reilly and William B. Langdon",
• pages = "297--300",
• address = "Las Vegas, Nevada, USA",
• month = "8 " # jul,
• keywords = "genetic algorithms, genetic programming",
• URL = "http://citeseer.ist.psu.edu/cache/papers/cs/22115/http:zSzzSzedge.mcs.drexel.eduzSzGICLzSzpaperszSzPDFszSzGeccoStudentWorkshop.pdf/representation-and-evolution-of.pdf",
• URL = "http://citeseer.ist.psu.edu/442244.html",
• size = "4 pages",
• abstract = "This research presents an approach to the automatic generation of engineering designs. Our intent is to apply the Messy Genetic Algorithm optimization techniques to the evolution of assemblies composed of the Lego elements. Each design is represented as a labeled assembly graph. Designs are evaluated based on a set of behavior and structural equations, which we are trying to optimize. The initial population is generated at random. The design candidates for subsequent generations are produced by user specified selection technique. Crossovers are applied by using cut and splice operators; random mutations are applied to modify the graph with a certain low probability. This cycle will continue until a suitable design is found. The research contributions in this work include the development of a new GA encoding scheme for mechanical assemblies (Legos).",
• notes = "GECCO-2000WKS Part of \cite{wu:2000:GECCOWKS}",

}

Genetic Programming entries for Maxim Peysakhov

Citations