Abstract

Aims: Tuning the system noise covariance Q matrix for the single-frame method aided Kalman filtering algorithm. Background: The covariance matching procedure of the measurement noise covariance, namely the R matrix, was processed in singular value decomposition (SVD), which is one of the single-frame methods. Objective: Develop the R and Q double covariance matching rule for the single-frame method aided Kalman filtering algorithm. Method: The matching procedure of the measurement noise covariance, namely the R matrix, is processed in singular value decomposition (SVD), which is one of the single-frame methods. The second matching rule is defined in the second stage of the proposed EKF design. Result: The matching rules are run simultaneously, which makes the filter capable of being robust against initialization errors, system noise uncertainties, and measurement malfunctions at the same time without an external filter design necessity. Conclusion: A single-frame method aided Kalman filtering algorithm based double covariance matching rule is presented in this paper. First, the measurement noise covariance matching is introduced using the SVD method that processes the R-adaptation inherently for the filtering stage. Second, the system noise covariance matching is described so as to have double covariance matching at the same time during the estimation procedure. The SVD-Aided AEKF becomes R- and Q-adaptive simultaneously by applying the Q-adaptation rule to the intrinsically R-adaptive SVD-aided EKF.

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.