Abstract
In this paper a method is presented that decreases the necessary number of evaluations in Evolutionary Algorithms. A classifier with confidence information is evolved to replace time consuming evaluations during tournament selection. Experimental analysis of a mathematical example and the application of the method to the problem of evolving walking patterns for quadruped robots show the potential of the presented approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Banzhaf, P. Nordin, R Keller, and F. Francone. Genetic Programming-An Introduction. dpunkt/Morgan Kaufmann, Heidelberg/San Francisco, 1998.
M. Emmerich, A. Giotis, M. Özdenir, T. Bäck, and K. Giannakoglou. Metamodel-assisted evolution strategies. In J. J. Merelo Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature VII (PPSN), Lecture Notes in Computer Science, pages 361–370. Springer, Berlin, 2002.
M. Giacobini, M. Tomassini, and L. Vanneschi. Limiting the number fitness cases in genetic programming using statistics. In J. J. Merelo et al., editor, Proccedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN), Lecture Notes in Computer Science, LNCS 2439, pages 371–380. Springer Verlag, 2002.
G. S. Hornby, M. Fujita, S. Takamura, T. Yamamoto, and O. Hanagata. Autonomous evolution of gaits with the sony quadruped robot. In W. Banzhaf et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1297–1304. Morgan Kaufmann, 1999.
AIM Learning Inc. Discipulus Owner’s Manual. http://www.aimlearning.com/Technology Overview.htm. WWW-Document.
N. Jakobi, P. Husbands, and I. Harvey. Noise and the reality gap: The use of simulation in evolutionary robotics. In F. Moran et al., editor, Proceedings of the 3rd European Conference on Artificial Life, Lecture Notes in Artificial Intelligence, pages 704–720. Springer New York, Berlin, Heidelberg, 1995.
Y. Jin. Fitness Approximation in Evolutionary Computation-Bibliography. http://www.soft-computing.de/amec.html. WWW-Document.
Y. Jin, M. Olhofer, and B. Sendhoff. A framework for evolutionary optimization with approximate fitness functions. IEEE Transactions on Evolutionary Computation, 6(5):481–494, 2002.
H.-S. Kim and S.-B. Cho. An efficient genetic algorithms with less fitness evaluation by clustering. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 887–894. IEEE Press, 2001.
M. Risler. InvKinWalkingEngine-Kurze Beschreibung der Parameter. Technische Universit ät Darmstadt, GermanTeam 2002, 2002.
K. Sastry, D. E. Goldberg, and M. Pelikan. Don’t evaluate, inherit. In L. Spector et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 551–558. Morgan Kaufmann, 2001.
H. Tagaki. Interactive evolutionary computation: System optimization based on human subjective evaluation. In IEEE International Conference on Intelligent Engineering Systems (INES), pages 1–6. IEEE Press, 1998.
J. Ziegler, J. Barnholt, J. Busch, and W. Banzhaf. Automatic evolution of control programs for a small humanoid walking robot. In P. Bidaud and F. Ben Amar, editors, Proceedings of the 5th International Conference on Climbing and Walking Robots (CLAWAR), pages 109–116. Professional Engineering Publishing, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ziegler, J., Banzhaf, W. (2003). Decreasing the Number of Evaluations in Evolutionary Algorithms by Using a Meta-model of the Fitness Function. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_24
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive