.png){kind=icon}
Return
A synthesis framework for robust gain-scheduling controllers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2014.10.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a general framework for the systematic synthesis of robust gain-scheduling controllers by convex optimization techniques and for uncertain dynamical systems described by standard linear fractional representations. We distinguish between linear time-varying parameters, which are assumed to be available online as scheduling parameters for the controller, and genuine uncertainties, not necessarily time-varying, parametric or linear, that are not available online. Under the rough hypothesis that the control channel is not affected by the unmeasurable uncertainties and that the properties of the uncertainties and scheduling variables are captured by suitable families of integral quadratic constraints, this paper reveals how controller synthesis can be turned into a genuine semi-definite program. The design framework is shown to encompass a rich class of concrete scenarios. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Gain-scheduling control
Robust control
Integral quadratic constraints
Convex optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more