Incorporating Learning Probabilistic Context-Sensitive Grammar in Genetic Programming for Efficient Evolution and Adaptation of Snakebot

  • Ivan Tanev
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3447)

Abstract

In this work we propose an approach of incorporating learning probabilistic context-sensitive grammar (LPCSG) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of simulated snake-like robot (Snakebot). In our approach LPCSG is derived from the originally defined context-free grammar, which usually expresses the syntax of genetic programs in canonical GP. During the especially introduced steered mutation the probabilities of applying each of particular production rules with multiple right-hand side alternatives in LPCSG depend on the context, and these probabilities are learned from the aggregated reward values obtained from the evolved best-of-generation Snakebots. Empirically obtained results verify that employing LPCSG contributes to the improvement of computational effort of both (i) the evolution of the fastest possible locomotion gaits for various fitness conditions and (ii) adaptation of these locomotion gaits to challenging environment and degraded mechanical abilities of Snakebot. In all of the cases considered in this study, the locomotion gaits, evolved and adapted employing GP with LPCSG feature higher velocity and are obtained faster than with canonical GP.

Keywords

Snakebot adaptation locomotion genetic programming grammar 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angeline, P.J.: Genetic Programming and Emergent Intelligence. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 75–98. MIT Press, Cambridge (1994)Google Scholar
  2. 2.
    Caporale, L.H.: Darwin In the Genome: Molecular Strategies in Biological Evolution. McGraw-Hill/Contemporary Books (2002)Google Scholar
  3. 3.
    Dowling, K.: Limbless Locomotion: Learning to Crawl with a Snake Robot, doctoral dissertation, tech. report CMU-RI-TR-97-48, Robotics Institute, Carnegie Mellon University (1997)Google Scholar
  4. 4.
    Hirose, S.: Biologically Inspired Robots: Snake-like Locomotors and Manipulators. Oxford University Press, Oxford (1993)Google Scholar
  5. 5.
    Kimura, H., Yamashita, T., Kobayashi, S.: Reinforcement Learning of Walking Behavior for a Four-Legged Robot. In: 40th IEEE Conference on Decision and Control, pp. 411–416 (2001)Google Scholar
  6. 6.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)MATHGoogle Scholar
  7. 7.
    Mahdavi, S., Bentley, P.J.: Evolving Motion of Robots with Muscles. In: Proc. of EvoROB2003, the 2nd European Workshop on Evolutionary Robotics, EuroGP 2003, pp. 655–664 (2003)Google Scholar
  8. 8.
    O’Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language. Series: Genetic Programming, vol. 4. Springer, Heidelberg (2003)MATHGoogle Scholar
  9. 9.
    Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: The Bayesian optimization algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999) vol. I, pp. 525–532 (1999)Google Scholar
  10. 10.
    Salustowicz, R., Schmidhuber, J.: Probabilistic incremental program evolution. Evolutionary Computation 5(2), 123–141 (1997)CrossRefGoogle Scholar
  11. 11.
    Smith, R.: Open Dynamics Engine (2001-2003), http://q12.org/ode/
  12. 12.
    Stoy, K., Shen, W.-M., Will, P.M.: A simple approach to the control of locomotion in self-reconfigurable robots. Robotics and Autonomous Systems 44(3), 191–200 (2003)CrossRefGoogle Scholar
  13. 13.
    Takamura, S., Hornby, G.S., Yamamoto, T., Yokono, J., Fujita, M.: Evolution of Dynamic Gaits for a Robot. In: IEEE International Conference on Consumer Electronics, pp. 192–193 (2000)Google Scholar
  14. 14.
    Zhang, Y., Yim, M.H., Eldershaw, C., Duff, D.G., Roufas, K.D.: Phase automata: a programming model of locomotion gaits for scalable chain-type modular robots. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003), Las Vegas, NV, October 27 - 31, 2003, pp. 2442–2447 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ivan Tanev
    • 1
    • 2
  1. 1.Department of Information Systems DesignDoshisha UniversityKyotoJapan
  2. 2.ATR Network Informatics LaboratoriesKyotoJapan

Personalised recommendations