Complexity Analysis of the Marginalized Particle Filter, Report no. LiTH-ISY-R-2680
نویسندگان
چکیده
In this paper the computational complexity of the marginalized particle filter is analyzed and a general method to perform this analysis is given. The key is the introduction of the equivalent flop measure. In an extensive Monte Carlo simulation different computational aspects are studied and compared with the derived theoretical results.
منابع مشابه
Forgetting in Marginalized Particle Filtering and its Relation to Forward Smoothing, Report no. LiTH-ISY-R-3009
The problem of degeneracy in marginalized particle filtering is addressed. In particular, we note that the degeneracy is caused by loss of entropy of the posterior distribution and design maximum entropy estimates to prevent this. The main technique used in this report is known as forgetting. It is shown that it can be used to suppress the problem with degeneracy, however, it is not a proper cu...
متن کاملThe Marginalized Auxiliary Particle Filter, Report no. LiTH-ISY-R-2934
In this paper we are concerned with nonlinear systems subject to a conditionally linear, Gaussian sub-structure. This structure is often exploited in high-dimensional state estimation problems using the marginalized (aka Rao-Blackwellized) particle lter. The main contribution in the present work is to show how an e cient lter can be derived by exploiting this structure within the auxiliary part...
متن کاملTire Radii and Vehicle Trajectory Estimation Using a Marginalized Particle Filter, Report no. LiTH-ISY-R-3029
Measurements of individual wheel speeds and absolute position from a global navigation satellite system (GNSS) are used for high-precision estimation of vehicle tire radii in this work. The radii deviation from its nominal value is modeled as a Gaussian process and included as noise components in a vehicle model. The novelty lies in a Bayesian approach to estimate online both the state vector o...
متن کاملImplementation of the GIW-PHD filter, Report no. LiTH-ISY-R-3046
This report contains pseudo-code for, and a computational complexity analysis of, the Gaussian inverse Wishart Probability Hypothesis Density lter.
متن کاملFast particle filters for multi-rate sensors, Report no. LiTH-ISY-R-2821
Computational complexity is a major concern for practical use of the versatile particle lter (PF) for nonlinear ltering applications. Previous work to mitigate the inherent complexity includes the marginalized particle lter (MPF), with the fastSLAM algorithm as one important case. MPF utilizes a linear Gaussian sub-structure in the problem, where the Kalman lter (KF) can be applied. While this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005