Skip to main content
SpringerLink
Log in

Robust GP in robot learning

  • Applications of Evolutionary Computation Evolutionary Computation in Machine Learning, Neural Networks, and Fuzzy Systems
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN IV (PPSN 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1141))

Included in the following conference series:

Abstract

This paper presents a new approach to Genetic Programming (i.e. GP). Our goal is to realize robustness by means of the automatic discovery of functions. In traditional GP, techniques have been proposed which attempt to discover certain subroutines for the sake of improved efficiency. So far, however, the robustness of GP has not yet been discussed in terms of knowledge acquisition. We propose an approach for robustness named COAST, which has a library for storing certain subroutines for reuse. We make use of the Wall Following Problem to illustrate the efficiency of this method.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Kinnear, K.: Alternatives in Automatic Function Definition: A Comparison of Performance in Advances in Genetic Programming, K. E. Kinnear, Jr., Ed. Cambridge, MA: MIT Press.

    Google Scholar 

  2. Koza, J.: Evolution of subsumption using genetic programming, Proc. of the First European Conference on Artificial Life (ECAL 91), MIT Press, 1991.

    Google Scholar 

  3. Koza, J.: Genetic Programming, On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.

    Google Scholar 

  4. Koza, J.: Scaleable Learning in Genetic Programming using Automatic Function Definition: in Genetic Programming, K. E. Kinnear, Jr., Ed. Cambridge, MA: MIT Press.

    Google Scholar 

  5. Koza, J.: Genetic Programming II: Automatic Discovery of Reusable Subprograms, MIT Press, 1994.

    Google Scholar 

  6. Justinian P. Rosca. and Dana H. Ballard.: Hierarchical Self-Organization in Genetic Programming, Machine Learning, Proc. 11th International Conference, p251–258, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Complex Systems Engineering, Division of Systems and Information Engineering, Hokkaido University, N-13 W-8, Sapporo, 060, Hokkaido, Japan

    Naohiro Hondo & Yukinori Kakazu

  2. Machine Inference Section, Electrotechnical Lab., 1-1-4 Umezono, Tukuba Science City, 305, Ibaraki, Japan

    Hitoshi Iba

Authors
  1. Naohiro Hondo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hitoshi Iba
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yukinori Kakazu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Michael Voigt Werner Ebeling Ingo Rechenberg Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hondo, N., Iba, H., Kakazu, Y. (1996). Robust GP in robot learning. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_1038

Download citation

  • DOI: https://doi.org/10.1007/3-540-61723-X_1038

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61723-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation