2016
DOI: 10.1016/j.cnsns.2015.05.021
|View full text |Cite|
|
Sign up to set email alerts
|

Classifying the weights of particle filters in nonlinear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 21 publications
(21 reference statements)
0
2
0
Order By: Relevance
“…The particle filter solves this problem; in fact, the particle filter has been developed to numerically implement the Bayesian state estimator. This filter estimates signals by sampling, these samples are called particles [32][33][34]. The sampling process is performed on the system's dynamic equation, and the samples are weighted using the measurement equation, then based on these samples and their weights, the optimal estimate of the stochastic signal is obtained.…”
Section: Standard Particle Filtermentioning
confidence: 99%
See 1 more Smart Citation
“…The particle filter solves this problem; in fact, the particle filter has been developed to numerically implement the Bayesian state estimator. This filter estimates signals by sampling, these samples are called particles [32][33][34]. The sampling process is performed on the system's dynamic equation, and the samples are weighted using the measurement equation, then based on these samples and their weights, the optimal estimate of the stochastic signal is obtained.…”
Section: Standard Particle Filtermentioning
confidence: 99%
“…The PDF of the process noise (ω) and the measurement noise (υ) are not necessarily Gaussian, and just knowing the distribution is enough and the type of distribution is not important. With these assumptions, the particle filter algorithm estimates the states of the system as follows [33,34]. In these steps, note that p(..) means the probability distribution function, not the probability value.…”
Section: Standard Particle Filtermentioning
confidence: 99%
“…Scholars have made efforts to improve the PF algorithm by eliminating the effect of the sample impoverishment. In [22], the study attempts to overcome sample impoverishment by classifying the particles based on their weights. A clustering approach is utilized to implement the particles conversion.…”
Section: B Aga-pf Algorithmmentioning
confidence: 99%
“…Resampling aims to prevent the propagated particles' degeneracy by altering the random measure X t to X t and enhancing the state space examination at t + 1. While addressing degeneracy during resampling, it is also important for the random measure to approximate the original distribution as precisely as possible so that bias in the estimates can be prevented [40][41][42][43]. Although the X t approximation closely resembles that of X t , the set of X t particles have important variations from that of X t .…”
Section: Resamplingmentioning
confidence: 99%