An improved square-root algorithm for RTS Kalman smoothing
2015 IEEE International Conference on Information and Automation, 2015•ieeexplore.ieee.org
This paper improves on a noted square-root RTS Kalman smoothing algorithm proposed by
Park and Kailath for the application purpose. This improved square-root RTS algorithm is
able to additionally accommodate arbitrary exogenous known input, as such case is quite
common in the real-world applications. In addition, hyperbolic Householder transformations
are employed to avoid the computation of the difference of two positive semi-definite
matrices. The Givens rotations based unitary transformations are further used to make the …
Park and Kailath for the application purpose. This improved square-root RTS algorithm is
able to additionally accommodate arbitrary exogenous known input, as such case is quite
common in the real-world applications. In addition, hyperbolic Householder transformations
are employed to avoid the computation of the difference of two positive semi-definite
matrices. The Givens rotations based unitary transformations are further used to make the …
This paper improves on a noted square-root RTS Kalman smoothing algorithm proposed by Park and Kailath for the application purpose. This improved square-root RTS algorithm is able to additionally accommodate arbitrary exogenous known input, as such case is quite common in the real-world applications. In addition, hyperbolic Householder transformations are employed to avoid the computation of the difference of two positive semi-definite matrices. The Givens rotations based unitary transformations are further used to make the resulting algorithm have higher computational efficiency. The relevant implementation steps of this algorithm is also addressed. Finally, a numerical simulation is given to verify this improved algorithm.
ieeexplore.ieee.org
Showing the best result for this search. See all results