Estimating the degree of neutrality in fitness landscapes by the Nei's standard genetic distance - An application to evolutionary robotics -

2006 IEEE Congress on Evolutionary Computation, CEC 2006

Volumn , Issue , 2006, Pages 483-490

  Katada, Yoshiaki ^a   Ohkura, Kazuhiro ^b  

^a SETSUNAN UNIVERSITY   (Japan)

^b HIROSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC DISTANCE; GENETIC SEARCH; NEUTRALITY; REAL-WORLD PROBLEMS; RUGGEDNESS;

COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; FEATURE EXTRACTION; PROBLEM SOLVING; ROBOTICS;

GENETIC PROGRAMMING;

EID: 34547272529     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (39)

1. T. Jones and S. Forrest, "Fitness distance correlation, as a measure of problem difficulty for genetic algorithms," Proc. the Sixth International Conference on Genetic Algorithms, Edited by L. Eshelman, San Mateo, California, pp. 184-192, 1995.
2. J. Horn and D. E. Goldberg, "Genetic algorithm difficulty and the modality of fitness landscapes," Foundations of Genetic Algorithms 3, Edited by L. D. Whitley and M. D. Vose, San Francisco, CA: Morgan Kaufmann, pp. 243-269, 1995.
3. L. Kallel, "Inside GA dynamics: ground basis for comparison," Proc. the 4th Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, pp. 57-66, 1998.
4. S. Kauffman, The origins of order, Oxford University Press, 1993.
5. E. D. Weinberger, "Correlated and uncorrelated fitness landscapes and how to tell the difference," Biological Cybernetics, 63, pp. 325-336, 1990.
6. B. Manderick, M. D. Weger and P. Spiessens, "The genetic algorithm and the structure of the fitness landscape," Proc. the Fourth International Conference on Genetic Algorithms, Edited by R. K. Belew and L. B. Booker, San Mateo, California:Morgan Kaufmann, pp. 143-150, 1991.
7. W. Hordijk, "A measure of landscapes," Evolutionary Computation, Vol. 4, No. 4, pp. 335-360, 1994.
8. P. F. Stadler, "Landscapes and their correlation functions," J. Math. Chem, Vol. 20, pp. 1-45, 1996.
9. M. Mitchell, S. Forrest and J. H. Holland, "The royal road for genetic algorithms: fitness landscapes and GA performance," Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, 1991, Edited by F. J. Varela and P. Bourgine, Paris:A Bradford Book, The MIT Press, pp. 245-254, 1992.
10. E. Nimwegen, J. Crutchfield and M. Mitchell, "Statistical dynamics of the royal road genetic algorithm," Theoretical Computer Science, Vol. 229, No. 1, pp. 4.1-102, 1999.
11. I. Harvey, "Artificial evolution for real problems," Evolutionary Robotics: From Intelligent Robots to Artificial Life (ER'97), Edited by T. Gomi, AAI Books, 1997.
12. T. Smith, P. Husbands and M. O'Shea, "Neutral networks in an evolutionary robotics search space," Proc. the 2001 IEEE Congress on Evolutionary Computation, pp. 136-145, 2001.
13. T. Smith, P. Husbands and M. O'Shea, "Neutral networks and evolvability with complex genotype-phenotype mapping," Proc. the European Conference on Artificial Life: ECAL2001, pp. 23-36, 2001.
14. T. Smith, A. Philippides, P. Husbands and M. O'Shea, "Neutrality and ruggedness in robot landscapes," Proc. the the 2002 IEEE Congress on Evolutionary Computation, pp. 136-145, 2002.
15. A. Thompson, "An evolved circuit, intrinsic in silicon, entwined with physics," Proc. the First International Conference on Evolvable Systems: From Biology to Hardware, pp. 390-405, 1996.
16. V. K. Vassilev, T. C. Fogarty and J. F. Miller, "Information characteristics and the structure of landscape," Evolutionary Computation, Vol. 8, No. 1, pp. 31-60, 2000.
17. V. K. Vassilev and J. F. Miller, "The advantages of landscape neutrality in digital circuit evolution," Proc. the Third International Conference on Evolvable Systems: From Biology to Hardware, Edited by J. Miller et al., pp. 252-263, 2000.
18. T. Smith, P. Husbands, P. Layzell and M. O'Shea, "Fitness landscapes and evolvability," Evolutionary Computation, Vol. 10, No. 1, pp. 1-34, 2002.
19. T. Smith, The Evolvability of Artificial Neural Networks for Robot Control, Ph.D. Dissertation, School of Biological Sciences, University of Sussex, 2002.
20. M. Nei, "Genetic distance between populations," The American Naturalist, Vol. 106, pp. 283-292, 1972.
21. Y. Katada, K. Ohkura and K. Ueda, "The Nei's standard genetic distance in artificial evolution," Proc. the 2004 IEEE Congress on Evolutionary Computation (CEC2004), pp. 1233-1239, 2004.
22. M. Kimura, The Neutral Theory of Molecular Evolution, Cambridge University, Press, New York, 1983.
23. T. Ohta, "The nearly neutral theory of molecular evolution," Annu. Rev. Ecol. Syst., 23:263-286, 1992.
24. T. Ohta, "Evolution by nearly-neutral mutations," Genetica, 102/103, pp. 83-90, 1998.
25. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
26. M. Newman and R. Engelhardt, "Effect of neutral selection on the evolution of molecular species," Proc. the Royal Society of London B, Morgan Kaufmann, 256, pp. 1333-1338, 1998.
27. L. Barnett, Tangled Webs: Evolutionary Dynamics on Fitness Land-scapes with Neutrality, School of Cognitive and Computing Sciences, Sussex University, 1997.
28. Y. Katada, K. Ohkura and K. Ueda, "Artificial evolution of pulsed neural networks on the motion pattern classification system," Proc. 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation(CIRA), pp. 318-323, 2003.
29. Y. Katada, K. Ohkura and K. Ueda, "An Approach to Evolutionary Robotics Using a Genetic Algorithm with, a Variable Mutation Rate Strategy," Parallel Problem Solving from Nature (PPSN VIII), pp. 952-961, 2004.
30. R. Beer, "Toward the Evolution of Dynamical Neural Networks for Minimally Cognitive Behavior," Proc. From Animals to Animats 4, Edited by P. Maes, M. Mataric, J. Meyer, J. Pollack, S. Wilson, MIT press: pp. 421-429, 1996.
31. W. Maass and C. M. Bishop, Pulsed Neural Networks, MIT press, 1998.
32. D. Floreano and C. Mattiussi, "Evolution of Spiking Neural Controllers," Evolutionary Robotics: From Intelligent Robots to Artificial Life (ER'01), Edited by T. Gomi, AAI Books, Springer-Verlag, pp. 38-61, 2001.
33. E. Nimwegen and J. Ctrutchfield, "Optimizing Epochal Evolutionary Search: Population-size Dependent Theory," SFI Working Paper 9810-090, Santa Fe Institute, 1998.
34. Y. Katada, K. Ohkura and K. Ueda, "Tuning Genetic Algorithms for Problems Including Neutral Networks -The Simplest Case: The Balance Beam Function-," Proc. the 7th Joint Conference on Information Sciences, pp. 1657-1660, 2003.
35. Y. Katada, K. Ohkura and K. Ueda, "Tuning Genetic Algorithms for Problems Including Neutral Networks -A More Complex Case: The Terraced NK Problem-," Proc. the 7th Joint Conference on Information Sciences, pp. 1661-1664, 2003.
36. K. Ohkura and K. Ueda, "Adaptation in Dynamic Environment by Using GA with Neutral Mutations," International Journal of Smart Engineering System Design, 2, pp. 17-31, 1999.
37. M. Ebner, P. Langguth, J. Albert, M. Shackleton and R. Shipman, "On Neutral Networks and Evolvability," Proc. the 2001 IEEE Congress on Evolutionary Computation: CEC2001, IEEE Press, pp. 1-8, 2001.
38. J. D. Knowles and R. A. Watson, "On the Utility of Redundant Encodings in Mutation-based Evolutionary Search," Edited by J. J. Merelo, P. Admidis, H. -G. Beyer, J.-L. Fernandes-Villacanas, H.-P. Schwefel, Parallel Problem Solving from Nature (PPSN VII), LNCS 2439, pp. 88-98, 2002.
39. F. Rothlauf and D. Goldberg, "Redundant Representations in Evolutionary Computation," Evolutionary Computation, 11(4), pp. 381-415, 2003.