Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Hybrid Adaptive Unscented Kalman Filter Algorithm

Version 1 : Received: 15 March 2017 / Approved: 17 March 2017 / Online: 17 March 2017 (01:49:42 CET)

How to cite: He, J.; Zhang, Q.; Hu, Q.; Sun, G. A Hybrid Adaptive Unscented Kalman Filter Algorithm. Preprints 2017, 2017030127. https://doi.org/10.20944/preprints201703.0127.v1 He, J.; Zhang, Q.; Hu, Q.; Sun, G. A Hybrid Adaptive Unscented Kalman Filter Algorithm. Preprints 2017, 2017030127. https://doi.org/10.20944/preprints201703.0127.v1

Abstract

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

Keywords

hybrid adaptive; unscented kalman filtering; maximum a posteriori; maximum likelihood criterion

Subject

Engineering, Control and Systems Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.