• Corpus ID: 222125112

Computation of invariant sets via immersion for discrete-time nonlinear systems

@article{Wang2020ComputationOI,
  title={Computation of invariant sets via immersion for discrete-time nonlinear systems},
  author={Zheming Wang and Rapha{\"e}l M. Jungers and Chong Jin Ong},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.00974}
}
In this paper, we propose a method for computing invariant sets of discrete-time nonlinear systems with or without additive disturbances by lifting the nonlinear dynamics into a higher dimensional linear model. In particular, we focus on the maximal invariant set contained in some given constraint set. Some special types of nonlinear systems can be immersed into higher dimensional linear systems with state transformations, which allows us to establish linear representations of nonlinear systems… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 52 REFERENCES
Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems
TLDR
This work describes a hierarchy of finite-dimensional linear matrix inequality (LMI) relaxations whose optimal values converge to the volume of the maximum controlled invariant (MCI) set for discrete- as well as continuous-time nonlinear dynamical systems.
A data-driven immersion technique for linearization of discrete-time nonlinear systems
Computation of the maximal invariant set of linear systems with quasi-smooth nonlinear constraints
TLDR
Using the sufficient condition on the maximal invariant set of linear systems with a class of nonlinear constraints that admit quadratic relaxations, a new algorithm is presented by solving a set oflinear matrix inequalities.
Theory and computation of disturbance invariant sets for discrete-time linear systems
This paper considers the characterization and computation of invariant sets for discrete-time, time-invariant, linear systems with disturbance inputs whose values are confined to a specified compact
Convex invariant sets for discrete-time Lur'e systems
Non-local Linearization of Nonlinear Differential Equations via Polyflows
TLDR
It is shown that the proposed approximation scheme has convergence range at least as large as a Taylor approximation while, at the same time, being able to account for asymptotic stability (a nonlocal behavior).
Computation of polytopic invariants for polynomial dynamical systems using linear programming
...
...