Skip to main content

Discovering Several Robot Behaviors through Speciation

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4974))

Included in the following conference series:

Abstract

This contribution studies speciation from the standpoint of evolutionary robotics (ER). A common approach to ER is to design a robot’s control system using neuro-evolution during training. An extension to this methodology is presented here, where speciation is incorporated to the evolution process in order to obtain a varied set of solutions for a robotics problem using a single algorithmic run. Although speciation is common in evolutionary computation, it has been less explored in behavior-based robotics. When employed, speciation usually relies on a distance measure that allows different individuals to be compared. The distance measure is normally computed in objective or phenotypic space. However, the speciation process presented here is intended to produce several distinct robot behaviors; hence, speciation is sought in behavioral space. Thence, individual neurocontrollers are described using behavior signatures, which represent the traversed path of the robot within the training environment and are encoded using a character string. With this representation, behavior signatures are compared using the normalized Levenshtein distance metric (N-GLD). Results indicate that speciation in behavioral space does indeed allow the ER system to obtain several navigation strategies for a common experimental setup. This is illustrated by comparing the best individual from each species with those obtained using the Neuro-Evolution of Augmenting Topologies (NEAT) method which speciates neural networks in topological space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nolfi, S., Floreano, D.: Evolutionary Robotics: The Biology, Intelligence, and Technology of Self-Organizing Machines. Bradford Book (2004)

    Google Scholar 

  2. Brooks, R.A.: A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation 2(1), 14–23 (1986)

    Google Scholar 

  3. Brooks, R.A.: Intelligence without representation. Artif. Intell. 47(1-3), 139–159 (1991)

    Article  Google Scholar 

  4. Yao, X.: Evolving artificial neural networks. PIEEE: Proceedings of the IEEE 87(9), 1423–1447 (1999)

    Article  Google Scholar 

  5. Yujian, L., Bo, L.: A normalized levenshtein distance metric. IEEE Trans. Pattern Analysis and Machine Intelligence 29(6), 1091–1095 (2007)

    Article  Google Scholar 

  6. Stanley, K.O., Miikkulainen, R.: Evolving neural networks through augmenting topologies. Evolutionary Computation 10(2), 99–127 (2002)

    Article  Google Scholar 

  7. Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the Second International Conference on Genetic Algorithms and their application, pp. 41–49. Lawrence Erlbaum Associates, Inc, Mahwah (1987)

    Google Scholar 

  8. Moriarty, D.E., Mikkulainen, R.: Efficient reinforcement learning through symbiotic evolution. Machine Learning 22(1-3), 11–32 (1996)

    Article  Google Scholar 

  9. Dunn, E., Olague, G., Lutton, E.: Parisian camera placement for vision metrology. Pattern Recogn. Lett. 27(11), 1209–1219 (2006)

    Article  Google Scholar 

  10. Darwen, P.J., Yao, X.: Speciation as automatic categorical modularization. IEEE Trans. Evolutionary Computation 1(2), 101–108 (1997)

    Article  Google Scholar 

  11. Hocaoǧlu, C., Sanderson, A.C.: Planning multiple paths with evolutionary speciation. IEEE Trans. Evolutionary Computation 5(3), 169–191 (2001)

    Article  Google Scholar 

  12. Montana, D.J., Davis, L.: Training feedforward neural networks using genetic algorithms. In: Sridharan, S. (ed.) Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 762–767. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  13. Michel, O.: Khepera Simulator v2 User Manual, University of Nice-Sophia, Antipolis (1996)

    Google Scholar 

  14. Miglino, O., Lund, H.H., Nolfi, S.: Evolving mobile robots in simulated and real environments. Artificial Life 2(4), 417–434 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mario Giacobini Anthony Brabazon Stefano Cagnoni Gianni A. Di Caro Rolf Drechsler Anikó Ekárt Anna Isabel Esparcia-Alcázar Muddassar Farooq Andreas Fink Jon McCormack Michael O’Neill Juan Romero Franz Rothlauf Giovanni Squillero A. Şima Uyar Shengxiang Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trujillo, L., Olague, G., Lutton, E., Fernández de Vega, F. (2008). Discovering Several Robot Behaviors through Speciation. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78761-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78760-0

  • Online ISBN: 978-3-540-78761-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics