This paper describes a Parallel Grammatical Evolution (PGE) that can evolve complete circuits using a variable length of linear genome to govern the mapping of a Backus Naur Form grammar definition. In order to increase the efficiency of Grammatical Evolution (GE) the influence of backward processing and an influence of several fitness functions were tested. PGE with backward processing can als...

Evolutionary Programming (EP) seems a promising methodology to automatically find programs to solve new computing challenges. The Evolutionary Programming techniques use classical genetic operators (selection, crossover and mutation) to automatically generate programs targeted to solve computing problems or specifications. Among the methodologies related with Evolutionary Programming we can fin...

Grammatical Evolution (GE) is a grammar based Evolutionary Algorithm to generate computer programs which has been shown to be competitive with Genetic Programming when applied to a diverse array of problems. GE has the distinction that its input is a BNF, which permits it to generate arbitrarily complex programs in any language, including loops, multiple line functions etc. Part of the power of...

This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.

We present an application of Grammatical Evolution to the exploration of Lindenmayer systems. The resulting L-systems are expressed in the Postscript language, and as such a Postscript grammar was provided as input to the Grammatical Evolution algorithm. The system takes the form of an interactive evolutionary algorithm, with a human-in-theloop acting as the fitness function for the generated L...

This study examines a variable-length Particle Swarm Algorithm for Social Programming. The Grammatical Swarm algorithm is a form of Social Programming as it uses Particle Swarm Optimisation, a social swarm algorithm, for the automatic generation of programs. This study extends earlier work on a fixed-length incarnation of Grammatical Swarm, where each individual particle represents choices of p...

Research in the origins and evolution of language has now reached a level where languages with grammatical structures are emerging in computer simulations and robotic experiments based on situated embodied language games played by populations of agents. This paper focuses on some of the technical AI issues related to this research. Specifically, we report on a system for planning complex meanin...