Resilient Cruise Control of Heterogeneous Platoons Against Byzantine Attacks: Theory and Experiment
Bibliographic record
Abstract
This article studies the problem of the resilient cruise control in heterogeneous vehicle platoons against f-local Byzantine attacks (BAs). Agents under BAs become traitors of the swarm, who try to mislead its neighbors while adopting wrong inputs. Thus, BAs are extremely challenging to be suppressed. This study introduces a novel hierarchical protocol characterized by a virtual twin layer (TL), motivated by the rationale of digital twin. This protocol separates the defense scheme against f-local BAs into two parts: one defense scheme against Byzantine edge attacks (BEAs) via the TL and another scheme against Byzantine node attacks (BNAs) via the cyber-physical layer (CPL). The TL employs a trusted-edge strategy, enhancing the network resilience by incorporating a minimal fraction of the key edges. It is rigorously proven that a TL topology meeting strong -robustness is sufficient for achieving distributed resilient estimation against BEAs. On the CPL, a series of decentralized chattering-free controllers is proposed, guaranteeing the resilient cruise tracking of heterogeneous platoons against exponentially unbounded BNAs. Besides, these controllers can achieve uniformly ultimately bounded convergence. The theoretical results' effectiveness and practicality are validated through a numerical simulation example and an unmanned ground vehicle experiment involving heterogeneous platoons against f-local BAs.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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".