Discrete-Time-Distributed Adaptive ILC With Nonrepetitive Uncertainties and Applications to Building HVAC Systems
Bibliographic record
Abstract
Aiming to addressing the nonrepetitive uncertainties of multiagent systems, this work proposes a discrete-time-distributed adaptive iterative learning control (DDAILC) scheme for an output consensus problem, where two fundamental requirements in the traditional distributed iterative learning control (ILC) methods, i.e., the identical initial states and the repetitive desired trajectories, are removed. Furthermore, the algorithm design and analysis are directly aimed at discrete-time nonlinear multiagent systems, rather than continuous-time ones, to meet the needs of practical implementations. The iteration-varying trajectory of the virtual leader is included in the learning control protocol for a compensation. The adaptive parameter-updating law works along the iteration dimension by using a general consensus error that contains the output data of adjacent agents. To ensure the estimation of the control gain to be nonzero, a semisaturator is utilized in the parameter-updating law. The convergence of the output consensus is shown rigorously. Both numerical and practical examples are used to test the theoretical results. Moreover, the DDAILC efficiently improves performance of the building heating, ventilation, and air conditioning (HVAC) system by utilizing both the distributed topology and the repetitive dynamic characteristic.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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".