Finite-frequency fixed-order dynamic output-feedback control via a homogeneous polynomially parameter-dependent technique
•The generalized KYP lemma is employed to characterize the finite-frequency specifications, paving the way for improved disturbance-attenuation specification over the specified frequency range.•In light of the HPPD technique, we establish less conservative design conditions by adopting higher-order...
Uloženo v:
| Vydáno v: | Applied mathematics and computation Ročník 441; s. 127681 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
15.03.2023
|
| Témata: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | •The generalized KYP lemma is employed to characterize the finite-frequency specifications, paving the way for improved disturbance-attenuation specification over the specified frequency range.•In light of the HPPD technique, we establish less conservative design conditions by adopting higher-order polynomials related to the uncertain parameter, which yields more flexibility in boosting the control performance.•To render the fixed-order DOF control synthesis numerically tractable, we develop a sequential convex optimization algorithm, under which a sequence of fixed-order DOF controllers can be achieved iteratively.
This paper investigates the problem of fixed-order dynamic output-feedback (DOF) control for linear polytopic systems over finite-frequency ranges. Firstly, based on the generalized Kalman–Yakubovich-Popov lemma, we formulate the necessary and sufficient conditions for the finite-frequency disturbance-attenuation performance as bilinear matrix inequalities (BMIs), which are known to be NP-hard. In light of the homogeneous polynomially parameter-dependent technique, we construct relaxed synthesis conditions by employing higher-order decision variables dependent on the uncertainty parameter. To address the BMI problem, we develop an iterative procedure, under which feasible solutions to the original non-convex programming are achieved by vicariously solving a sequence of tractable convex approximations. Finally, we verify the efficacy of the theoretical results by an active suspension system. |
|---|---|
| ISSN: | 0096-3003 1873-5649 |
| DOI: | 10.1016/j.amc.2022.127681 |