Fast Particle Filters for Multi-Rate Sensors
2007 (English)Report (Other academic)
Computational complexity is a major concern for practical use of the versatile particle filter (PF) for nonlinear filtering applications. Previous work to mitigate the inherent complexity includes the marginalized particle filter (MPF), with the fastSLAM algorithm as one important case. MPF utilizes a linear Gaussian sub-structure in the problem, where the Kalman filter (KF) can be applied. While this reduces the state dimension in the PF, the present work aims at reducing the sampling rate of the PF. The algorithm is derived for a class of models with linear Gaussian dynamic model and two multirate sensors, with different sampling rates, one slow with a nonlinear and/or non-Gaussian measurement relation and one fast with a linear Gaussian measurement relation. For this case, the KF is used to process the information from the fast sensor and the information from the slow sensor is processed using the PF. The problem formulation covers the important special case of fast dynamics and one slow sensor, which appears in many navigation and tracking problems.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2007. , 7 p.
LiTH-ISY-R, ISSN 1400-3902 ; 2821
Nonlinear filters, Particle filter, Kalman filter, Multi-rate sensors
IdentifiersURN: urn:nbn:se:liu:diva-56142ISRN: LiTH-ISY-R-2821OAI: oai:DiVA.org:liu-56142DiVA: diva2:316959