Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems

DOI10.1109/TAC.2006.887900zbMath1366.93039OpenAlexW1975630497MaRDI QIDQ5282007

Alex A. Kurzhanskiy, Pravin P. Varaiya

Publication date: 27 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2006.887900

Mathematics Subject Classification ID

Related Items (30)

Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs ⋮ Verification of Hybrid Systems ⋮ State fusion with unknown correlation: ellipsoidal intersection ⋮ Functional sets with typed symbols: Mixed zonotopes and polynotopes for hybrid nonlinear reachability and filtering ⋮ A note on reachable set bounding for delayed systems with polytopic uncertainties ⋮ Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming ⋮ Set-membership filtering with incomplete observations ⋮ Computational techniques for reachability analysis of Max-Plus-Linear systems ⋮ Reachable set estimation and synthesis of discrete‐time switched systems ⋮ Set-membership state and parameter estimation for discrete time-varying systems based on the constrained zonotope ⋮ Compositional abstraction refinement for control synthesis ⋮ Nonlinear set membership filter with state estimation constraints via consensus-ADMM ⋮ Real-time reachable set estimation for linear time-delay systems based on zonotopes ⋮ Robustness analysis of uncertain time‐varying systems with unknown initial conditions ⋮ Construction of the time-optimal bounded control for linear discrete-time systems based on the method of superellipsoidal approximation ⋮ A new method of reachable set estimation for time delay systems with polytopic uncertainties ⋮ Reachability analysis using dissipation inequalities for uncertain nonlinear systems ⋮ Formal verification and quantitative metrics of MPSoC data dynamics ⋮ Complexity reduction through a Schur-based decomposition for reachability analysis of linear time-invariant systems ⋮ Parabolic set simulation for reachability analysis of linear time-invariant systems with integral quadratic constraint ⋮ Computing reachable states for nonlinear biological models ⋮ Lagrangian approximations for stochastic reachability of a target tube ⋮ Reach set computation and control synthesis for discrete-time dynamical systems with disturbances ⋮ Reachability analysis of linear systems using support functions ⋮ Exact Sampling of a Linear Interval Predictor ⋮ On stochastic linear systems with zonotopic support sets ⋮ A non-ellipsoidal reachable set estimation for uncertain neural networks with time-varying delay ⋮ A distributed Kalman filter with symbolic zonotopes and unique symbols provider for robust state estimation in CPS ⋮ Theory and computational techniques for analysis of discrete-time control systems with disturbances ⋮ Set operations and order reductions for constrained zonotopes

This page was built for publication: Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems