On convexified robust control synthesis
type: Item
instance of: scholarly article
title: On convexified robust control synthesis
zbMATH Open document ID: 1083.93018
author: Bei Lu
author: Fen Wu
published in: Automatica
publication date: 2004-11-23T00:00:00Z
review text: Since the 1990s, it is known that conditions for robust controller design with \(H_{\infty}\) performance specifications can be formulated as nonlinear matrix inequalities which are typically non-convex and hence difficult to solve numerically. These conditions can be ``convexified'' into linear matrix inequalities (LMI), using appropriate changes of variables, only in very specific cases. The main contribution of this paper is to describe a particular class of systems for which this convexification can be carried out. These systems admit a structured state-space description given by relation (12), where either the signals coming from the perturbation or uncertainty block can be fully measured, or the system state can be fully measured. This can be seen as a slight generalization of the ``full-information'' case identified previously in the robust control literature. Under these assumptions, the robust controller design procedure boils down to solving a convex LMI problem for which several numerical solvers are available. Another contribution of the paper is to show that for this particular class of systems, there is no performance improvement brought by gain-scheduling control (where the control law is dynamically updated based on on-line measurements of system parameters) over robust control (where the control law is not updated).
reviewed by: Didier Henrion
Mathematics Subject Classification ID: 93B51
Mathematics Subject Classification ID: 93B36
Mathematics Subject Classification ID: 93D15
Mathematics Subject Classification ID: 15A39
zbMATH DE Number: 2117913
zbMATH Keywords: robust stability
zbMATH Keywords: controller design
zbMATH Keywords: \(H_\infty\) control
zbMATH Keywords: linear matrix inequalities
zbMATH Keywords: convexification
zbMATH Keywords: full-information
zbMATH Keywords: gain-scheduling
describes a project that uses: Mu Analysis and Synthesis Toolbox
describes a project that uses: LMI toolbox
MaRDI profile type: Publication
full work available at URL: j.automatica.2004.01.010
OpenAlex ID: W1991901808
cites work: A convex characterization of gain-scheduled H/sub ∞/ controllers
cites work: Some conditions which make the constantly scaledH? control synthesis problems convex
cites work: Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
cites work: Linear Matrix Inequalities in System and Control Theory
cites work: Rank-One Scaled ℋ∞ Optimization
cites work: On the use of multi-loop circle criterion for saturating control synthesis
cites work: Necessary and sufficient conditions of stability: a multiloop generalization of the circle criterion
cites work: Gain scheduling via linear fractional transformations
cites work: The complex structured singular value
cites work: Optimal, constant I/O similarity scaling for full-information and state- feedback control problems
cites work: Improved LMI conditions for gain scheduling and related control problems
cites work: Robust stability with time-varying structured uncertainty
cites work: Q3128879
DOI: 10.1016/J.AUTOMATICA.2004.01.010
description: scientific article; zbMATH DE number 2117913