Safety-Critical Randomized Event-Triggered Learning of Gaussian Process With Applications to Data-Driven Predictive Control
Bibliographic record
Abstract
Safety and data efficiency are important concerns in data-driven control, especially for nonlinear systems with unknown dynamics and subject to disturbances. In this work, we consider a class of control-affine nonlinear systems with partially unknown dynamics and aim to introduce an event-triggered learning-based control approach with guaranteed safety and improved data utilization efficiency. Specifically, a randomized learning approach is employed to evaluate the safety of state trajectories by defining and estimating its confidence interval, with data from a multisample of randomly generated state trajectories. Using the proposed randomized learning algorithm, a nominal trajectory with a high probability safety guarantee is designed, thus ensuring the disturbed system states to remain within a prespecified range around the nominal trajectory with a sufficiently high probability. Through removing irrelevant data, a local prediction model around the nominal trajectory is learned with satisfactory precision, and is updated online using an event-triggered learning strategy. Based on the learned model, an efficient data-driven predictive controller is designed to force the system states to evolve within the vicinity of the designed safety nominal trajectory. The effectiveness of the proposed event-triggered learning and data-driven control approaches is validated through comprehensive simulation studies.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".