Exact recursive updating of uncertainty sets for discrete-time plants with a lag

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…