Ensuring Secure Platooning of Constrained Intelligent and Connected Vehicles Against Byzantine Attacks: A Distributed MPC Framework
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
This study investigates resilient platoon control for constrained intelligent and connected vehicles (ICVs) against F-local Byzantine attacks. We introduce a resilient distributed model-predictive platooning control framework for such ICVs. This framework seamlessly integrates the predesigned optimal control with distributed model predictive control (DMPC) optimization and introduces a unique distributed attack detector to ensure the reliability of the transmitted information among vehicles. Notably, our strategy uses previously broadcasted information and a specialized convex set, termed the “resilience set,” to identify unreliable data. This approach significantly eases graph robustness prerequisites, requiring only an (F + 1)-robust graph, in contrast to the established mean sequence reduced algorithms, which require a minimum (2F + 1)-robust graph. Additionally, we introduce a verification algorithm to restore trust in vehicles under minor attacks, further reducing communication network robustness. Our analysis demonstrates the recursive feasibility of the DMPC optimization. Furthermore, the proposed method achieves exceptional control performance by minimizing the discrepancies between the DMPC control inputs and predesigned platoon control inputs, while ensuring constraint compliance and cybersecurity. Simulation results verified the effectiveness of our theoretical findings.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 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