A Three-Stage Data-Driven Approach for Determining Reaction Wheels’ Remaining Useful Life Using Long Short-Term Memory
Bibliographic record
Abstract
Reaction wheels are widely used in the attitude control system of small satellites. Unfortunately, reaction wheels failure restricts the efficacy of a satellite, and it is one of the many reasons leading to premature abandonment of the satellites. This study observes the measurable system parameter of a faulty reaction wheel induced with incipient fault to estimate the remaining useful life of the reaction wheels. We achieve this goal in three stages, as none of the observable system parameters are directly related to the health of a reaction wheel. In the first stage, we identify the necessary observable system parameter and predict the future of these parameters using sensor acquired data and a long short-term memory recurrent neural network. In the second stage, we estimate the health index parameter using a multivariate long short-term memory network. In the third stage, we predict the remaining useful life of reaction wheels based on historical data of the health index parameter. Normalized root mean squared error is used to evaluate the performance of the various models in each stage. Additionally, three different timespans (short, moderate, and extended in the scale of small satellite orbit times) are simulated and tested for the performance of the proposed methodology regarding the malfunction of reaction wheels. Furthermore, the robustness of the proposed method to missing values, input frequency, and noise is studied. The results show promising performance for the proposed scheme with accuracy in predicting health index parameter around 0.01–0.02 normalized root mean squared error, the accuracy in prediction of RUL of 1%–2.5%, and robustness to various uncertainty factors, as discussed above.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 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".