DMCA
IEEE CEC Evolving Recursive Programs using Non-recursive Scaffolding
BibTeX
@MISC{Moraglio_ieeecec,
author = {Alberto Moraglio and O E. B. Otero and Colin G. Johnson and Simon Thompson and Alex A. Freitas},
title = {IEEE CEC Evolving Recursive Programs using Non-recursive Scaffolding},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—Genetic programming has proven capable of evolving solutions to a wide variety of problems. However, the successes have largely been with programs without iteration or recursion; evolving recursive programs has turned out to be particularly challenging. The main obstacle to evolving recursive programs seems to be that they are particularly fragile to the application of search operators: a small change in a correct recursive program generally produces a completely wrong program. In this paper, we present a simple and general method that allows us to pass back and forth from a recursive program to an associated nonrecursive program. Finding a recursive program can be reduced to evolving non-recursive programs followed by converting the optimum non-recursive program found to the associated optimum recursive program. This avoids the fragility problem above, as evolution does not search the space of recursive programs. We present promising experimental results on a test-bed of recursive problems. I.
Keyphrases
recursive program ieee cec evolving recursive program non-recursive scaffolding optimum non-recursive program optimum recursive program small change correct recursive program recursive problem non-recursive program abstract genetic programming general method main obstacle wide variety fragility problem wrong program search operator experimental result associated nonrecursive program
