Convex invariant sets for discrete-time Lur'e systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Automatica Année : 2009

Convex invariant sets for discrete-time Lur'e systems

Résumé

In this paper, a method to estimate the domain of attraction of a class of discrete-time Lur'e systems is presented. A new notion of invariance, denoted LNL-invariance, is introduced. An algorithm to determinate the largest LNL-invariant set for this class of systems is proposed. Moreover, it is proven that the LNL-invariant sets provided by this algorithm are polyhedral convex sets and constitute an estimation of the domain of attraction of the non-linear system. It is shown that any contractive set for the Lur'e system is contained in the LNL-invariant set obtained applying the results of this paper. Two illustrative examples are given.

Dates et versions

hal-00968209 , version 1 (31-03-2014)

Identifiants

Citer

Teodoro Alamo, A. Cepeda, Mirko Fiacchini, Eduardo Camacho. Convex invariant sets for discrete-time Lur'e systems. Automatica, 2009, 45 (4), pp.1066-1071. ⟨10.1016/j.automatica.2008.11.013⟩. ⟨hal-00968209⟩

Collections

UGA TDS-MACS
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More