Identification of nonlinear systems using particle swarm optimization technique

被引:35
作者
Panda, G. [1 ]
Mohanty, D. [1 ]
Majhi, Babita [1 ]
Sahoo, G. [2 ]
机构
[1] Natl Inst Technol, Dept Elect & Commun Engn, Rourkela 769008, India
[2] BIT, Dept CS & E, Ranchi, Bihar, India
来源
2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS | 2007年
关键词
D O I
10.1109/CEC.2007.4424889
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
System identification in noisy environment has been a matter of concern for researchers in many disciplines of science and engineering. In the recent past the Least Mean Square Algorithm (LMS), Genetic Algorithm (GA) etc. have been employed for developing a parallel model. During training by LMS algorithm the weights rattle around and does not converge to optimal solution. This gives rise to poor performance of the model. Although GA always ensures the convergence of the weights to the global optimum but it suffers from slower convergence rate. To alleviate the problem we propose a novel Particle Swarm Optimization (PSO) technique for identifying nonlinear systems. The PSO is also a population based derivative free optimization technique like GA, and hence ascertains the convergence of the model parameters to the global optimum, there by yielding the same performance as provided by GA but with a faster speed. Comprehensive computer simulations validate that the PSO based identification is a better candidate even under noisy condition both in terms of convergence speed as well as number of input samples used.
引用
收藏
页码:3253 / +
页数:2
相关论文
共 9 条
[1]  
[Anonymous], 1994, NEURAL NETWORKS
[2]  
BROUWN GG, 1994, IEEE INT C CONTR 21, V1
[3]  
CHEN JR, 1991, IEE C NEUR NETW SYST
[4]  
Eberhart RC., 2001, SWARM INTELL-US
[5]  
GE HW, 2005, P INT C COMM CIRC SY, V2
[6]  
Kara T., 2002, P 4 GAP ENG C JUN 06, P520
[7]  
Kumon T., 2000, 26 ANN C IEEE IND EL, V4, P2485
[8]  
WHITE MS, 1997, CHAPTER EVOLUTIONARY
[9]  
WIDROW B, 1985, ADAPTIVE SIGNAL PROC, P22