Distributed Finite-Time Fault-Tolerant Containment Control for Multiple Unmanned Aerial Vehicles
Bibliographic record
Abstract
This paper investigates the distributed finite-time fault-tolerant containment control problem for multiple unmanned aerial vehicles (multi-UAVs) in the presence of actuator faults and input saturation. The distributed finite-time sliding-mode observer (SMO) is first developed to estimate the reference for each follower UAV. Then, based on the estimated knowledge, the distributed finite-time fault-tolerant controller is recursively designed to guide all follower UAVs into the convex hull spanned by the trajectories of leader UAVs with the help of a new set of error variables. Moreover, the unknown nonlinearities inherent in the multi-UAVs system, computational burden, and input saturation are simultaneously handled by utilizing neural network (NN), minimum parameter learning of NN (MPLNN), first-order sliding-mode differentiator (FOSMD) techniques, and a group of auxiliary systems. Furthermore, the graph theory and Lyapunov stability analysis methods are adopted to guarantee that all follower UAVs can converge to the convex hull spanned by the leader UAVs even in the event of actuator faults. Finally, extensive comparative simulations have been conducted to demonstrate the effectiveness of the proposed control scheme.
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.000 | 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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".