An adaptive tracking problem for a family of retarded time‐delay plants
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
Abstract Most of the existing switching control techniques are developed specifically for finite‐dimensional linear time‐invariant (LTI) systems. In many practical applications, however, it is essential to take time delay into consideration in the modelling as the control system can be highly sensitive to delay. In this paper, a multi‐model switching control algorithm is proposed for retarded time‐delay systems. It is assumed that the plant is represented by a family of known multi‐input multi‐output, observable, LTI models with multiple delays in the states, and that corresponding to each model in the known family, there exists a high‐performance finite‐dimensional LTI controller. In addition, it is supposed that a bound on the magnitude of the external inputs and disturbances is available. It is then shown that the proposed switching controller can stabilize the uncertain system, and that under some mild conditions, output tracking can be achieved in the given problem setting. Copyright © 2007 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.
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.001 | 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