Abstract

The paper suggests a general solution to the square-rooting problem existed for the Unscented Kalman Filter (UKF) since its appearance in the late 1990s. As properly noted in engineering literature, the previously suggested Cholesky-based UKF implementations are, in fact, the ‘pseudo’ square-root versions. Their key feature is the utilization of one-rank Cholesky update procedure required at each filtering step because of the possibly negative sigma points’ weights. In a finite precision arithmetic, the resulting downdated matrix might be not a positive definite matrix. This yields a failure of the UKF estimator in practice. We resolve this problem by suggesting a novel square-root approach based on the J-orthogonal matrix utilization for updating the required Cholesky factors. Additionally, we explain how the MATLAB language with built-in numerical integration schemes developed for solving ordinary differential equations can be easily and effectively used for accurate calculations when implementing the continuous-discrete UKF time update stage.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.