Adaptive control of a linear first-order discrete-time system providing linear-like behaviour and asymptotic tracking
Bibliographic record
Abstract
Adaptive control is an approach used to deal with systems having uncertain and/or time-varying parameters. In this paper, we consider the problem of designing an adaptive controller for a discrete-time first-order plant. Recently, Shahab et.al. considered this problem and proposed an approach which provides linear-like behaviour: exponential stability and a convolution bound on the input–output behaviour, together with robustness to slow time-variations and unmodelled dynamics. However, asymptotic tracking of a general reference signal was not provided. Here, we extend the aforementioned work with the aim to achieve asymptotic tracking while retaining linear-like closed-loop behaviour. We replace this uncertainty set with a pair of convex sets, one for each sign of the input gain, which enables us to use two parameter estimators – one for each convex set. We design these estimators using the modified version of the original projection algorithm. For each estimator, there is the corresponding one-step-ahead control law. A dynamic performance signal based switching rule is then adopted that decides which controller should be used at each time step. It is shown that the proposed approach preserves linear-like behaviour. In addition to that, we also have shown asymptotic trajectory tracking for two different circumstances: when the reference signal is asymptotically strongly persistently exciting of order two, and for a fairly general reference signal but the plant is unstable. Numerical simulations are presented to demonstrate the efficacy of the proposed approach.
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.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".