Filters








157 Hits in 4.9 sec

Developments in Cartesian Genetic Programming: self-modifying CGP

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2010 Genetic Programming and Evolvable Machines  
Self-modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming.  ...  In addition to the usual computational functions, it includes functions that can modify the program encoded in the genotype.  ...  The technique we discuss is based on Cartesian Genetic Programming (CGP), so we refer to it as self-modifying CGP (SMCGP). The representation used in SMCGP is very flexible.  ... 
doi:10.1007/s10710-010-9114-1 fatcat:kpfuiphf55dzrg5z3udl77zqla

Self modifying Cartesian Genetic Programming: Parity

S. Harding, J. F. Miller, W. Banzhaf
2009 2009 IEEE Congress on Evolutionary Computation  
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program.  ...  Beginning with the evolved genotype the self-modifying functions produce a new program (phenotype) at each iteration.  ...  Self modifying Cartesian Genetic Programming has a number of virtues.  ... 
doi:10.1109/cec.2009.4982960 dblp:conf/cec/HardingMB09 fatcat:kb2npl2sdbeklf5q5435luenre

Self-modifying cartesian genetic programming

Simon L. Harding, Julian F. Miller, Wolfgang Banzhaf
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  The approaches taken have largely used re-writing, multi-cellularity, or genetic regulation. In many cases it has been difficult to produce general purpose computation from such systems.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1145/1276958.1277161 dblp:conf/gecco/HardingMB07 fatcat:6voqfueanna4jelxi3kzyaqfdq

Self modifying cartesian genetic programming

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2010 Proceedings of the 12th annual conference on Genetic and evolutionary computation - GECCO '10  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  The approaches taken have largely used re-writing, multi-cellularity, or genetic regulation. In many cases it has been difficult to produce general purpose computation from such systems.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1145/1830483.1830591 dblp:conf/gecco/HardingMB10 fatcat:36at7ffvlzgircswoukttfz2x4

Self-Modifying Cartesian Genetic Programming [chapter]

Simon L. Harding, Julian F. Miller, Wolfgang Banzhaf
2011 Natural Computing Series  
In this paper we introduce computational development using a form of Cartesian Genetic Programming that includes self-modification operations.  ...  The approaches taken have largely used re-writing, multi-cellularity, or genetic regulation. In many cases it has been difficult to produce general purpose computation from such systems.  ...  SELF-MODIFYING CARTESIAN GENETIC PROGRAMMING (SMCGP) Cartesian Genetic Programming (CGP) Cartesian Genetic Programming was originally developed by Miller and Thomson [14] for the purpose of evolving  ... 
doi:10.1007/978-3-642-17310-3_4 fatcat:ygf6pxpdkvgihelp2tdlls3ica

A Survey of Self Modifying Cartesian Genetic Programming [chapter]

Simon Harding, Wolfgang Banzhaf, Julian F. Miller
2010 Genetic Programming Theory and Practice VIII  
Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming.  ...  In addition to the usual computational functions found in CGP, SMCGP includes functions that can modify the evolved program at run time.  ...  Self Modifying Cartesian Genetic Programming As the name suggests, SMCGP is based on the Cartesian Genetic Programming technique.  ... 
doi:10.1007/978-1-4419-7747-2_6 fatcat:j557uvj5jvfu3d652hljqonqce

Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing [chapter]

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2009 Lecture Notes in Computer Science  
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program.  ...  This is done by the inclusion of modification operators in the function set. Here we present the use of the technique on several different sequence generation and regression problems.  ...  Self Modifying CGP Cartesian Genetic Programming (CGP) Cartesian Genetic Programming represents programs as directed graphs [8] .  ... 
doi:10.1007/978-3-642-01181-8_12 fatcat:rciv6xnqzzbpvbfwjhbpu5done

Editorial to tenth anniversary issue on progress in genetic programming and evolvable machines

Julian F. Miller, Riccardo Poli
2010 Genetic Programming and Evolvable Machines  
Acknowledgments We would like to thank the editor-in-chief, Lee Spector, for suggesting and supporting this special issue.  ...  It is called ''Self-modifying Cartesian Genetic Programming'' (SMCGP).  ...  The final article is a paper on ''Developments in Cartesian Genetic Programming'' by Simon Harding, Wolfgang Banzhaf and Julian Miller.  ... 
doi:10.1007/s10710-010-9115-0 fatcat:bgfdqrboljfbdghj4e4mkwkpee

Cartesian genetic programming: its status and future

Julian Francis Miller
2019 Genetic Programming and Evolvable Machines  
Cartesian genetic programming, a well-established method of genetic programming, is approximately 20 years old. It represents solutions to computational problems as graphs.  ...  In the process, we make many suggestions for further work which could improve the efficiency of the CGP for solving computational problems.  ...  distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creat iveco mmons .org/licen ses/by/4.0/), which permits unrestricted use, distribution, and reproduction in  ... 
doi:10.1007/s10710-019-09360-6 fatcat:vocd7cqshndefkib6nvbhu7gxa

Evolution, development and learning using self-modifying cartesian genetic programming

Simon Harding, Julian F. Miller, Wolfgang Banzhaf
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping.  ...  SELF MODIFYING CGP Cartesian Genetic Programming (CGP) Cartesian Genetic Programming is a graph-based representation of programs [7] .  ...  Previously we proposed a developmental mapping in the context of Cartesian Genetic Programming (CGP) by introducing self-modification (SM) [3] .  ... 
doi:10.1145/1569901.1569998 dblp:conf/gecco/HardingMB09 fatcat:5mnfiq3gwfcmzjvrbtrkehmeoy

Introduction to Evolutionary Computation and Genetic Programming [chapter]

Julian F. Miller
2011 Natural Computing Series  
Holland proposed genetic algorithms and wrote about them in his 1975 book [19] . He emphasized the role of genetic recombination (often called 'crossover').  ...  in a random manner (ensuring small modifications were more frequent than larger ones) proved to be a very effective technique.  ...  Origins of CGP Cartesian genetic programming grew from a method of evolving digital circuits developed by Miller et al. in 1997 [8] .  ... 
doi:10.1007/978-3-642-17310-3_1 fatcat:cvbvsuliwrgmro5ma2x5mim6na

Continuous On-line Evolution of Agent Behaviours with Cartesian Genetic Programming [article]

Davide Nunes, Luis Antunes
2014 arXiv   pre-print
In this paper, we present an on-line evolutionary programming algorithm that searches in the agent design space for the appropriate behavioural policies to cope with the underlying environment.  ...  Evolutionary Computation has been successfully used to synthesise controllers for embodied agents and multi-agent systems in general.  ...  To build our genetic programming controllers, we use representation developed for Cartesian Genetic Programming (CGP) [9] .  ... 
arXiv:1407.0698v1 fatcat:j7ennihu5jdh5mnz5dgxz4v3cy

Advanced techniques for the creation and propagation of modules in cartesian genetic programming

Paul Kaufmann, Marco Platzner
2008 Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO '08  
One of the most popular models is cartesian genetic programming, which encodes an array of logic gates into a chromosome.  ...  Further, we detail a cone-based crossover operator for use with cartesian genetic programming. We evaluate the different techniques and compare them with related work.  ...  Cartesian Genetic Programs A cartesian genetic program (CGP) is a structural hardware model that arranges logic cells in a two-dimensional geometric layout [19, 18] .  ... 
doi:10.1145/1389095.1389334 dblp:conf/gecco/KaufmannP08 fatcat:skvhkuo3gfey5pczyxch46i3hi

Fast learning neural networks using Cartesian genetic programming

Maryam Mahsal Khan, Arbab Masood Ahmad, Gul Muhammad Khan, Julian F. Miller
2013 Neurocomputing  
The method is inspired by the well known and highly effective Cartesian genetic programming (CGP) technique. The proposed method is called the CGP-based Artificial Neural Network (CGPANN).  ...  The basic idea is to replace each computational node in CGP with an artificial neuron, thus producing an artificial neural network.  ...  In this paper, we are using a graph based form of genetic programming called Cartesian genetic programming (CGP) [15] [16] [17] .  ... 
doi:10.1016/j.neucom.2013.04.005 fatcat:h3wlugpqafc2hp2uotapnxax4e

Optimizing Shape Design with Distributed Parallel Genetic Programming on GPUs [chapter]

Simon Harding, W. Banzhaf
2012 Studies in Computational Intelligence  
We present work on optimized shape design using a technique from the area of Genetic Programming, self-modifying Cartesian Genetic Programming (SMCGP), to evolve shapes with specific criteria, such as  ...  Fitness evaluation of the genetic programming technique is accomplished through a custom implementation of a fluid dynamics solver running on graphics processing units (GPUs).  ...  Self-modifying Cartesian Genetic Programming (SMCGP) Self-modifying Cartesian Genetic Programming (SMCGP) is a developmental version of Genetic Programming.  ... 
doi:10.1007/978-3-642-28789-3_3 fatcat:c625ysjdlffe7m4nddrtgsgayu
« Previous Showing results 1 — 15 out of 157 results