Particle Swarm Optimization Based Adaptive Kalman Filters for Fault Diagnosis of Reaction Wheels
Bibliographic record
Abstract
There has been an increasing interest in fault diagnosis in recent years, as a result of the growing demand for higher performance, efficiency, reliability and safety in control systems. A faulty sensor or actuator may cause process performance degradation, process shut down, or a fatal accident. Quick fault detection and isolation can help avoid abnormal event progression and minimize the quality and productivity offsets. In space systems specifically, space and power are limited in the satellites, which means that hardware redundancy is not very practical. If actuator faults occur, analytical redundancy techniques should be employed to determine if, where, and how the fault(s) occurred. To do so, different approaches have been developed and studied and one of the wellknown approaches in the literature is using the Kalman Filter as an observer for the purpose of parameter estimation and fault detection. The gains for the filter should be selected and the selection of the process and measurement noise statistics, commonly referred to as “filter tuning,” is a major implementation issue for the Kalman filter. This process can have a significant impact on the filter performance. In practice, Kalman filter tuning is often an ad-hoc process involving a considerable amount of time for trial and error to obtain a filter with desirable –qualitative or quantitative- performance characteristics. This thesis focuses on presenting an algorithm for automation of the selection of the gains using an evolutionary swarm intelligence based optimization algorithm (Particle Swarm) to minimize the residuals of the estimated parameters. The methodology can be applied to any filter or controller but in this thesis, an Adaptive Unscented Kalman Filter parameter estimation applied to a reaction wheel unit is used for the purpose of performance evaluation of the proposed methodology.
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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".