Searcharxiv⌕ Search

arXiv subjects

Chong-Jin Ong

Publications and source records attributed to Chong-Jin Ong.

2 recordsLinked to original sources

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

In this paper, we propose an approach for computing invariant sets of discrete-time nonlinear systems by lifting the nonlinear dynamics into a higher dimensional linear model. In particular, we focus on the \emph{maximal admissible invariant set} contained in some given constraint set. For special types of nonlinear systems, which can be exactly immersed into higher dimensional linear systems with state transformations, invariant sets of the original nonlinear system can be characterized using the higher dimensional linear representation. For general nonlinear systems without the immersibility property, \emph{approximate immersions} are defined in a local region within some tolerance and linear approximations are computed by leveraging the fixed-point iteration technique for invariant sets. Given the bound on the mismatch between the linear approximation and the original system, we provide an invariant inner approximation of the \emph{maximal admissible invariant set} by a tightening procedure.

eess.SY↗

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.

eess.SY↗