Exact recursive updating of uncertainty sets

2016/12/15 by Robin Hill, Hill, Robin, Yousong Luo +3
Decision Sciences · Engineering · #Control Systems and Identification #FOS: Mathematics #Fault Detection and Control Systems #Optimization and Control (math.OC) #Scientific Measurement and Uncertainty Evaluation

paper · pdf · doi:10.48550/arxiv.1612.04918

openalex publication_date 2016/12/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Exact recursive estimation of linear systems subject to bounded disturbances
• Exact recursive updating of uncertainty sets for discrete-time plants with a lag
• High-Confidence Data-Driven Ambiguity Sets for Time-Varying Linear Systems
• Taming Uncertainty in a Complex World: The Rise of Uncertainty Quantification -- A Tutorial for Beginners
• Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis