Attitude tracking of a rigid spacecraft using two internal torques
Bibliographic record
Abstract
The attitude-tracking control of a rigid spacecraft using only two internal torques is addressed. First, a given reference trajectory is classified as feasible or unfeasible according to the preservation or violation of the momentum conservation law. The dynamics of the attitude-tracking error is then formulated on the attitude manifold SO(3) with the angular momentum of the actuators as inputs. Given the Lie group structure of SO(3), the transverse function approach is utilized to design an attitude-tracking law ensuring asymptotically ultimately bounded tracking error for any reference trajectory. For feasible reference trajectories satisfying certain persistence conditions, asymptotic tracking is achieved by constructing an asymptotically stable zero dynamics for the closed-loop system. To deliver control torques to the actuator command signals, steering laws are designed for two reaction wheels, two single-gimbal control moment gyros mounted in parallel, and one variable-speed control moment gyro, respectively. The resulting control law can be applied to a spacecraft with different kinds of momentum actuators but underactuated for tasks ranging from bounded tracking of a generic trajectory, three-axis earth pointing to line-of-sight pointing, etc. Numerical examples are presented to verify the effectiveness of the proposed method.
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.000 |
| Open science | 0.000 | 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".