Enhanced P-Type Control: Indirect Adaptive Learning From Set-Point Updates
Bibliographic record
Abstract
In this article, an indirect adaptive iterative learning control (iAILC) scheme is proposed for both linear and nonlinear systems to enhance the P-type controller by learning from set points. An adaptive mechanism is included in the iAILC method to regulate the learning gain using input–output measurements in real time. An iAILC method is first designed for linear systems to improve control performance by fully utilizing model information if such a linear model is known exactly. Then, an iterative dynamic linearization (IDL)-based iAILC is proposed for a nonlinear nonaffine system, whose model is completely unknown. The IDL technique is employed to deal with the strong nonlinearity and nonaffine structure of the systems such that a linear data model can be attained consequently for the algorithm design and performance analysis. The convergence of the developed iAILC schemes is proved rigorously, where contraction mapping, two-dimensional (2-D) Roesser’s system theory, and mathematical induction are employed as the basic analysis tools. Simulation studies are provided to verify the developed theoretical results.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".