Abstract
Efficient algorithms exist for the square-root probabilistic data association filter (PDAF). The same approach is extended to develop square-root versions of the interacting multiple model (IMM) Kalman filter and the IMMPDAF algorithms. The computational efficiency of the method stems from the fact that the terms needed in the overall covariance updates of PDAF, IMM, and IMMPDAF can be obtained as part of the square-root covariance update of an ordinary Kalman filter. In addition, a new square-root covariance prediction algorithm that is substantially faster than the usual modified weighted Gram-Schmidt (MWG-S) algorithm, whenever the process noise covariance matrix is time invariant, is proposed. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Aerospace and Electronic Systems
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.