Enhancing Remaining Useful Life Predictions in Predictive Maintenance of MOSFETs: The Efficacy of Integrated Particle Filter-Gaussian Process Regression Models
Bibliographic record
Abstract
In the field of predictive maintenance, accurately predicting the remaining useful life (RUL) of equipment is critical to optimizing operations and avoiding unexpected failures.Traditional models such as Gaussian Process Regression (GPR), Particle Filter (PF), and Kalman Filter (KF) have been widely used, each with their own strengths and limitations.The motivation behind this study stems from the need to improve the accuracy and reliability of RUL predictions.Given the critical importance of predictive maintenance across a variety of industries, improved predictive models can provide significant operational and economic benefits.The main issues addressed are the limitations inherent in individual predictive models.GPR prediction gap or high initial error of his KF.This can lead to suboptimal RUL estimates.To address this problem, an integrated approach combining particle filtering and Gaussian process regression (PF-GPR) was proposed and developed.This integration aims to leverage the strengths of PF and GPR and potentially alleviate the limitations of the individual models.The performance of the PF-GPR model is evaluated and compared with the standalone His GPR, PF, and KF models using the prediction error and root mean square error (RMSE) at different points in the aging process of device #36.The results show that the PF-GPR model consistently outperforms the individual models in terms of both prediction error and RMSE, and significantly improves the accuracy and accuracy of RUL prediction.The PF-GPR model showed excellent performance in his RUL prediction for device #36, achieving the lowest prediction error and RMSE values at all time points as follows: B. The prediction error is only 2.30E-1 and the RMSE after 100 minutes is 7. 12E-3, which significantly outperforms his standalone GPR, PF, and KF models.The PF-GPR model demonstrated its excellent ability to provide robust and reliable predictions, highlighting the benefits of integrating different prediction methods into predictive maintenance applications.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".