A Convergent Algorithm for the Output Covariance Constraint Control Problem
SIAM Journal on Control and Optimization
Probabilistic robustness analysis: explicit bounds for the minimum number of samples
Systems & Control Letters
On the complexity of the robust stability problem for linear parameter varying systems
Automatica (Journal of IFAC)
Paper: Low-order control design for LMI problems using alternating projection methods
Automatica (Journal of IFAC)
Randomized algorithms for robust controller synthesis using statistical learning theory
Automatica (Journal of IFAC)
Brief LPV Systems with parameter-varying time delays: analysis and control
Automatica (Journal of IFAC)
Survey Research on gain scheduling
Automatica (Journal of IFAC)
LPV control and full block multipliers
Automatica (Journal of IFAC)
Brief paper: Guaranteed cost regulator design: A probabilistic solution and a randomized algorithm
Automatica (Journal of IFAC)
A survey of randomized algorithms for control synthesis and performance verification
Journal of Complexity
Brief paper: Probabilistic sorting and stabilization of switched systems
Automatica (Journal of IFAC)
Linear quadratic regulation of systems with stochastic parameter uncertainties
Automatica (Journal of IFAC)
Brief paper: Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
Automatica (Journal of IFAC)
Automatica (Journal of IFAC)
Randomized algorithms for quadratic stability of quantized sampled-data systems
Automatica (Journal of IFAC)
Hi-index | 22.16 |
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.