Advances in Parameter Estimation and Performance Improvement in Adaptive Control
Bibliographic record
Abstract
The work presented in this chapter transcends beyond characterizing the parameter convergence rate. A method is presented for computing the exact parameter value at a finite-time selected according to the observed excitation in the system. A smooth transition from a standard estimate to the FT estimate is proposed. In the presence of unknown bounded disturbances, the FT identifier converges to a neighbourhood of the true value whose size is dictated by the choice of the filter gain. Moreover, the procedure preserves the system's established closed-loop properties whenever the required PE condition is not satisfied. We also demonstrate how the finite-time identification procedure can be used to improve the overall performance (both transient and steady state) of adaptive control systems in a very appealing manner. The adaptive compensator guarantees exponential convergence of the estimation error provided a given PE condition is satisfied. The convergence rate of the parameter estimator is directly proportional to the adaptation gain and a measure of the system's excitation. The adaptive compensator is then combined with existing adaptive controllers to guarantee exponential stability of the closed-loop system. The application reported in Section 9 is just an example, the adaptive compensator can easily be incorporated into other adaptive control algorithms.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.005 | 0.003 |
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".