- Tytuł:
- An LMI-based heuristic algorithm for vertex reduction in LPV systems
- Autorzy:
-
Sanjuan, Adrián
Rotondo, Damiano
Nejjari, Fatiha
Sarrate, Ramon - Powiązania:
- https://bibliotekanauki.pl/articles/331436.pdf
- Data publikacji:
- 2019
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
linear parameter varying
linear matrix inequality
Gershgorin circles
gain scheduling
controller design
układ liniowy niestacjonarny
liniowa nierówność macierzowa
twierdzenie Gerszgorina
harmonogramowanie wzmocnienia - Opis:
- 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.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 725-737
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł