On convexified robust control synthesis

In this paper, we study a convexified robust control problem and its relation to gain-scheduling control. It reveals that the robust control synthesis condition becomes convex under a special plant structure. Moreover, for this class of robust control problems, the gain-scheduling control approach f...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 2004-06, Vol.40 (6), p.1003-1010
Main Authors: Wu, Fen, Lu, Bei
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Convexity
Exact sciences and technology
Gain-scheduling control
Linear matrix inequality
Robust control
Scaled [formula omitted] optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study a convexified robust control problem and its relation to gain-scheduling control. It reveals that the robust control synthesis condition becomes convex under a special plant structure. Moreover, for this class of robust control problems, the gain-scheduling control approach from scaled small-gain theorem will not provide any performance improvement over convexified robust controllers. Based on this observation, a convexified robust control synthesis framework with stringent performance and computational efficacy is proposed.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2004.01.010