Distributed <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math> Control of AVs Interacting by Uncertain and Switching Topology in a Platoon
Bibliographic record
Abstract
To overcome the challenges arising from the weakness of wireless communication, this paper presents a distributed H∞ control method for multi-AVs connected by an uncertain and switching topology in a platoon. After compensating for the powertrain nonlinearities, we model the node dynamics as a linear uncertain system. By applying the eigenvalue decomposition and linear transformation, the platoon system is decomposed to multiple low order subsystems depending on the eigenvalues of the topological matrix. The sufficient condition ensuring the robust performance of the platoon is presented by using the invariant of signal amplitude of the linear transformation. Then a numerical method is provided to solve the state feedback controller by using the LMI scheme. Only the bounds of the topological eigenvalues are necessary for this new synthesis method and the designed controller can govern the platoon composed of disturbed nodes and interacting by uncertain even switching topologies in a satisfactory way. The effectiveness of this distributed H∞ control strategy is validated by comparative bench tests between nominal and disturbed conditions.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
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".