This paper presents an alternative approach to design of linear parameter-varying (LPV) control systems. In contrast to previous methods, which are focused on deterministic algorithms, this paper is based on a probabilistic setting. The proposed randomized algorithm provides a sequence of candidate solutions converging with probability one to a feasible solution in a finite number of steps. The main features of this approach are as follows: (i) The randomized algorithm gives a method for general LPV plants with state space matrices depending on scheduling parameters in a nonlinear manner. That is, the probabilistic setting does not need a gridding of the set of scheduling parameters or approximations such as a linear fractional transformation of the state space matrices. (ii) The proposed algorithm is sequential and, at each iteration, it does not require heavy computational effort such as solving simultaneously a large number of linear matrix inequalities.
Probabilistic Design of LPV Control System
Dabbene F;Tempo R
2003
Abstract
This paper presents an alternative approach to design of linear parameter-varying (LPV) control systems. In contrast to previous methods, which are focused on deterministic algorithms, this paper is based on a probabilistic setting. The proposed randomized algorithm provides a sequence of candidate solutions converging with probability one to a feasible solution in a finite number of steps. The main features of this approach are as follows: (i) The randomized algorithm gives a method for general LPV plants with state space matrices depending on scheduling parameters in a nonlinear manner. That is, the probabilistic setting does not need a gridding of the set of scheduling parameters or approximations such as a linear fractional transformation of the state space matrices. (ii) The proposed algorithm is sequential and, at each iteration, it does not require heavy computational effort such as solving simultaneously a large number of linear matrix inequalities.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


