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.
Preview
Unable to display preview. Download preview PDF.
Reference
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.
Koza, J.: Evolution of subsumption using genetic programming, Proc. of the First European Conference on Artificial Life (ECAL 91), MIT Press, 1991.
Koza, J.: Genetic Programming, On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.
Koza, J.: Scaleable Learning in Genetic Programming using Automatic Function Definition: in Genetic Programming, K. E. Kinnear, Jr., Ed. Cambridge, MA: MIT Press.
Koza, J.: Genetic Programming II: Automatic Discovery of Reusable Subprograms, MIT Press, 1994.
Justinian P. Rosca. and Dana H. Ballard.: Hierarchical Self-Organization in Genetic Programming, Machine Learning, Proc. 11th International Conference, p251–258, 1994.
Author information
Authors and Affiliations
Editor information
Rights 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