13 research outputs found
A one-step approach to computing a polytopic robust positively invariant set
A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the solving of a single LP, a polytopic RPI set that is minimal with respect to the family of RPI sets generated from a finite number of inequalities with pre-defined normal vectors
Data-driven computation of invariant sets of discrete time-invariant black-box systems
We consider the problem of computing the maximal invariant set of
discrete-time black-box nonlinear systems without analytic dynamical models.
Under the assumption that the system is asymptotically stable, the maximal
invariant set coincides with the domain of attraction. A data-driven framework
relying on the observation of trajectories is proposed to compute
almost-invariant sets, which are invariant almost everywhere except a small
subset. Based on these observations, scenario optimization problems are
formulated and solved. We show that probabilistic invariance guarantees on the
almost-invariant sets can be established. To get explicit expressions of such
sets, a set identification procedure is designed with a verification step that
provides inner and outer approximations in a probabilistic sense. The proposed
data-driven framework is illustrated by several numerical examples.Comment: A shorter version with the title "Scenario-based set invariance
verification for black-box nonlinear systems" is published in the IEEE
Control Systems Letters (L-CSS
Computation of Robust Control Invariant Sets with Predefined Complexity for Uncertain Systems
This paper presents an algorithm that computes polytopic robust control-invariant (RCI) sets for rationally parameter-dependent systems with additive disturbances. By means of novel LMI feasibility conditions for invariance along with a newly developed method for volume maximization, an iterative algorithm is proposed for the computation of RCI sets with maximized volumes. The obtained RCI sets are symmetric around the origin by construction and have a user-defined level of complexity. Unlike many similar approaches, fixed state feedback structure is not imposed. In fact, a specific control input is obtained from the LMI problem for each extreme point of the RCI set. The outcomes of the proposed algorithm can be used to construct a piecewise-affine controller based on offline computations
Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints
We consider the problem of computing the maximal invariant set of
discrete-time linear systems subject to a class of non-convex constraints that
admit quadratic relaxations. These non-convex constraints include semialgebraic
sets and other smooth constraints with Lipschitz gradient. With these quadratic
relaxations, a sufficient condition for set invariance is derived and it can be
formulated as a set of linear matrix inequalities. Based on the sufficient
condition, a new algorithm is presented with finite-time convergence to the
actual maximal invariant set under mild assumptions. This algorithm can be also
extended to switched linear systems and some special nonlinear systems. The
performance of this algorithm is demonstrated on several numerical examples.Comment: Accepted in Automatic