Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/206569
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | An LMI-based heuristic algorithm for vertex reduction in LPV systems |
Autor: | Sanjuan, Adrián; Rotondo, Damiano CSIC ORCID ; Nejjari, Fatiha; Sarrate, Ramon | Palabras clave: | Linear parameter varying (LPV) paradigm Linear matrix inequality (LMI) Gershgorin circles Gain scheduling Controller design |
Fecha de publicación: | 2019 | Editor: | Walter de Gruyter | Citación: | International Journal of Applied Mathematics and Computer Science 29(4): 725-737 (2019) | Resumen: | The linear parameter varying (LPV) approach has proved to be suitable for controlling many non-linear systems. However, for those which are highly non-linear and complex, the number of scheduling variables increases rapidly. This fact makes the LPV controller implementation not feasible for many real systems due to memory constraints and computational burden. This paper considers the problem of reducing the total number of LPV controller gains by determining a heuristic methodology that combines two vertices of a polytopic LPV model such that the same gain can be used in both vertices. The proposed algorithm, based on the use of the Gershgorin circles, provides a combinability ranking for the different vertex pairs, which helps in solving the reduction problem in fewer attempts. Simulation examples are provided in order to illustrate the main characteristics of the proposed approach. | Versión del editor: | http://dx.doi.org/10.2478/amcs-2019-0054 | URI: | http://hdl.handle.net/10261/206569 | DOI: | 10.2478/amcs-2019-0054 | Identificadores: | doi: 10.2478/amcs-2019-0054 e-issn: 2083-8492 |
Aparece en las colecciones: | (IRII) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
An Lmi–Based Heuristic Algorithm_Sanjuan.pdf | 474,15 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
4
checked on 25-abr-2024
WEB OF SCIENCETM
Citations
4
checked on 22-feb-2024
Page view(s)
150
checked on 22-abr-2024
Download(s)
99
checked on 22-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
Este item está licenciado bajo una Licencia Creative Commons