Decentralized Adaptive Fault-Tolerant Cooperative Control for Multiple UAVs with Input Saturation and State Constraints
Bibliographic record
Abstract
This paper proposes a fault-tolerant cooperative control (FTCC) scheme for multiple UAVs in a distributed communication network against input saturation, full-state constraints, actuator faults, and unknown dynamics. Firstly, by considering physical limitations, an auxiliary control signal is designed to simplify the analysis process. Secondly, to avoid the difficulty in the back-stepping design caused by full-state constraints, virtual control signals are constructed to transform constrained variables, while the dynamic surface control is adopted to avoid the phenomenon of “differential explosion.” Thirdly, a disturbance observer (DO) is designed to estimate the unknown uncertainty caused by parameter uncertainty and actuator fault. Moreover, a recurrent wavelet fuzzy neural network (RWFNN) is used to compensate for the estimation errors of DO. Finally, it is proved that all states are uniformly ultimately bounded (UUB) by Lyapunov and invariant set theory. The effectiveness of the proposed scheme is further demonstrated by the simulation results.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 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.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 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".