期刊名称：International Journal of Applied Mathematics and Computer Science
电子版ISSN：2083-8492
出版年度：2019
卷号：29
期号：4
页码：1-13
DOI：10.2478/amcs-2019-0054
出版社：De Gruyter Open
摘要：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.
关键词：linear parameter varying (LPV) paradigm; linear matrix inequality (LMI); Gershgorin circles; gain scheduling;
controller design
