Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems
Authors:
Top Cited Papers
- 15 January 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 52 (1) , 26-38
Abstract
This paper describes the computation of reach sets for discrete-time linear control systems with time-varying coefficients and ellipsoidal bounds on the controls and initial conditions. The algorithms construct external and internal ellipsoidal approximations that touch the reach set boundary from outside and from inside. Recurrence relations describe the time evolution of these approximations. An essential part of the paper deals with singular discrete-time linear systemsKeywords
This publication has 9 references indexed in Scilit:
- Modular Algorithms in Symbolic Summation and Symbolic Integration2005
- Multi-Parametric Toolbox (MPT)2004
- Efficient Representation and Computation of Reachable Sets for Hybrid Systems2003
- On Ellipsoidal Techniques for Reachability Analysis. Part I: External ApproximationsOptimization Methods and Software, 2002
- Symbolic Reachability Computation for Families of Linear Vector FieldsJournal of Symbolic Computation, 2001
- Control synthesis via parallelotopes: optimzation and parallel compuationsOptimization Methods and Software, 2001
- Level Set Methods for Computation in Hybrid Systems2000
- How good are convex hull algorithms?Computational Geometry, 1997
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976