An LMI–based heuristic algorithm for vertex reduction in LPV systems
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 rea...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/176489 |
| Acceso en línea: | https://hdl.handle.net/2117/176489 https://dx.doi.org/10.2478/amcs-2019-0054 |
| Access Level: | acceso abierto |
| Palabra clave: | Automatic control Control system synthesis Control theory Linear parameter varying (LPV) paradigm Linear matrix inequality (LMI) Gershgorin circles Gain scheduling Controller design Control automàtic Àrees temàtiques de la UPC::Informàtica::Automàtica i control |
| Sumario: | 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. |
|---|