Abstract
This paper concerns the problem of state-set estimation for discrete-time linear systems. The linear system is given in state-space form and the system's uncertainty is described by bounded scalar variations. We present a recursive algorithmic procedure of computing guaranteed estimated state sets. In particular, a polyhedron variation algorithm is presented. The new algorithm is based on linear-programming and sensitivity analysis techniques for improved computational efficiency and practicability.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
