2009Unpublished venueRequires access

Online System Identification Based on Quantum-Behaved Particle Swarm Optimization Algorithm

Xiaoping Su, Ji Zhao, Jun Sun

Open publisher page 3 citations

Abstract

In this paper, we explore the applicability of quantum-behaved particle swarm optimization (QPSO) algorithm, an efficient variant of particle swarm optimization (PSO) algorithm, to online system identification problems. First, quantum particle swarm optimization and particle swarm optimization are introduced. Then these two algorithms and genetic algorithms are applied to online identify parameters of a system described by differential equations respectively. Finally simulation results show that QPSO algorithm and PSO algorithm greatly accelerate the online identification. Convergence speed and accuracy of QPSO and PSO are far better than that of GA algorithm. Moreover the accuracy and convergence speed of QPSO is better than PSO.

About this research paper

What this paper is about

In this paper, we explore the applicability of quantum-behaved particle swarm optimization (QPSO) algorithm, an efficient variant of particle swarm optimization (PSO) algorithm, to online system identification problems. First, quantum particle swarm optimization and particle swarm optimization are introduced. Then these two algorithms and genetic algorithms are applied to online identify parameters of a system described by differential equations respectively. Finally simulation results show that QPSO algorithm and PSO algorithm greatly accelerate the online identification. Convergence speed and accuracy of QPSO and PSO are far better than that of GA algorithm. Moreover the accuracy and convergence speed of QPSO is better than PSO.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we explore the applicability of quantum-behaved particle swarm optimization (QPSO) algorithm, an efficient variant of particle swarm optimization (PSO) algorithm, to online system identification problems. First, quantum particle swarm optimization and particle swarm optimization are introduced. Then these two algorithms and genetic algorithms are applied to online identify parameters of a system described by differential equations respectively. Finally simulation results show that QPSO algorithm and PSO algorithm greatly accelerate the online identification. Convergence speed and accuracy of QPSO and PSO are far better than that of GA algorithm. Moreover the accuracy and convergence speed of QPSO is better than PSO.

Key concepts: Particle swarm optimization, Multi-swarm optimization, Convergence (economics), Meta-optimization, Identification (biology), Algorithm, Mathematical optimization, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Online System Identification Based on Quantum-Behaved Particle Swarm Optimization Algorithm — Research Paper | ScholarLens