论文信息 - Recursive Set Membership State Estimation via Parallelotopes

Recursive Set Membership State Estimation via Parallelotopes

Abstract In this paper the problem of recursively estimating the uncertainty set of the state of a linear dynamical system is addressed via an optimal bounding parallelotope technique and an algorithm of polynomial complexity is derived. Simulation results and performance comparisons with the ellipsoidic approach are also given.

[1] Y. F. Huang,et al. On the value of information in system identification - Bounded noise case , 1982, Autom..

[2] Sandor M. Veres,et al. Predictive self-tuning control by parameter bounding and worst-case design , 1993, Autom..

[3] D. Bertsekas,et al. Recursive state estimation for a set-membership description of uncertainty , 1971 .

[4] J. R. Deller,et al. Least-square identification with error bounds for real-time signal processing and control , 1993, Proc. IEEE.

[5] V. Broman,et al. Polytopes, a novel approach to tracking , 1986, 1986 25th IEEE Conference on Decision and Control.

[6] E. Walter,et al. Estimation of parameter bounds from bounded-error data: a survey , 1990 .

[7] M. Milanese,et al. Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimators , 1982 .

[8] Antonio Vicino,et al. Adaptive Approximation of Uncertainty Sets for Linear Regression Models , 1993 .

[9] F. Schweppe. Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .