Particle filter with swarm move for optimization

21Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a novel generalized algorithmic framework to utilize particle filter for optimization incorporated with the swarm move method in particle swarm optimization (PSO). In this way, the PSO update equation is treated as the system dynamic in the state space model, while the objective function in optimization problem is designed as the observation/measurement in the state space model. Particle filter method is then applied to track the dynamic movement of the particle swarm and therefore results in a novel stochastic optimization tool, where the ability of PSO in searching the optimal position can be embedded into the particle filter optimization method. Finally, simulation results show that the proposed novel approach has significant improvement in both convergence speed and final fitness in comparison with the PSO algorithm over a set of standard benchmark problems. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ji, C., Zhang, Y., Tong, M., & Yang, S. (2008). Particle filter with swarm move for optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5199 LNCS, pp. 909–918). https://doi.org/10.1007/978-3-540-87700-4_90

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