Vector-valued function estimation by grammatical evolution for autonomous robot control

Burbidge, Robert; Wilson, M.

doi:10.1016/j.ins.2013.09.044

Cited by 11 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first of these is the work of Koza (1992), who carried out the first substantial studies of GP across many problem areas and created the canonical tree-based form of GP that is the foundation for many variants of and applications of GP (Montana 1995;O'Neill and Ryan 2001;Ferreira 2001;He et al 2011a, b;Du et al 2014;Alfonseca and Gil 2013;Burbidge and Wilson 2014;Fernandez-Blanco et al 2013;Oltean et al 2009;Howard et al 2011;Harman et al 2012;Langdon and Harman 2015;Mckay et al 2010) even today. The notion of types was introduced into GP by Montana (1995) in the Strongly Typed Genetic Programming (STGP) system.…”

Section: Introductionmentioning

confidence: 99%

“…To overcome these issues and allow the use of a system of types in GP, Montana (1995) allowed the typing terminals and operator arguments in the second phase of the development process of GP, presenting the so-called STGP approach; however, no basic change was made to the program representations when compared to the approach of Koza. Finally, the work by O'Neill and Ryan (2001) on GE aroused a wide range of interest among GP researchers and practitioners (Burbidge and Wilson 2014;Hugosson et al 2010;Oltean et al 2009;RiscoMartin et al 2014;Wilson and Kaur 2009). In fact, compared to other two kinds of GP methods discussed, grammar-related approaches can be best suited to type descriptions and recursive program generations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model approach to grammatical evolution: theory and case study

Deng

Wang

et al. 2015

Soft Comput

View full text Add to dashboard Cite

Many deficiencies with grammatical evolution (GE) such as inconvenience in solution derivations, modularity analysis, and semantic computing can partly be explained from the angle of genotypic representations. In this paper, we deepen some of our previous work in visualizing concept relationships, individual structures and total evolutionary process, contributing new ideas, perspectives, and methods in these aspects; reveal the principle hidden in early work so that to develop a practical methodology; provide formal proofs for issues of concern which will be helpful for understanding of mathematical essence of issues, establishing of Communicated by V. Loia. B Pei He an unified formal framework as well as practical implementation; exploit genotypic modularity like modular discovery systematically which for the lack of supporting mechanism, if not impossible, is done poorly in many existing systems, and finally demonstrate the possible gains through semantic analysis and modular reuse. As shown in this work, the search space and the number of nodes in the parser tree are reduced using concepts from building blocks, and concepts such as the codon-to-grammar mapping and the integer modulo arithmetic used in most existing GE can be abnegated.

show abstract