Finite‐Time Lyapunov‐Based Model Predictive Control of Unmanned Surface Vehicles Against Denial‐of‐Service Attacks: An Independent of Prediction Horizon Approach
Bibliographic record
Abstract
ABSTRACT The resilience and robustness of model predictive control are typically contingent upon an adequately extended prediction horizon, yet it is constrained in real‐time applications by limited computational resources. To tackle this issue, this paper introduces a finite‐time Lyapunov‐based model predictive control (FTLMPC) approach, independent of the prediction horizon, for unmanned surface vehicles (USVs) subject to external disturbances and denial‐of‐service (DoS) attacks. Firstly, a finite‐time auxiliary control system is integrated within the FTLMPC framework. This system incorporates a finite‐time extended state observer (FTESO) for precise disturbance estimation and a finite‐time backstepping control law to guarantee zero tracking errors. Consequently, FTLMPC ensures finite‐time stability during each DoS attack interval, effectively preventing error accumulation despite the presence of disturbances and DoS attacks. Secondly, a novel compensation scheme is introduced to mitigate the information loss induced by DoS attacks, wherein the compensation signal is solely derived from the control signal at the moment of the last successful transmission, thus minimizing reliance on the prediction horizon. It enables flexible adaptation of the prediction horizon and control performance according to the available computational resources. Finally, the simulation results validate the superior control performance of the proposed strategy.
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 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.001 | 0.000 |
| 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.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".