An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization

被引:39
作者
Bell, Bradley M. [1 ]
Burke, James V. [2 ]
Pillonetto, Gianluigi [3 ]
机构
[1] Univ Washington, Appl Phys Lab, Seattle, WA 98105 USA
[2] Univ Washington, Dept Math, Appl & Computat Math Sci Program, Seattle, WA 98105 USA
[3] Univ Padua, Dept Informat Engn, Padua, Italy
关键词
Kalman filter; Inequality constrained systems; State estimation; Function estimation; Interior point applications; QUADRATIC-PROGRAMMING METHOD; STATE EQUALITY CONSTRAINTS; DISCRETE-TIME-SYSTEMS; ACTIVE CONSTRAINTS; FILTER; IDENTIFICATION;
D O I
10.1016/j.automatica.2008.05.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Kalman-Bucy smoothers are often used to estimate the state variables as a function of time in a system with stochastic dynamics and measurement noise. This is accomplished using an algorithm for which the number of numerical operations grows linearly with the number of time points. All of the randomness in the model is assumed to be Gaussian, including other available information, for example a bound on one of the state variables, is non trivial because it does not fit into the standard Kalman-Bucy smoother algorithm. In this paper we present an interior point method that maximizes the likelihood with respect to the sequence of state vectors satisfying inequality constraints. The method obtains the same decomposition that is normally obtained for the unconstrained Kalman-Bucy smoother, hence the resulting number of operations grows linearly with the number of time points. We present two algorithms, the first is for the affine case and the second is for the nonlinear case. Neither algorithm requires the optimization to start at a feasible sequence of state vector values. Both the unconstrained affine and unconstrained nonlinear Kalman-Bucy smoother are special cases of the class of problems that can be handled by these algorithms. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:25 / 33
页数:9
相关论文
共 34 条
[1]  
[Anonymous], 1998, Stochastic differential equations
[2]   THE ITERATED KALMAN SMOOTHER AS A GAUSS-NEWTON METHOD [J].
BELL, BM .
SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (03) :626-636
[3]   The marginal likelihood for parameters in a discrete Gauss-Markov process [J].
Bell, BM .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2000, 48 (03) :870-873
[4]  
Boers Y, 2005, IEEE T AERO ELEC SYS, V41, P1481
[5]   A ROBUST SEQUENTIAL QUADRATIC-PROGRAMMING METHOD [J].
BURKE, JV ;
HAN, SP .
MATHEMATICAL PROGRAMMING, 1989, 43 (03) :277-303
[6]   EXPOSING CONSTRAINTS [J].
BURKE, JV ;
MORE, JJ .
SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (03) :573-595
[8]   ON THE IDENTIFICATION OF ACTIVE CONSTRAINTS [J].
BURKE, JV ;
MORE, JJ .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1988, 25 (05) :1197-1211
[9]   Rate-constrained motion estimation using Kalman filter [J].
Chung, Shu-Chiang ;
Kuo, Chung-Ming ;
Shih, Po-Yi .
JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2006, 17 (04) :929-946
[10]   A parametric programming approach to moving-horizon state estimation [J].
Darby, Mark L. ;
Nikolaou, Michael .
AUTOMATICA, 2007, 43 (05) :885-891