Exact recursive updating of uncertainty sets for discrete-time plants with a lag
classification
🧮 math.OC
keywords
boundeddiscrete-timemeasurementspolytopicresultssetsalgorithmarrive
read the original abstract
In a recent paper [arXiv:1612.04918] there are new results concerning the polytopic set of possible states of a linear discrete-time SISO system subject to bounded disturbances from measurements corrupted by bounded noise. Using these results we construct an algorithm which, for the special case of a plant with a lag, recursively updates these polytopic sets when new measurements arrive.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.