An Adaptive Fault-Tolerant Sliding Mode Control Allocation Scheme for Multirotor Helicopter Subject to Simultaneous Actuator Faults
Bibliographic record
Abstract
This paper proposes a novel adaptive sliding-mode-based control allocation scheme for accommodating simultaneous actuator faults. The proposed control scheme includes two separate control modules with virtual control part and control allocation part, respectively. As a low-level control module, the control allocation/reallocation scheme is used to distribute/redistribute virtual control signals among the available actuators under fault-free or faulty conditions, respectively. In the case of simultaneous actuator faults, the control allocation and reallocation module may fail to meet the required virtual control signal, which will degrade the overall system stability. The proposed online adaptive scheme can seamlessly adjust the control gains for the high-level sliding mode control module and reconfigure the distribution of control signals to eliminate the effect of the virtual control error and maintain the stability of the closed-loop system. In addition, with the help of the boundary layer for constructing the adaptation law, the overestimation of control gains is avoided, and the adaptation ceases once the sliding variable is within the boundary layer. A significant feature of this study is that the stability of the closed-loop system is guaranteed theoretically in the presence of simultaneous actuator faults. The effectiveness of the proposed control scheme is demonstrated by experimental results based on a modified unmanned multirotor helicopter under both single and simultaneous actuator faults conditions with comparison to a conventional sliding mode controller and a linear quadratic regulator 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.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".