An LMI–based heuristic algorithm for vertex reduction in LPV systems

Document typeArticle
Defense date2019
Rights accessOpen Access
Abstract
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.
CitationSanjuan, A. [et al.]. An LMI–based heuristic algorithm for vertex reduction in LPV systems. "International Journal of Applied Mathematics and Computer Science", 2019, vol. 29, núm. 4, p. 725-737.
ISSN2083-8492
Publisher versionhttps://content.sciendo.com/view/journals/amcs/29/4/article-p725.xml
Collections
- SIC - Sistemes Intel·ligents de Control - Articles de revista [107]
- Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial - Articles de revista [991]
- Doctorat en Automàtica, Robòtica i Visió - Articles de revista [46]
- SAC - Sistemes Avançats de Control - Articles de revista [326]
- IRI - Institut de Robòtica i Informàtica Industrial, CSIC-UPC - Articles de revista [290]
Files | Description | Size | Format | View |
---|---|---|---|---|
2252-An-LMI–bas ... duction-in-LPV-systems.pdf | 307,6Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 4.0 Generic