Parameter estimation for time-varying system based on combinatorial PSO

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

This article is free to access.

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. Copyright © 2006 International Federation for Information Processing.

Cite

CITATION STYLE

APA

Lin, W., & Liu, P. X. (2006). Parameter estimation for time-varying system based on combinatorial PSO. IFIP International Federation for Information Processing, 220, 357–368. https://doi.org/10.1007/978-0-387-36594-7_38

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