Predictor‐based repetitive learning control for a class of remote control nonlinear systems
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 In this paper, a repetitive learning control (RLC) approach is proposed for a class of remote control nonlinear systems satisfying the global Lipschitz condition. The proposed approach is to deal with the remote tracking control problem when the environment is periodic or repeatable over infinite time domain. Since there exist time delays in the two transmission channels: from the controller to the actuator and from the sensor to the controller, tracking a desired trajectory through a remote controller is not an easy task. In order to solve the problem caused by time delays, a predictor is designed on the controller side to predict the future state of the nonlinear system based on the delayed measurements from the sensor. The convergence of the estimation error of the predictor is ensured. The gain design of the predictor applies linear matrix inequality (LMI) techniques developed by Lyapunov Kravoskii method for time delay systems. The RLC law is constructed based on the feedback error from the predicted state. The overall tracking error tends to zero asymptotically over iterations. The proof of the stability is based on a constructed Lyapunov function related to the Lyapunov Kravoskii functional used for the proof of the predictor's convergence. By well incorporating the predictor and the RLC controller, the system state tracks the desired trajectory independent of the influence of time delays. A numerical simulation example is shown to verify the effectiveness of the proposed approach. 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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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