Adaptive regulation of MIMO linear systems against unknown sinusoidal exogenous inputs
Bibliographic record
Abstract
Abstract This paper deals with the adaptive regulation problem in linear multi‐input multi‐output systems subject to unknown sinusoidal exogenous inputs, where the frequencies, amplitudes, and phases of the sinusoids are unknown and where the number of sinusoids is assumed to be known. The design of an adaptive regulator for the system under consideration is performed within a set ofQ‐parameterized stabilizing controllers. To facilitate the design of the adaptive regulator, triangular decoupling is introduced in part of the closed‐loop system dynamics. This is achieved through the proper selection of the controller state feedback gain and the structure of theQparameter. Regulation conditions are then presented for the case where the sinusoidal exogenous input properties are known. For the case where the sinusoidal exogenous input properties are unknown, an adaptation algorithm is proposed to tune theQparameter in the expression of the parameterized controller. The online tuning of theQparameter allows the controller to converge to the desired regulator. Convergence results of the adaptation algorithm are presented. A simulation example involving a retinal imaging adaptive optics system is used to illustrate the performance of the proposed adaptive system. Copyright © 2008 John Wiley & Sons, Ltd.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".