CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1997 vol.19 Issue No.10 - October
Issue No.10 - October (1997 vol.19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.625129
<p><b>Abstract</b>—This paper presents the Smoothly Constrained Kalman Filter (SCKF) for nonlinear constraints. A constraint is any relation that exists between the state variables. Constraints can be treated as perfect observations. But, linearization errors can prevent the estimate from converging to the true value. Therefore, the SCKF iteratively applies nonlinear constraints as nearly perfect observations, or, equivalently, weakened constraints. Integration of new measurements is interlaced with these iterations, which reduces linearization errors and, hence, improves convergence compared to other iterative methods. The weakening is achieved by artificially increasing the variance of the nonlinear constraint. The paper explains how to choose the weakening values, and when to start and stop the iterative application of the constraint.</p>
Smoothly constrained Kalman filter, nonlinear constraint, perfect observation, linearization error, recursive estimation.
Jan De Geeter, Hendrik Van Brussel, Joris De Schutter, Marc Decréton, "A Smoothly Constrained Kalman Filter", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.19, no. 10, pp. 1171-1177, October 1997, doi:10.1109/34.625129