A Neural-Lyapunov-Based Adaptive Resilient Cruise Control of Platoons Subject to Cyber-Attacks on Leaders
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the realm of Intelligent Transportation Systems (ITSs), ensuring the safety and stability of connected automated vehicles (CAVs) is of paramount importance due to their susceptibility to vulnerabilities in interactions. The potential for system-wide disruption stemming from a cyber-attack on the leader underscores this need. Therefore, this letter introduces a nonlinear neural-Lyapunov-based adaptive resilient cruise control approach aimed at ensuring that all vehicles maintain safe tracking of the leader’s profile, even in the presence of cyber-attacks and external disturbances. To achieve this, we employ an adaptive neural network to estimate the system’s nonlinear characteristics. Subsequently, the control procedure is proposed, utilizing a virtual disturbance observer and Lyapunov theorem for stability analysis and adaptive laws to deal with nonlinearity, external disturbances, deception attacks, and singular control gain. Notably, our proposed approach eliminates the need for restrictive assumptions such as Lipschitz conditions on the nonlinear component and avoids the requirement for additional algorithms to switch between controllers in the event of a cyber-attack. This letter provides compelling evidence of system stability and the achievement of control objectives. Additionally, simulation and comparative results validate the theoretical analysis, highlighting the efficacy of the proposed methodology.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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 it