Multiple Quadrature Kalman Filtering
Por:
Closas, P, Fernandez-Prades, C, Vila-Valls, J
Publicada:
1 dic 2012
Resumen:
Bayesian filtering is a statistical approach that naturally appears in many signal processing problems. Ranging from Kalman filter to particle filters, there is a plethora of alternatives depending on model assumptions. With the exception of very few tractable cases, one has to resort to suboptimal methods due to the inability to analytically compute the Bayesian recursion in general dynamical systems. This is why it has attracted the attention of many researchers in order to develop efficient algorithms to implement it. We focus our interest into a recently developed algorithm known as the Quadrature Kalman filter (QKF). Under the Gaussian assumption, the QKF can tackle arbitrary nonlinearities by resorting to the Gauss-Hermite quadrature rules. However, its complexity increases exponentially with the state-space dimension. In this paper we study a complexity reduction technique for the QKF based on the partitioning of the state-space, referred to as the Multiple QKF. We prove that partitioning schemes can effectively be used to reduce the curse of dimensionality in the QKF. Simulation results are also provided to show that a nearly-optimal performance can be attained, while drastically reducing the computational complexity with respect to state-of-the-art algorithms that are able to deal with such nonlinear filtering problems.
Filiaciones:
Closas, P:
Ctr Tecnol Telecomunicac Catalunya CTTC, Barcelona 08860, Spain
Fernandez-Prades, C:
Ctr Tecnol Telecomunicac Catalunya CTTC, Barcelona 08860, Spain
Vila-Valls, J:
Univ Politecn Cataluna, ES-08034 Barcelona, Spain
Green Accepted
|