zbMATH — the first resource for mathematics

State estimation in the presence of bounded disturbances. (English) Zbl 1149.93340
Summary: This contribution proposes a robust recursive algorithm for the state estimation of linear models with unknown but bounded disturbances corrupting both the state and measurement vectors. A novel approach based on state bounding techniques is presented. The proposed algorithm can be decomposed into two steps: time updating and observation updating that uses a switching estimation Kalman-like gain matrix. Particular emphasis will be given to the design of a weighting factor that ensures the stability of the estimation error.

93E10 Estimation and detection in stochastic control theory
93C73 Perturbations in control/observation systems
93E15 Stochastic stability in control theory
93D21 Adaptive or robust stabilization
Full Text: DOI
[1] Bertsekas, D.P.; Rhodes, L.B., Recursive state estimation for a set-membership description of uncertainty, IEEE transactions on automatic control, 16, 117-128, (1971)
[2] Broman, V., & Shenza, J. (1988). A compact algorithm for the intersection and approximation of n-dimensional polytopes. In 12th IMACS world congress
[3] Canudas-De-Wit, C.; Carrillo, J., A modified EW-RLS algorithm for systems with bounded disturbances, Automatica, 26, 3, 599-606, (1990) · Zbl 0713.93053
[4] Chernousko, F.L., Ellipsoidal state estimation for dynamical systems, Nonlinear analysis, 63, 872-879, (2005) · Zbl 1153.93345
[5] Chisci, L.; Garulli, A.; Vicino, A.; Zappa, G., Block recursive parallelotopic bounding in set membership identification, Automatica, 34, 1, 15-22, (1998) · Zbl 0908.93021
[6] Deyst, J.J.; Price, C.F., Conditions for asymptotic stability of the discrete minimum-variance linear estimator, IEEE transactions on automatic control, 702-705, (1968)
[7] Durieu, C.; Walter, E.; Polyak, B., Multi-input multi-output ellipsoidal state bounding, Journal of optimization theory and applications, 111, 2, 273-303, (2001) · Zbl 1080.93656
[8] Fogel, E.; Huang, Y.F., On the value of information in system identification — bounded noise case, Automatica, 18, 2, 229-238, (1982) · Zbl 0433.93062
[9] Jiang, Zhong-Ping; Wang, Yuan, Input-to-state stability for discrete-time nonlinear systems, Automatica, 37, 857-869, (2001) · Zbl 0989.93082
[10] Maksarov, D.; Norton, J.P., State bounding with ellipsoidal set description of the uncertainty, International journal of control, 65, 5, 847-866, (1996) · Zbl 0862.93038
[11] Maksarov, D., & Norton, J. P. (1996b). State bounding with minimal volume ellipsoids. In UKACC international conference on control (pp. 1297-1302)
[12] Milanese, M.; Vicino, A., Optimal estimation theory for dynamic systems with set membership uncertainty: an overview, Automatica, 27, 997-1099, (1991) · Zbl 0737.62088
[13] Mo, S. H., & Norton, J. P. (1988) Recursive parameter-bounding algorithms which compute polytopes bounds. In 12th IMACS world congress
[14] Norton, J., Special issue on bounded-error estimation 1, International journal of adaptive control and signal processing, 8, 1, 1-118, (1994)
[15] Norton, J., Special issue on bounded-error estimation 2, International journal of adaptive control and signal processing, 9, 1, 1-132, (1995)
[16] Schweppe, F.C., Recursive state estimation: unknown but bounded errors and system inputs, IEEE transactions on automatic control, 13, 22-28, (1968)
[17] Schweppe, F.C., Uncertain dynamic systems, (1973), Prentice Hall Englewood Cliffs
[18] Vicino, A.; Milanese, M., Optimal inner bounds of feasible parameter set in linear estimation with bounded noise, IEEE transactions on automatic control, 36, 759-763, (1991)
[19] Witsenhausen, H.S., Set of possible states of linear systems given perturbed observations, IEEE transactions on automatic control, 13, 556-558, (1968)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.