Back to Search
Start Over
LMI Framework for Set Reachability Inclusion in Discrete-Time LTI Systems.
- Source :
-
IEEE Transactions on Automatic Control . Jun2022, Vol. 67 Issue 6, p2997-3004. 8p. - Publication Year :
- 2022
-
Abstract
- In this article, we present a convex optimization framework to verify the reachability of a desired set for discrete-time linear time-invariant systems. Given elliptically bounded inputs, the set of reachable states in $N$ time steps is the Minkowski sum of a finite number of ellipsoids. We formulate the inclusion verification problem as a chain of constraints in the form of linear matrix inequalities. As the time horizon grows, the number of constraints becomes unwieldy, and we present a technique to achieve a similar level of accuracy with far fewer terms, significantly reducing the computational cost of the method. Numerical examples presented in this article show that the method is highly adaptable. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189286
- Volume :
- 67
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Automatic Control
- Publication Type :
- Periodical
- Accession number :
- 157192224
- Full Text :
- https://doi.org/10.1109/TAC.2021.3091412