Optimal recursive estimation for discrete-time descriptor systems
- 15 August 2005
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 36 (10) , 605-615
Abstract
In this paper, we revisit the optimal recursive estimation problem for general time-variant descriptor systems. Instead of the standard stochastic formulation, the estimates are derived using deterministic arguments in a completely self-contained way. We show that the filter recursions can be obtained as a solution of appropriate deterministic data-fitting problems. Two data-fitting problems are considered in this paper: the first involves the entire trajectory, and the second is performed taking into account a one-step correction. A numerical example is presented to illustrate the performance of the filtered and predicted estimators.Keywords
This publication has 10 references indexed in Scilit:
- Deterministic least squares filteringJournal of Econometrics, 2004
- Descriptor Kalman estimatorsInternational Journal of Systems Science, 1999
- Kalman filtering for general discrete-time linear systemsIEEE Transactions on Automatic Control, 1999
- Noncausal image modeling using descriptor approachIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1995
- State estimation of stochastic singular linear systemsInternational Journal of Systems Science, 1993
- Kalman filtering and Riccati equations for descriptor systemsIEEE Transactions on Automatic Control, 1992
- Impulsive modes and causality in singular systemsInternational Journal of Control, 1989
- Force and position control of manipulators during constrained motion tasksIEEE Transactions on Robotics and Automation, 1989
- The linear-quadratic optimal regulator for descriptor systems: Discrete-time caseAutomatica, 1987
- Dynamic equations in descriptor formIEEE Transactions on Automatic Control, 1977