A Smoothly Constrained Kalman Filter

Authors:
Jan De Geeter;Hendrik Van Brussel;Joris De Schutter;Marc Decréton
Affiliations:
-;-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1997

Citing 0
Cited 8

Shape Reconstruction Incorporating Multiple Nonlinear Geometric Constraints

Constraints
A physically-based motion retargeting filter

ACM Transactions on Graphics (TOG)
Hand Motion Prediction for Distributed Virtual Environments

IEEE Transactions on Visualization and Computer Graphics
Classification-based wheel slip detection and detector fusion for mobile robots on outdoor terrain

Autonomous Robots
Dynamic estimation of linear systems constrained by bounds

IEEE Transactions on Signal Processing
Set-membership fuzzy filtering for nonlinear discrete-time systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Impact of Landmark Parametrization on Monocular EKF-SLAM with Points and Lines

International Journal of Computer Vision
Letters: Set-membership state estimation with nonlinear equality constraints and quantization

Neurocomputing

Quantified Score

Hi-index	0.15

Visualization

Abstract

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.