Volterra system identification using adaptive genetic algorithms

被引:14
作者
Abbas, HM
Bayoumi, MM
机构
[1] Ain Shams Univ, Fac Engn, Dept Syst & Comp Engn, Cairo 11381, Egypt
[2] Queens Univ, Dept Elect & Comp Engn, Kingston, ON K7L 3N6, Canada
关键词
evolutionary computation; system identification; Volterra systems; polynomial approximation;
D O I
10.1016/j.asoc.2004.05.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper a floating point genetic algorithm (GA) for Volterra system identification is presented. The adaptive GA method suggested here addresses the problem of determining the proper Volterra candidates which leads to the smallest error between the identified nonlinear system and the Volterra model. This is achieved by using variable length GA chromosomes which encode the coefficients of the selected candidates. During the process of evolution the candidates with the least significant contribution in the error reduction process is removed. The proposed GA method detects the proper Volterra candidates and the associated coefficients in one single evolutionary process. The fitness function employed by the algorithm prevents irrelevant candidates from taking part of the final solution. Genetic operators are chosen to suit the floating point representation of the genetic data. As the evolution process improves and the method reaches a near-global solution, a local search is implicitly applied by zooming in the search interval of each gene by adaptively changing the boundaries of those intervals. The proposed algorithms has produced excellent results in modeling different nonlinear systems. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:75 / 86
页数:12
相关论文
共 23 条
[1]   NON-LINEAR ECHO CANCELLATION OF DATA SIGNALS [J].
AGAZZI, O ;
MESSERSCHMITT, DG ;
HODGES, DA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (11) :2421-2433
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
Benedetto S., 1983, IEEE Journal on Selected Areas in Communications, VSAC-1, P57, DOI 10.1109/JSAC.1983.1145885
[4]   ORTHOGONAL LEAST-SQUARES LEARNING ALGORITHM FOR RADIAL BASIS FUNCTION NETWORKS [J].
CHEN, S ;
COWAN, CFN ;
GRANT, PM .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1991, 2 (02) :302-309
[5]  
Duong V, 2002, AEROSP CONF PROC, P2331
[6]   The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations [J].
Harik, George ;
Cantu-Paz, Erick ;
Goldberg, David E. ;
Miller, Brad L. .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :231-253
[7]   Adaptation in evolutionary computation: A survey [J].
Hinterding, R ;
Michalewicz, Z ;
Eiben, AE .
PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, :65-69
[8]  
Joines J. A., 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence (Cat. No.94TH0650-2), P579, DOI 10.1109/ICEC.1994.349995
[9]   Orthogonal approaches to time-series analysis and system identification [J].
Korenberg, Michael J. ;
Paarmann, Larry D. .
IEEE SIGNAL PROCESSING MAGAZINE, 1991, 8 (03) :29-43
[10]   A ROBUST ORTHOGONAL ALGORITHM FOR SYSTEM-IDENTIFICATION AND TIME-SERIES ANALYSIS [J].
KORENBERG, MJ .
BIOLOGICAL CYBERNETICS, 1989, 60 (04) :267-276