2016
DOI: 10.1002/asjc.1394
|View full text |Cite
|
Sign up to set email alerts
|

Particle Smoother for Nonlinear Systems With One‐Step Randomly Delayed Measurements

Abstract: In this paper, a new particle smoother based on forward filtering backward simulation is developed to solve the nonlinear and non‐Gaussian smoothing problem when measurements are randomly delayed by one sampling time. The heart of the proposed particle smoother is computation of delayed posterior filtering density based on stochastic sampling approach, whose particles and corresponding weights are updated in Bayesian estimation framework by considering the one‐step randomly delayed measurement model. The super… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 16 publications
(53 reference statements)
0
3
0
Order By: Relevance
“…The same group of authors extended the random delay in measurements from single step to two steps [21]. Yu‐Long and Yong‐Gang [22] proposed particle smoother for estimation of states with randomly delayed measurements. Later, in 2013, Wang et al [23] presented a general algorithm of nonlinear estimation based on Gaussian approximation of probability density function (PDF) with 1‐RD measurements and subsequently presented CKF with random delay [23].…”
Section: Introductionmentioning
confidence: 99%
“…The same group of authors extended the random delay in measurements from single step to two steps [21]. Yu‐Long and Yong‐Gang [22] proposed particle smoother for estimation of states with randomly delayed measurements. Later, in 2013, Wang et al [23] presented a general algorithm of nonlinear estimation based on Gaussian approximation of probability density function (PDF) with 1‐RD measurements and subsequently presented CKF with random delay [23].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, although the sequential importance sample PF uses 500 particles, its performance is not as good as the CKF. Although the PF can be improved by increasing the number of particles or using some advanced techniques [26,27], the computational complexity will significantly increase. The PF was not studied further, because it is out of the scope of this study.…”
Section: Bearings-only Trackingmentioning
confidence: 99%
“…In this section, the NCKF was compared with the CKF, SCKF and PF in a manoeuvring target tracking application; this has been used as a benchmark problem to evaluate the performance of CKF algorithm [11,15]. The dynamic equation of the target tracking can be modelled as follows: þ n kÀ1 (27) where ξ k and _ ξ k are the position and velocity in Xdirection, respectively; & k and _ & k are the position and velocity in Ydirection, respectively; Dtrepresents the sampling interval; c k represents the unknown turn rate; v kÀ1 is the white Gaussian noise with zero mean and covariance Q kÀ1:…”
Section: Manoeuvring Target Trackingmentioning
confidence: 99%