Abstract: |
Genetic Programming, or GP, has traditionally used prefix trees for representa-tion and reproduction, with implicit flow control. The different clauses (the evaluation condition, the if and else sections, etc.) are all subtrees of the flow-control node. Linear and stack-based representations, however, require explicit nodes to define the extent of the control structures. This paper introduces a stack-based technique for correct control structure creation and crossover, and discusses its implementation issues in linear and stack-based GP. A set of flow-control nodes is presented, and examples given for evolving an artificial ant on the Santa Fe and Los Altos Trails, with and without looping constructs. |