Critical factors in the performance of novelty search

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 965-972

  Kistemaker, Steijn ^a   Whiteson, Shimon ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Evolutionary computation; Neural networks; Neuroevolution; Novelty search; Problem of deception

Indexed keywords

CRITICAL FACTORS; FITNESS FUNCTIONS; GLOBALOPTIMUM; NEUROEVOLUTION; NOVELTY SEARCH; PROBLEM OF DECEPTION; SEARCH PROCESS;

CALCULATIONS; HEALTH; NEURAL NETWORKS;

BEHAVIORAL RESEARCH;

EID: 84860417454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001708     Document Type: Conference Paper

References (22)

1. P. Darwen and X. Yao. Every niching method has its niche: Fitness sharing and implicit sharing compared. In PPSN IV, volume 1141, pages 398-407, 1996. (Pubitemid 126128328)
2. K. A. De Jong. An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor, 1975.
3. F. Gomez and R. Mikkulainen. Incremental evolution of complex general behavior. In Adaptive Behavior, volume 5, pages 317-342. MIT Press, 1997.
4. F. J. Gomez. Sustaining diversity using behavioral information distance. In GECCO-09, pages 113-120, 2009.
5. G. R. Harik. Finding multimodal solutions using restricted tournament selection. In ICGA-95, pages 24-31, 1995.
6. J. Lehman and K. O. Stanley. Exploiting open-endedness to solve problems through the search for novelty. In ALIFE-XI, 2008.
7. J. Lehman and K. O. Stanley. Abandoning objectives evolution through the search for novelty alone. In Evolutionary Computation. 2010.
8. J. Lehman and K. O. Stanley. Efficiently evolving programs through the search for novelty. In GECCO-10, pages 837-844, 2010.
9. J. Lehman and K. O. Stanley. Revising the evolutionary computation abstraction: minimal criteria novelty search. In GECCO -10, pages 103-110, 2010.
10. M. Lynch. The frailty of adaptive hypotheses for the origins of organismal complexity. Proceedings of the National Academy of Sciences, 104(Suppl 1):8597-8604, 2007. (Pubitemid 47175452)
11. S. W. Mahfoud. Niching methods for genetic algorithms. PhD thesis, University of Illinois, Urbana-Champaign, 1995.
12. T. Miconi. Evolution and complexity: the double-edged sword. Artificial life, 14(3):325-344, 2008.
13. J.-B. Mouret and S. Doncieux. Overcoming the bootstrap problem in evolutionary robotics using behavioral diversity. In CEC-09, pages 1161-1168, 2009.
14. A. Petrowski. A clearing procedure as a niching method for genetic algorithms. In IEEE IECC, pages 798-803, 1996.
15. S. Risi, C. Hughes, and K. Stanley. Evolving plastic neural networks with novelty search. Adaptive Behavior, 2010.
16. S. Risi, S. D. Vanderbleek, C. Hughes, and K. O. Stanley. How novelty search escapes the deceptive trap of learning to learn. In GECCO-09, pages 153-160, 2009.
17. B. Sareni and L. Krahenbuhl. Fitness sharing and niching methods revisited. Evolutionary Computation, IEEE Transactions on, 2(3):97-106, 1998. (Pubitemid 128748407)
18. K. O. Stanley and R. Miikkulainen. Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2):99-127, 2002.
19. E. Uchibe, M. Yanase, and M. Asada. Behavior generation for a mobile robot based on the adaptive fitness function. Robotics and Autonomous Systems, 40:69-77(9), 2002.
20. J. Urzelai, D. Floreano, M. Dorigo, and M. Colombetti. Incremental robot shaping. Connection Science, 10:341-360(20), 1998. (Pubitemid 128449752)
21. D. L. Whitley. Fundamental principles of deception in genetic search. In Foundations of Genetic Algorithms, pages 221-241. Morgan Kaufmann, 1991.
22. A. P. Wieland. Evolving neural network controllers for unstable systems. In IJCNN-91, pages 667-673, 1991.