2012 IEEE International Conference on Robotics and Automation 2012
DOI: 10.1109/icra.2012.6224840
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive nonparametric particle filter for state estimation

Abstract: Particle filter is one of the most widely applied stochastic sampling tools for state estimation problems in practice. However, the proposal distribution in the traditional particle filter is the transition probability based on state equation, which would heavily affect estimation performance in that the samples are blindly drawn without considering the current observation information. Additionally, the fixed particle number in the typical particle filter would lead to wasteful computation, especially when the… 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

2015
2015
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Generalized filtering techniques (such as Kalman filters, and Particle filters) have long been applied to robot arms which have only partially observable state. For instance, recent works have tracked the state of flexible robot arms using inertial sensors on the end effector [1] and from motor voltage inputs alone using a learned dynamic model and particle filter [29].…”
Section: Related Workmentioning
confidence: 99%
“…Generalized filtering techniques (such as Kalman filters, and Particle filters) have long been applied to robot arms which have only partially observable state. For instance, recent works have tracked the state of flexible robot arms using inertial sensors on the end effector [1] and from motor voltage inputs alone using a learned dynamic model and particle filter [29].…”
Section: Related Workmentioning
confidence: 99%
“…However, the challenge in the selection of proposal distribution is to find an appropriate covariance matrix for the random walk. In general, it is difficult to design such a proposal since it produces the variance of likelihood distribution, which is usually relatively small, and this leads to the inaccurate approximation of the target distribution [ 36 ]. Moreover, in the majority of cases, nonlinearity or non-Gaussianity makes an analytic solution intractable [ 37 ].…”
Section: Non-gaussian Delayed Particle Smoothing Methods and Computmentioning
confidence: 99%
“…One way of reducing the degeneracy phenomenon is to use very large sample size. However, a very large sample size with a xed number of particles results in approximation with low computational eciency, especially when the true posterior changes over time [Wang & Chaib-draa 2012]. Several methods have been introduced to prevent the degeneracy problem [Arnaud Doucet 2001], [Robert & Casella 2005].…”
Section: 8mentioning
confidence: 99%