Fault Detection, Isolation and Prognosis of Aerospace Systems Using Adaptive Growing Recurrent Neural Networks
Bibliographic record
Abstract
Due to the increase in complexity in aerospace systems, developing a diagnosis, prognosis and health monitoring (DPHM) framework is a challenge that must be considered to assure the safety of such systems. This thesis discusses this problem by proposing a novel growing neural network model to automate the process of DPHM for aerospace systems. The model optimizes the architecture of a recurrent neural network and was used to make Remaining Useful Lifetime (RUL) predictions for aircraft engines and detect failure for satellite attitude actuators (Reaction Wheels). It was tested on the CMAPSS and PHM08 aircraft engine datasets simulated by NASA, and it was able to make RUL predictions with root mean square errors as low as 14.31 engine cycles. Another application to test the proposed model was on the Kepler Spacecraft’s reaction wheels from which two have failed. The model detected the failure of the two failed reaction wheels by estimating a Health Index value which indicates the probability of failure of the reaction wheels using the residuals between the speed predictions made by the model and measured speed values. Failure was predicted using the model 105 days and 54 days before it occurred for reaction wheels two and four respectively. Prognostics were also applied on the Kepler Mission reaction wheels and RUL predictions were made with mean absolute errors ranging between 2-13 days depending on how close the reaction wheel is to failure. The proposed algorithm showed results in both applications that could regard it as a promising approach for DPHM models.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| 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.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".