Indirect Neural-Enhanced Integral Sliding Mode Control for Finite-Time Fault-Tolerant Attitude Tracking of Spacecraft
Bibliographic record
Abstract
In this article, a neural integral sliding mode control strategy is presented for the finite-time fault-tolerant attitude tracking of rigid spacecraft subject to unknown inertia and disturbances. First, an integral sliding mode controller was developed by originally constructing a novel integral sliding mode surface to avoid the singularity problem. Then, the neural network (NN) was embedded into the integral sliding mode controller to compensate the lumped uncertainty and replace the robust switching term. In this way, the chattering phenomenon was significantly suppressed. Particularly, the mechanism of indirect neural approximation was introduced through inequality relaxation. Benefiting from this design, only a single learning parameter was required to be adjusted online, and the computation burden of the proposed controller was extremely reduced. The stability argument showed that the proposed controller could guarantee that the attitude and angular velocity tracking errors were regulated to the minor residual sets around zero in a finite time. It was noteworthy that the proposed controller was not only strongly robust against unknown inertia and disturbances, but also highly insensitive to actuator faults. Finally, the effectiveness and advantages of the proposed control strategy were validated using simulations and comparisons.
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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".