Exact recursive updating of uncertainty sets

Abstract

This paper addresses the classical problem of determining the set of possible states of a linear discrete-time system subject to bounded disturbances from measurements corrupted by bounded noise. These so-called uncertainty sets evolve with time as new measurements become available. We present two theorems which describe completely how they evolve with time, and this yields an efficient algorithm for recursively updating uncertainty sets. Numerical simulations demonstrate performance improvements over existing exact methods.

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…