Asymptotically exact stabilisation for constrained discrete Takagi-Sugeno systems via set-invariance

[EN] Given a Takagi-Sugeno (TS) system, this paper proposes a novel methodology to obtain the state feedback controller guaranteeing, asymptotically as a Polya-related complexity parameter grows, the largest (membership-shape independent) possible domain-of-attraction with contraction-rate performan...

Descripción completa

Detalles Bibliográficos
Autores: Ariño-Latorre, Carlos Vicente, Pérez Soler, Emilio, Bedate Boluda, Fernando, Querol-Ferrer, Andrés, Sala, Antonio|||0000-0002-5691-8772
Tipo de recurso: artículo
Fecha de publicación:2017
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/147997
Acceso en línea:https://riunet.upv.es/handle/10251/147997
Access Level:acceso abierto
Palabra clave:Fuzzy control
Invariant sets
Takagi-Sugeno models
Contractive sets
Polyhedral Lyapunov functions
INGENIERIA DE SISTEMAS Y AUTOMATICA
Descripción
Sumario:[EN] Given a Takagi-Sugeno (TS) system, this paper proposes a novel methodology to obtain the state feedback controller guaranteeing, asymptotically as a Polya-related complexity parameter grows, the largest (membership-shape independent) possible domain-of-attraction with contraction-rate performance lambda, based on polyhedral lambda-contractive sets from constrained linear systems literature. The resulting controller is valid for any realisation of the memberships, as usual in most TS literature. For a finite complexity parameter, an inner estimate of such largest set is obtained; the frontier of such approximation can be understood as the level set of a polyhedral control-Lyapunov function. Convergence of a proposed iterative algorithm is asymptotically necessary and sufficient for TS system stabilisation: for a high-enough value of the complexity parameter, any conceivable shape-independent Lyapunov controller design procedure will yield a proven domain of attraction smaller or equal to the algorithm's output. (C) 2016 Elsevier B.V. All rights reserved.