On the Computation of \lambda- Contractive Sets for Linear Constrained Systems
From MaRDI portal
Publication:5282401
Abstract: We present two theoretical results on the computation of lambda-contractive sets for linear systems with state and input constraints. First, we show that it is possible to a priori compute a number of iterations that is sufficient to approximate the maximal lambda-contractive set with a given precision using 1-step sets. Second, based on the former result, we provide a procedure for choosing lambda so that the associated maximal lambda-contractive set is guaranteed to approximate the maximal controlled invariant set with a given accuracy.
Recommendations
- Reachable set computation of linear systems with nonconvex constraints via convex optimization
- Computation of contractive polyhedra for discrete-time linear systems with saturating controls
- On the stability of linear systems with an exact constraint set
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints
- On the computation of invariant sets for constrained nonlinear systems: an interval arithmetic approach
- On reachable sets for a class of nonlinear systems with constraints
- Conic S‐procedure and constrained dissipativity for linear systems
- scientific article; zbMATH DE number 3220359
- Stability of the feasible set mapping of linear systems with an exact constraint set
- On Constructing Constrained Control Lyapunov Functions for Linear Systems
Cited in
(2)
This page was built for publication: On the Computation of $\lambda$- Contractive Sets for Linear Constrained Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282401)
