Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Genetic Programming and Evolvable Machines
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
Resource-limited genetic programming: the dynamic approach
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the constructiveness of context-aware crossover
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Identifying structural mechanisms in standard genetic programming
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
What makes a problem GP-hard? validating a hypothesis of structural causes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Autonomous evolution of dynamic gaits with two quadruped robots
IEEE Transactions on Robotics
Representation and structural difficulty in genetic programming
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
In this paper, we suggest tree-structure-aware GP operators that heed tree distributions in structure space and their possible structural difficulties. The main idea of the proposed GP operators is to place the generated offspring of crossover and/or mutation in a specified region of tree structure space insofar as possible, taking into account the observation that most solutions are found in that region. To enable that, the proposed operators are designed to utilize information about the region to which the parents belong and node/depth statistics of the subtree selected for modification. The proposed approach is applied to automatic gait generation of quadruped robot to demonstrate the effectiveness of it. The results show that the results using the proposed tree-structure-aware operators are superior to the results of standard GP for gait problem in both fitness and velocity.