A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Learned mutation strategies in genetic programming for evolution and adaptation of simulated snakebot
2005
Proceedings of the 2005 conference on Genetic and evolutionary computation - GECCO '05
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of simulated snake-like robot (Snakebot). In our approach the LMS are implemented via learned probabilistic context-sensitive grammar (LPCSG). The LPCSG is derived from the originally defined context-free grammar, which usually expresses the syntax of genetic programs in canonical GP. Applying LMS implies that the
doi:10.1145/1068009.1068125
dblp:conf/gecco/Tanev05
fatcat:lbqkbrxqnrfmdlc2644jbwx4xi