A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
classification
🧮 math.OC
keywords
linearreachableapproachapproximatingcontrolinfinitestablestrictly
read the original abstract
We develop a new numerical method for approximating the infinite time reachable set of strictly stable linear control systems. By solving a linear program with a constraint that incorporates the system dynamics, we compute a polytope with fixed facet normals as an outer approximation of the limit set. In particular, this approach does not rely on forward iteration of finite-time reachable sets.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.