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

Authors:
Thomas Buchsbaum;Siegfried Vössner
Affiliations:
Department of Engineering and Business Informatics, Graz University of Technology, Graz, Austria;Department of Engineering and Business Informatics, Graz University of Technology, Graz, Austria
Venue:
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Year:
2006

Citing 4
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Applied system identification

Applied system identification
System identification (2nd ed.): theory for the user

System identification (2nd ed.): theory for the user
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation

Quantified Score

Hi-index	0.00

Visualization

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.