Skip to main content
SpringerLink
Log in

Incremental evolution of fast moving and sensing simulated snake-like robot with multiobjective GP and strongly-typed crossover

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

In genetic programming (GP), most often the search space grows in a greater than linear fashion as the number of tasks required to be accomplished increases. This is a cause for one of the greatest problems in evolutionary computation; scalability. The aim of the work presented here is to facilitate the evolution of complex designs that have multiple features. We use a combination of mechanisms specifically designed to facilitate the fast evolution of systems with multiple objectives. These mechanisms are; a genetic transposition inspired seeding, a strongly-typed crossover, and a multiobjective optimization. We demonstrate that, when used together, these mechanisms not only improve the performance of GP but also the reliability of the final designs. We investigate the effect of the aforementioned mechanisms, the main focus being on genetic transposition inspired seeding and strongly typed crossover, on the efficiency of GP employed for the coevolution of locomotion gaits and sensing of a simulated snake-like robot (Snakebot). Experimental results show that the mechanism set forth contribute to significant increase in the efficiency of the evolution of fast moving and sensing Snakebots as well as the robustness of the final designs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beaudoin W, Verel S, Collard P, Escazu C (2006) Deceptiveness and Neutrality: the ND family of fitness landscapes. In: GECCO 2006: proceedings of the 2006 conference on genetic and evolutionary computation

  2. Bird J, Layzell P (2002) The evolved radio and its implications for modelling the evolution of novel sensors. In: Proceedings of the evolutionary computation on 2002. CEC ’02. Proceedings of the 2002 Congress, vol 02, CEC ’02. IEEE Computer Society, Washington, DC, pp 1836–1841

  3. Bleuler S, Brack M, Thiele L, Zitzler E (2001) Multiobjective genetic programming: reducing bloat using spea2. In: Proceedings of the 2001 Congress on evolutionary computation, 2001, vol 1, pp 536–543

  4. Chan T, Man K, Tang K, Kwong S (2008) A jumping gene paradigm for evolutionary multiobjective optimization. IEEE Trans Evol Comput 12: 143–159

    Article  Google Scholar 

  5. Deb K, Pratap A, Agarwal S, mEYARIVAN T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2): 182–197

    Article  Google Scholar 

  6. Doerr B, Gnewuch M, Hebbinghaus N, Neumann F (2007) IEEE Congress on a rigorous view on neutrality evolutionary computation, 2007. CEC 2007, pp 2591–2597

  7. Dowling K (1999) Limbless locomotion: learning to crawl. In: 1999 IEEE international conference on robotics and automation, 1999. Proceedings, vol 4, pp 3001–3006

  8. Hirose S (1993) Biologically inspired robots: snake-like locomotors and manipulators. Oxford University Press, Oxford

    Google Scholar 

  9. Huynen MA, Stadler PF, ontana WF (1996) Smoothness within ruggedness: the role of neutrality in adaptation. In: Proceedings of the National Academy of Sciences of the United States of America, vol 93, pp 397–401

  10. Koza JR (1994) Genetic programming II: automatic discovery of reusable programs. MIT Press, Cambridge

    MATH  Google Scholar 

  11. Koza JR, Keane MA, Yu J, Bennett FH, Mydlowec W (2000) Automatic creation of human-competitive programs and controllers by means of genetic programming. Genet Programm Evolvable Mach 1:121–164. doi:10.1023/A:1010076532029

  12. Koza JR (2003) Genetic programming IV: routine human-competitive machine intelligence. Kluver Academic Publishers, MA

    MATH  Google Scholar 

  13. Kuyucu T, Trefzer M, Greensted A, Miller J, Tyrrell A Fitness functions for the unconstrained evolution of digital circuits. In: 9th IEEE Congress on evolutionary computation (CEC08), Hong Kong, June 2008, pp 2589–2596

  14. Langdon WB, Nordin P (2000) Seeding genetic programming populations. In: Proceedings of the European conference on genetic programming. Springer, London, pp 304–315

  15. Liu R, Sheng Z, Jiao L (2009) Gene transposon based clonal selection algorithm for clustering. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, pp 1251–1258

  16. Lobo J, Miller JH, Fontana W (2004) Neutrality in technological landscapes. Santa Fe working paper

  17. Galvn-Lpez Edgar, Poli Riccardo, Kattan Ahmed, ONeill Michael, Brabazon Anthony (2011) Neutrality in evolutionary algorithms what do we know?. Evol Syst 2: 145–163

    Article  Google Scholar 

  18. McClintock B (1950) The origin and behaviour of mutable loci in maize. Proc Natl Acad Sci USA 36: 344–355

    Article  Google Scholar 

  19. McConaghy T, Vladislavleva E, Riolo R (2010) Genetic programming theory and practice 2010: an introduction. In: Genetic programming theory and practice VIII. Springer, Berlin, pp vii–xviii

  20. McGregor S, Harvey I (2005) Embracing plagiarism: Theoretical, biological and empirical justification for copy operators in genetic optimisation. Genet Programm Evolvable Machines 6: 407–420

    Article  Google Scholar 

  21. Montana DJ (1995) Strongly typed genetic programming. Evol Comput 3(2): 199–230

    Article  Google Scholar 

  22. Morowitz HJ (2002) The emergence of everything: how the world became complex. Oxford University Press, Oxford

    Google Scholar 

  23. Nolfi S, Floreano D, Miglino O, Mondada F (1994) How to evolve autonomous robots: different approaches in evolutionary robotics. In: 4th international workshop on artificial life. MIT Press, MA

  24. Nowacki M, Higgins BP, Maquilan GM, Swart EC, Doak TG, Landweber LF (2009) A functional role for transposases in a large eukaryotic genome. Science 324(5929): 935–938

    Article  Google Scholar 

  25. Perry J The effect of population enrichment in genetic programming. In: Proceedings of the first IEEE conference on evolutionary computation, 1994. IEEE World Congress on computational intelligence, June 1994, vol 1, pp 456–461

  26. Shichel Y, Sipper M (2011) Gp-rars: evolving controllers for the robot auto racing simulator. Memetic Comput 3: 89–99. doi:10.1007/s12293-011-0056-9

    Article  Google Scholar 

  27. Simes A, Costa E (2000) Using genetic algorithms with asexual transposition. In: Proceedings of the genetic and evolutionary computation conference GECCO’00, Morgan Kaufmann, San Fransisco, pp 323–330

  28. Simoes A, Costa E, Simes A, Costa E (1999) Transposition: a biologically inspired mechanism to use with genetic algorithms. In: Proceedings of the fourth international conference on neural networks and genetic algorithms (ICANNGA’99). Springer, Berlin, pp 612–619

  29. Smith R (2004) Open dynamics engine. Morikita Publishing Co., Tokyo

    Google Scholar 

  30. Spirov AV, Kazansky AB, Zamdborg L, Merelo JJ, Levchenko VF (2009) Forced evolution in silico by artificial transposons and their genetic operators: the john muir ant problem. Technical report. ArXiv:0910.5542. (Comments: 33 pages)

  31. Strand DJ, McDonald JF (1985) Copia is transcriptionally responsive to environmental stress. Nucl Acids Res 13(12): 4401–4410

    Article  Google Scholar 

  32. Tanev Ivan T (2004) Dom/xml-based portable genetic representation of the morphology, behavior and communication abilities of evolvable agents. Artif Life Robot 8: 52–56. doi:10.1007/s10015-004-0288-6

    Article  Google Scholar 

  33. Tanev I, Ray T, Buller A (2005) Automated evolutionary design, robustness and adaptation of sidewinding locomotion of simulated snake-like robot. IEEE Trans Robot 21: 632–645

    Article  Google Scholar 

  34. Tanev I, Shimohara K (2008) Co-evolution of active sensing and locomotion gaits of simulated snake-like robot. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation GECCO ’08. ACM, New York, pp 257–264

  35. Thomsen R, Fogel G, Krink T (2002) A clustal alignment improver using evolutionary algorithms. In: Proceedings of the 2002 Congress on evolutionary computation, 2002. CEC ’02, May 2002, vol 1, pp 121 –126

  36. Uvarov B (1977) Grasshoppers and locusts, vol 2. Lap Lambert Academic Publishing, Saarbrücken

    Google Scholar 

  37. Vassilev VK, Job D, Miller JF (2000) Towards the automatic design of more efficient digital circuits. In: EH ’00: proceedings of the 2nd NASA/DoD workshop on evolvable hardware. IEEE Computer Society, Washington, p 151

  38. Wilke CO, Wang JL, Ofria C, Lenski RE, Adami C (2001) Evolution of digital organisms at high mutation rates leads to survival of the flattest. Nature 412: 331–333

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Systems Design, Doshisha University, Kyotanabe, Japan

    Tüze Kuyucu, Ivan Tanev & Katsunori Shimohara

Authors
  1. Tüze Kuyucu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Tanev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katsunori Shimohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tüze Kuyucu.

Additional information

This work is part of a project funded by Japan Society for the Promotion of Science (JSPS).

Electronic Supplementary Material

The Below is the Electronic Supplementary Material.

ESM 1 (PDF 1,112kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuyucu, T., Tanev, I. & Shimohara, K. Incremental evolution of fast moving and sensing simulated snake-like robot with multiobjective GP and strongly-typed crossover. Memetic Comp. 4, 183–200 (2012). https://doi.org/10.1007/s12293-012-0085-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-012-0085-z

Keywords

Search

Navigation