Ponencia
Invariants sets for a class of discrete-time lur'e Systems
Autor/es | Cepeda, A.
Alamo, Teodoro Camacho, Eduardo F. |
Departamento | Universidad de Sevilla. Departamento de Ingeniería de Sistemas y Automática |
Fecha de publicación | 2005 |
Fecha de depósito | 2020-04-02 |
Publicado en |
|
ISBN/ISSN | 1474-6670 |
Resumen | We present a method to estimate the domain of attraction of a class of discrete-time Lur'e systems. A new notion of LNL-invariance, stronger than the traditional invariance concept, is introduced. An algorithm to determinate ... We present a method to estimate the domain of attraction of a class of discrete-time Lur'e systems. A new notion of LNL-invariance, stronger than the traditional invariance concept, 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. |
Cita | Cepeda, A., Alamo, T. y Camacho, E.F. (2005). Invariants sets for a class of discrete-time lur'e Systems. En IFAC World Congress (91-96), Praga (República Checa): Elsevier. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
invariant sets for a class.pdf | 273.9Kb | [PDF] | Ver/ | |