Cartesian genetic programming
Authors:
Open Access
- 12 July 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2701-2726
Abstract
Cartesian Genetic Programming is a form of genetic programming. It is increasing in popularity. It was developed by Julian Miller with Peter Thomson in 1997. In its classic form it uses a very simple integer based genetic representation of a program in the form of a directed graph. In a number of studies, it has been shown to be efficient in comparison with other GP techniques. Since then, the classical form of CGP has been enhanced in various ways by including automatically defined functions. Most recently, it has been developed by Julian Miller, Wolfgang Banzhaf and Simon Harding to include self-modification operators. This again has increased its efficiency. The tutorial will cover the basic technique, advanced developments and applications to a variety of problem domains.Keywords
This publication has 23 references indexed in Scilit:
- A new crossover technique for Cartesian genetic programming2007
- Self-modifying cartesian genetic programming2007
- Coevolution of intelligent agents using cartesian genetic programming2007
- Incorporating characteristics of human creativity into an evolutionary art algorithm2007
- Through the Interaction of Neutral and Adaptive Mutations, Evolutionary Search Finds a WayArtificial Life, 2006
- On the Practical Limits of the Evolutionary Digital Filter Design at the Gate LevelLecture Notes in Computer Science, 2006
- Improving the Evolvability of Digital Multipliers Using Embedded Cartesian Genetic Programming and Product ReductionLecture Notes in Computer Science, 2005
- Evolution of Robot Controller Using Cartesian Genetic Programming2005
- A Biological Development Model for the Design of Robust MultiplierLecture Notes in Computer Science, 2005
- Evolving a Self-Repairing, Self-Regulating, French Flag Organism2004