메뉴 건너뛰기




Volumn 20, Issue 1, 2012, Pages 91-133

Encouraging behavioral diversity in evolutionary robotics: An empirical study

Author keywords

Diversity; Evolutionary robotics; Multi objective evolutionary algorithm; Neural networks

Indexed keywords

BEHAVIORAL DIVERSITY; DIVERSITY; EMPIRICAL STUDIES; EVOLUTIONARY OPTIMIZATIONS; EVOLUTIONARY PROCESS; EVOLUTIONARY ROBOTICS; FITNESS FUNCTIONS; INFINITE NUMBERS; MULTI OBJECTIVE; MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM; PREMATURE CONVERGENCE; ROBOT BEHAVIOR;

EID: 84857509059     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00048     Document Type: Review
Times cited : (245)

References (56)
  • 7
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • Bunke, H., and Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3):255-259.
    • (1998) Pattern Recognition Letters , vol.19 , Issue.3 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 8
    • 84958949201 scopus 로고    scopus 로고
    • Every niching method has its niche: Fitness sharing and implicit sharing compared
    • In,. Berlin: Springer-Verlag
    • Darwen, P., and Yao, X. (1996). Every niching method has its niche: Fitness sharing and implicit sharing compared. In Parallel Problem Solving from Nature, PPSN IV. Lecture Notes in Computer Science, Vol. 1141 (pp. 398-407). Berlin: Springer-Verlag.
    • (1996) Parallel Problem Solving from Nature, PPSN IV. Lecture Notes in Computer Science , vol.1141 , pp. 398-407
    • Darwen, P.1    Yao, X.2
  • 16
    • 0027636611 scopus 로고
    • Learning and development in neural networks: The importance of starting small
    • Elman, J. L. (1993). Learning and development in neural networks: The importance of starting small. Cognition, 48(1):71-99.
    • (1993) Cognition , vol.48 , Issue.1 , pp. 71-99
    • Elman, J.L.1
  • 17
  • 21
    • 0002076808 scopus 로고
    • Simple genetic algorithms and the minimal, deceptive problem
    • In,. San Mateo, CA: Morgan Kaufmann
    • Goldberg, D. E. (1987). Simple genetic algorithms and the minimal, deceptive problem. In Genetic algorithms and simulated annealing (pp. 74-88). San Mateo, CA: Morgan Kaufmann.
    • (1987) Genetic algorithms and simulated annealing , pp. 74-88
    • Goldberg, D.E.1
  • 24
    • 84977058391 scopus 로고
    • Automatic definition of modular neural networks
    • Gruau, F. (1995). Automatic definition of modular neural networks. Adaptive Behaviour, 3(2):151-183.
    • (1995) Adaptive Behaviour , vol.3 , Issue.2 , pp. 151-183
    • Gruau, F.1
  • 27
    • 0036985854 scopus 로고    scopus 로고
    • Creating high-level components with a generative representation for body-brain evolution
    • Hornby, G. S., and Pollack, J. B. (2002). Creating high-level components with a generative representation for body-brain evolution. Artificial Life, 8(3):223-246.
    • (2002) Artificial Life , vol.8 , Issue.3 , pp. 223-246
    • Hornby, G.S.1    Pollack, J.B.2
  • 29
    • 0032165064 scopus 로고    scopus 로고
    • Evolution and development of neural networks controlling locomotion, gradient-following, and obstacle-avoidance in artificial insects
    • Kodjabachian, J., and Meyer, J.-A. (1997). Evolution and development of neural networks controlling locomotion, gradient-following, and obstacle-avoidance in artificial insects. IEEE Transactions on Neural Networks, 9(5):796-812.
    • (1997) IEEE Transactions on Neural Networks , vol.9 , Issue.5 , pp. 796-812
    • Kodjabachian, J.1    Meyer, J.-A.2
  • 30
    • 84874610503 scopus 로고    scopus 로고
    • Exploiting open-endedness to solve problems through the search for novelty
    • Lehman, J., and Stanley, K. O. (2008). Exploiting open-endedness to solve problems through the search for novelty. In Proceedings of Artificial Life XI, pp. 329-336.
    • (2008) Proceedings of Artificial Life XI , pp. 329-336
    • Lehman, J.1    Stanley, K.O.2
  • 31
    • 79957482984 scopus 로고    scopus 로고
    • Abandoning objectives: Evolution through the search for novelty alone
    • Lehman, J., and Stanley, K. O. (2010). Abandoning objectives: Evolution through the search for novelty alone. Evolutionary Computation, 19(2):189-223.
    • (2010) Evolutionary Computation , vol.19 , Issue.2 , pp. 189-223
    • Lehman, J.1    Stanley, K.O.2
  • 32
    • 85133623240 scopus 로고    scopus 로고
    • Evolutionary robotics and open-ended design automation
    • Lipson, H. (2005). Evolutionary robotics and open-ended design automation. Biomimetics, 17(9):129-155.
    • (2005) Biomimetics , vol.17 , Issue.9 , pp. 129-155
    • Lipson, H.1
  • 33
    • 0034739052 scopus 로고    scopus 로고
    • Automatic design andmanufacture of robotic lifeforms
    • Lipson, H., and Pollack, J. (2000). Automatic design andmanufacture of robotic lifeforms. Nature, 406:974-978.
    • (2000) Nature , vol.406 , pp. 974-978
    • Lipson, H.1    Pollack, J.2
  • 34
    • 33745126452 scopus 로고    scopus 로고
    • A fast technique for comparing graph representations with applications to performance evaluation
    • Lopresti, D., and Wilfong, G. (2003). A fast technique for comparing graph representations with applications to performance evaluation. International Journal on Document Analysis and Recognition, 6(4):219-229.
    • (2003) International Journal on Document Analysis and Recognition , vol.6 , Issue.4 , pp. 219-229
    • Lopresti, D.1    Wilfong, G.2
  • 35
    • 33749551684 scopus 로고    scopus 로고
    • Niching methods
    • In T. Back, D. B. Fogel, and Z. Michalewicz (Eds.),. Oxford, UK: Taylor & Francis
    • Mahfoud, S. (1997). Niching methods. In T. Back, D. B. Fogel, and Z. Michalewicz (Eds.), Handbook of evolutionary computation (pp. C6.1:1-C6.1:4). Oxford, UK: Taylor & Francis.
    • (1997) Handbook of evolutionary computation
    • Mahfoud, S.1
  • 41
    • 70449775040 scopus 로고    scopus 로고
    • Overcoming the bootstrap problem in evolutionary robotics using behavioral diversity
    • Mouret, J.-B., and Doncieux, S. (2009a). Overcoming the bootstrap problem in evolutionary robotics using behavioral diversity. In IEEE Congress on Evolutionary Computation (CEC), pp. 1161-1168.
    • (2009) IEEE Congress on Evolutionary Computation (CEC) , pp. 1161-1168
    • Mouret, J.-B.1    Doncieux, S.2
  • 48
    • 0013445810 scopus 로고
    • Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of organic evolution
    • Schwefel, H. P. (1984). Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of organic evolution. Annals of Operations Research, 1(2):165-167.
    • (1984) Annals of Operations Research , vol.1 , Issue.2 , pp. 165-167
    • Schwefel, H.P.1
  • 50
    • 0036594106 scopus 로고    scopus 로고
    • Evolving neural networks through augmenting topologies
    • Stanley, K. O., and Miikkulainen, R. (2002). Evolving neural networks through augmenting topologies. Evolutionary Computation, 10(2):99-127.
    • (2002) Evolutionary Computation , vol.10 , Issue.2 , pp. 99-127
    • Stanley, K.O.1    Miikkulainen, R.2
  • 51
    • 0041376985 scopus 로고    scopus 로고
    • Genetic diversity as an objective in multi-objective evolutionary algorithms
    • Toffolo, A., and Benini, E. (2003). Genetic diversity as an objective in multi-objective evolutionary algorithms. Evolutionary Computation, 11(2):151-167.
    • (2003) Evolutionary Computation , vol.11 , Issue.2 , pp. 151-167
    • Toffolo, A.1    Benini, E.2
  • 54
    • 1642489044 scopus 로고    scopus 로고
    • Evolving controllers for real robots: A survey of the literature
    • Walker, J., Garrett, S., andWilson, M. (2003). Evolving controllers for real robots: A survey of the literature. Adaptive Behavior, 11(3):179-203.
    • (2003) Adaptive Behavior , vol.11 , Issue.3 , pp. 179-203
    • Walker, J.1    Garrett, S.2    Wilson, M.3
  • 56
    • 0000307499 scopus 로고
    • On the editing distance between unordered labeled trees
    • Zhang, K., Statman, R., and Shasha, D. (1992). On the editing distance between unordered labeled trees. Information Processing Letters, 42(3):133-139.
    • (1992) Information Processing Letters , vol.42 , Issue.3 , pp. 133-139
    • Zhang, K.1    Statman, R.2    Shasha, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.