Fault-Tolerant Cooperative Control for Multiple Vehicle Systems Based on Topology Reconfiguration
Bibliographic record
Abstract
In this article, the fault-tolerant synchronization and time-varying tracking control problem is investigated for nonlinear multivehicle systems (MVSs) in the presence of partial loss-of-control-effectiveness (LoCE) faults. Based on the graph theory, a two-level fault-tolerant cooperative control framework is proposed, namely, the low-level distributed nominal control scheme and the high-level topology reconfiguration protocols. The low-level scheme is developed to guarantee system performances in the fault-free scenario. With the low-level scheme, the high-level topology reconfiguration protocols, each of which corresponds to one partial LoCE fault scenario, are then proposed to mitigate the fault impact by adjusting the underlying topology. Accordingly, without modifying the structure or the design parameter of the low-level control scheme, the proposed framework can guarantee the synchronization and tracking errors of the MVS asymptotically convergent to zero in both fault-free and fault scenarios. Finally, the effectiveness of the proposed control method is verified via a simulation study of three degree-of-freedom helicopters.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".