Fault-Tolerant Reduced-Attitude Control for Spacecraft Constrained Boresight Reorientation
Bibliographic record
Abstract
This paper is devoted to investigating the fault-tolerant reduced-attitude control problem for boresight reorientation of an uncertain spacecraft subject to pointing and angular velocity constraints. First, the stereographic projection is used to transform this problem to an obstacle avoidance problem on a two-dimensional Euclidean sphere world with circular obstacles. Then, an adaptive fault-tolerant control strategy is proposed to solve the transformed problem, by designing two potential functions for constraint handling in conjunction with a sliding vector containing hyperbolic tangent functions. Stability analysis shows that the derived controller can achieve asymptotic convergence of the gradient of the obstacle avoidance potential and angular velocities, while ensuring the satisfaction of both pointing and angular velocity constraints, despite the presence of unknown time-varying inertia parameters, disturbances, and actuator faults. In particular, benefiting from incorporating the spacecraft principal moments of inertia into the potential field design, the risk of the system losing strong controllability under multiplicative actuator faults is greatly reduced. To accommodate actuator faults under input saturation, the adaptive fault-tolerant controller is further extended to a saturated counterpart, which is capable of making full use of the remaining actuation power to react to actuator faults. Finally, simulation results are presented to demonstrate our theoretical findings.
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.001 | 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.001 |
| 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".