Effects of network communications on a class of learning controlled non-linear systems†
Bibliographic record
Abstract
In this article, an iterative learning control approach is proposed for a class of sampled-data non-linear systems over network communication channels. The effects of constant time delays and stochastic packet loss are discussed and demonstrated by simulation results. The focus of this article is to study the remote control problems when the environment is periodic or repeatable over iterations in a fixed finite interval. Because of the existence of time delays and packet loss in input and output signal transmissions, it is not trivial to accomplish the remote stabilisation task of any system. Moreover, to track a desired trajectory through a remote controller is even more difficult. Previous cycle-based learning method is incorporated into the network-based control for a class of non-linear systems which satisfies a global Lipschitz condition. The convergence property of this approach is proven. Furthermore, the convergence in the iteration domain is also discussed when there exists packet loss in both transmission channels of the system. Finally, one single-link rigid robot is given as an example to show the effectiveness of the proposed approach. †Final version for the International Journal of Systems Science.
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.002 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| 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".