Abstract
In this paper, a novel Particle Swarm Optimization (PSO) identification algorithm for time-varying systems with a colored noise is presented. Presented criterion function can show not only outside system output error but also inside parameters error in order to explain more difference between actual and estimative system, identification algorithm may consist of many different PSO algorithms that are named the combinatorial PSO. The estimating and tracking of parameters make use of characteristics of different PSO algorithms. The simulation and result show that the identification algorithm for time-varying systems with noise was indeed more efficient and robust in combinatorial PSO comparing with the original particle swarm optimization.
Chapter PDF
7. References
Feng Ding, Tongwen Chen, “Performance Bounds of Forgetting Factor Least-Squares Algorithms for Time-Varying Systems with Finite Measurement Data”, IEEE Trans. Circuits and Systems, 52(3): 555–566,2005
R. Salomon, “Evolutionary algorithms and gradient search similarities and differences,” IEEE Trans. Evolutionary Computation: 2(2), 45–55, 1998.
Yuncan Xue, Qiwen Yang, Jixin Qian, “Parameter estimation for time-varying system based on improved genetic algorithm”, Proc. the 28 Annual Conference of the IEEE Industrial Electronics Society, Sevilla, Spain: 2007–2010, 2002.
R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory” Proc. 6th Industrial Symp. Micro Machine and Human Science, Nagoya, Japan: 39–43, 1995.
P. N. Suganthan, “Particle swarm optimizer with neighborhood operator,” Proc. Conference Evolutionary computation, Washington, DC: 1958–1961, 1999.
R. C. Eberhart, P. Simpson, and R. Dobbins, Computational Intelligence PC Tools: Academic, ch. 6: 212–226, 1996.
Weixing Lin, Chongguang Jiang, Jixin Qian, “The Identification of Hammerstein Model Based on PSO with Fuzzy Adaptive Inertia Weight”, Journal of Systems Science and Information, 3(2): 381–391,2005.
Y. Shi, R. C. Eberhart, “Empirical Study of particle swarm optimization”, Proc. IEEE International Conference. Evolutionary Computation, 3: 101–106, 1999.
M. Clerc, “The swarm and the queen: toward a deterministic and adaptive particle swarm optimization” Proc. ICEC’99, Washington, DC: 1951–1957, 1999.
D. Corne, M. Dorigo, F. Glover, Eds., New Ideas in 0ptimization. New York: McGraw-Hill, ch. 25: 379–387, 1999.
M. Clerc, J. Kennedy, “The particle swarm: explosion, stability, and convergence in a multidimensional complex space” IEEE Trans. Evolutionary Comnputarion, 6(1): 58–73, 2002.
R. C. Eberhart, Y. Shi, “Comparing inertia weights and constriction factors in particle swarm optimization”, Proc. Conference Evolutionary Computation 2000, San Diego, CA: 84–88, 2000.
J. Kennedy, “Stereotyping: Improving particle swarm performance with cluster analysis” Proc. 2000 Conference Evolutronury Computing: 1507–1512,2000.
J. Kennedy, R. Mendes, “Population structure and particle swarm performance”, Proc. 2002 World Conference Computational Intelligence, Honolulu, HI: 1671–1676,2002.
Jing Ke, Yizheng Qiao, Jixin Qian, “Identification of Time-varying Delay Systems Using Particle Swarm Optimization”, Proc. the 5th World Congress on Intelligent Control and Automation, Hangzhou, P.R. China: 330–334,2004.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Lin, W., Liu, P.X. (2006). Parameter Estimation for Time-Varying System Based on Combinatorial PSO. In: Information Technology For Balanced Manufacturing Systems. BASYS 2006. IFIP International Federation for Information Processing, vol 220. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36594-7_38
Download citation
DOI: https://doi.org/10.1007/978-0-387-36594-7_38
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-36590-9
Online ISBN: 978-0-387-36594-7
eBook Packages: Computer ScienceComputer Science (R0)