Premium
A moving horizon‐based approach for least‐squares estimation
Author(s) -
Robertson Douglas G.,
Lee Jay H.,
Rawlings James B.
Publication year - 1996
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.690420811
Subject(s) - extended kalman filter , control theory (sociology) , kalman filter , estimator , nonlinear system , mathematics , nonlinear filter , filter (signal processing) , invariant extended kalman filter , mathematical optimization , least squares function approximation , iterated function , horizon , filtering problem , non linear least squares , estimation theory , algorithm , computer science , filter design , statistics , artificial intelligence , mathematical analysis , physics , control (management) , quantum mechanics , computer vision , geometry
A general formulation of the moving horizon estimator is presented. An algorithm with a fixed‐size estimation window and constraints on states, disturbances, and measurement noise is developed, and a probabilistic interpretation is given. The moving horizon formulation requires only one more tuning parameter (horizon size) than many well‐known approximate nonlinear filters such as extended Kalman filter (EFK), iterated EKF, Gaussian second‐order filter, and statistically linearized filter. The choice of horizon size allows the user to achieve a compromise between the better performance of the batch least‐squares solution and the reduced computational requirements of the approximate nonlinear filters. Specific issues relevant to linear and nonlinear systems are discussed with comparisons made to the Kalman filter, EKF, and other recursive and optimization‐based estimation schemes.