Information-dependent switching of identification criteria in a genetic programming system for system identification

1Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

You may have access to this PDF.

Abstract

Genetic Programming (GP) can be used to identify the nonlinear differential equations of dynamical systems. If, however, the fitness function is chosen in a classical way, the optimization will not work very well. In this article, we explain the reasons for the failure of the GP approach and present a solution strategy for improving performance. Using more than one identification criterion (fitness function) and switching based on the information content of the data enable standard GP algorithms to find better solutions in shorter times. A computational example illustrates that identification criteria switching has a bigger influence on the results than the choice of the GP parameters has. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Buchsbaum, T., & Vössner, S. (2006). Information-dependent switching of identification criteria in a genetic programming system for system identification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3905 LNCS, pp. 300–309). https://doi.org/10.1007/11729976_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free