Tuning an adaptive controller using a robust control approach
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
This article proposes a new technique for the tuning of a discrete adaptive controller that is designed based on Lyapunov stability concepts. The tuning is based on the minimisation of a performance index that can be calculated from a generalised eigenvalue problem (GEVP) using LMI's (Linear Matrix Inequalities). The proposed technique results in an adaptive controller with time-varying tuning gains. The solution is based on an approximation of the optimal dual adaptive control problem. The tuning technique was used to perform on-line control of a first-order system and an isothermal and a non-isothermal CSTR. The results show that the proposed approach provides better performance than an adaptive algorithm with the same structure, but with constant adaptation gains. Also, the proposed algorithm is shown to be superior to an adaptive controller based on a Recursive Least Squares (RLS) estimator during sudden changes in model parameters.
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.000 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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