Genetic algorithms with sharing for multimodal function optimization
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Niching methods for genetic algorithms
Niching methods for genetic algorithms
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
Searching for diverse, cooperative populations with genetic algorithms
Evolutionary Computation
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Measuring and Optimizing Behavioral Complexity for Evolutionary Reinforcement Learning
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Sustaining behavioral diversity in NEAT
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Towards an understanding of locality in genetic programming
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A fine-grained view of GP locality with binary decision diagrams as ant phenotypes
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Open-ended evolutionary robotics: an information theoretic approach
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Abandoning objectives: Evolution through the search for novelty alone
Evolutionary Computation
Why and how to measure exploration in behavioral space
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Critical factors in the performance of novelty search
Proceedings of the 13th annual conference on Genetic and evolutionary computation
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Defining locality as a problem difficulty measure in genetic programming
Genetic Programming and Evolvable Machines
Encouraging behavioral diversity in evolutionary robotics: An empirical study
Evolutionary Computation
Novelty-Based fitness: an evaluation under the santa fe trail
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Effective diversity maintenance in deceptive domains
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Generic behaviour similarity measures for evolutionary swarm robotics
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A true finite-state baseline for tartarus
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An effective parse tree representation for tartarus
Proceedings of the 15th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Conventional similarity metrics used to sustain diversity in evolving populations are not well suited to sequential decision tasks. Genotypes and phenotypic structure are poor predictors of how solutions will actually behave in the environment. In this paper, we propose measuring similarity directly on the behavioral trajectories of evolving candidate policies using a universal similarity measure based on algorithmic information theory: normalized compression distance (NCD). NCD is compared to four other similarity measures in both genotype and phenotype space on the POMDP Tartarus problem, and shown to produce the most fit, general, and complex solutions.