Periodic Event-Triggered Networked Control Systems Subject to Large Transmission Delays
Bibliographic record
Abstract
This article studies periodic event-triggered networked control for nonlinear systems, where the plants and controllers are connected by multiple independent communication channels. Several network-induced imperfections are considered simultaneously, including time-varying intersampling times, sensor node scheduling, and especially, large time-varying transmission delays, where the transmitted signal may arrive at the destination node after the next transmission occurs. A new hybrid system approach is provided to model the closed-loop system that contains all communication related behavior. Then, by constructing new storage functions on the system state and updating errors, the relationship between the maximum allowable sampling period and maximum allowable delay number in sampling is analyzed, where the latter denotes how many inter-sampling periods can be included in one transmission delay. Moreover, to efficiently reduce unnecessary transmissions, a new dynamic event-triggered control scheme is proposed, where the event-triggering conditions are detected only at aperiodic and asynchronous sampling instants. From emulation-based method, where the controllers are initially designed by ignoring all the network-induced imperfections, sufficient conditions on the dynamic event-triggered control are given to ensure closed-loop input-to-state stability with respect to external disturbances. Finally, two nonlinear examples are simulated to illustrate the feasibility and efficiency of the theoretical results.
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.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".