Synthesis of Optimal Finite-Frequency Controllers Able to Accommodate Passivity Violations
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we explore the relationship between the hybrid passivity/finite-gain systems framework and the generalized Kalman-Yakubovich-Popov (GKYP) lemma. In particular, we investigate how to optimally design finite-frequency (FF) controllers that possess strictly positive real (SPR) properties over a low-frequency range and bounded real (BR) properties over a high-frequency range. Such FF SPR/BR controllers will be used to control systems that have experienced a passivity violation. We first review the hybrid passive/finite-gain systems framework and how linear time-invariant hybrid passive/finite-gain systems relate to systems with low-frequency FF positive real (PR) or SPR properties, and high-frequency FF BR properties as characterized by the GKYP lemma. Optimal design of FF SPR/BR controllers is considered next. A convex optimization problem constrained by a set of linear matrix inequalities is posed where constraints are imposed using various forms of the GKYP lemma, yielding optimal FF SPR/BR controllers. The FF SPR/BR controllers are optimal in that they approximate the traditional H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> control solution. Finally, FF SPR/BR controllers are used within a gain-scheduling architecture to control a two-link flexible manipulator. Experimental results successfully demonstrate closed-loop stability and good closed-loop performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it