Adaptive Finite-Time Fault-Tolerant Control for Uncertain Flexible Flapping Wings Based on Rigid Finite Element Method
Bibliographic record
Abstract
The bionic flapping-wing robotic aircraft is inspired by the flight of birds or insects. This article focuses on the flexible wings of the aircraft, which has great advantages, such as being lightweight, having high flexibility, and offering low energy consumption. However, flexible wings might generate the unexpected deformation and vibration during the flying process. The vibration will degrade the flight performance, even shorten the lifespan of the aircraft. Therefore, designing an effective control method for suppressing vibrations of the flexible wings is significant in practice. The main purpose of this article is to develop an adaptive fault-tolerant control scheme for the flexible wings of the aircraft. Dynamic modeling, control design, and stability verification for the aircraft system are conducted. First, the dynamic model of the flexible flapping-wing aircraft is established by an improved rigid finite element (IRFE) method. Second, a novel adaptive fault-tolerant controller based on the fuzzy neural network (FNN) and nonsingular fast terminal sliding-mode (NFTSM) control scheme are proposed for tracking control and vibration suppression of the flexible wings, while successfully addressing the issues of system uncertainties and actuator failures. Third, the stability of the closed-loop system is analyzed through Lyapunov's direct method. Finally, co-simulations through MapleSim and MATLAB/Simulink are carried out to verify the performance of the proposed controller.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| 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".