Convex invariant sets for discrete-time Lur’e systems |
| |
Authors: | T. Alamo [Author Vitae] A. Cepeda [Author Vitae] [Author Vitae] E.F. Camacho [Author Vitae] |
| |
Affiliation: | Departamento de Ingeniería de Sistemas y Automática, Universidad de Sevilla, Camino de los Descubrimientos s/n, 41092 Sevilla, Spain |
| |
Abstract: | 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 -invariance, is introduced. An algorithm to determinate the largest -invariant set for this class of systems is proposed. Moreover, it is proven that the -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 -invariant set obtained applying the results of this paper. Two illustrative examples are given. |
| |
Keywords: | Set invariance Domain of attraction Lur&rsquo e systems |
本文献已被 ScienceDirect 等数据库收录! |