Target tracking technology based on improved swarm intelligent particle filter via PauTa criterion migration optimization

Particle filter (PF) has been confirmed to be an effective method for nonlinear non-Gaussian systems. However, it is difficult to calculate the importance density function and particle degradation (particle simplification) is prone to occur. For the importance density function selection problem, an improved echolocation algorithm is used to approximate the optimal importance density function and optimize the particle distribution to make it closer to the high-likelihood region. For the problem of resampling, an improved dolphin swarm optimization algorithm has been developed to replace traditional resampling methods, which enhances the diversity of particles and further optimizes particle distribution, thereby improving the estimation accuracy. From the perspective of probability statistics, it proposes a "PauTa Criterion" optimization strategy suitable for various types of particle filter algorithms. This method migrates particles regarded as "impossible" in probability to optimize the particle distribution directly. Simulation experiments show that the "PauTa Criterion" optimization strategy has a good optimization effect on particle filter-based algorithms. The improved methods for both importance density and resampling exhibit excellent estimation performance, which improves the estimation accuracy of the PF and reduces its dependence on the number of particles.

Authors

Institutions

Publication Details

Published
2025-03-31
DOI
https://doi.org/10.1117/12.3061380
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Target tracking technology based on improved swarm intelligent particle filter via PauTa criterion migration optimization

Die Chen, Xiao Hua Wang
Advanced Algorithms and Applications
article

Target tracking technology based on improved swarm intelligent particle filter via PauTa criterion migration optimization

Die Chen, Xiao Hua Wang
article en

Abstract

Particle filter (PF) has been confirmed to be an effective method for nonlinear non-Gaussian systems. However, it is difficult to calculate the importance density function and particle degradation (particle simplification) is prone to occur. For the importance density function selection problem, an improved echolocation algorithm is used to approximate the optimal importance density function and optimize the particle distribution to make it closer to the high-likelihood region. For the problem of resampling, an improved dolphin swarm optimization algorithm has been developed to replace traditional resampling methods, which enhances the diversity of particles and further optimizes particle distribution, thereby improving the estimation accuracy. From the perspective of probability statistics, it proposes a "PauTa Criterion" optimization strategy suitable for various types of particle filter algorithms. This method migrates particles regarded as "impossible" in probability to optimize the particle distribution directly. Simulation experiments show that the "PauTa Criterion" optimization strategy has a good optimization effect on particle filter-based algorithms. The improved methods for both importance density and resampling exhibit excellent estimation performance, which improves the estimation accuracy of the PF and reduces its dependence on the number of particles.

University of Electronic Science and Technology of China (CN)
Reduced inequalities
Openalex Percentile: Top 94%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.