Optimal Bayesian maintenance policy for a gearbox subject to two dependent failure modes
Bibliographic record
Abstract
Abstract Most maintenance optimization models of gear systems have considered single failure mode. There have been very few papers dealing with multiple failure modes, considering mostly independent failure modes. In this paper, we present an optimal Bayesian control scheme for early fault detection of the gear system with dependent competing risks. The system failures include degradation failure and catastrophic failure. A three‐state continuous‐time–homogeneous hidden Markov model (HMM), namely the model with unobservable healthy and unhealthy states, and an observable failure state, describes the deterioration process of the gear system. The condition monitoring information as well as the age of the system are considered in the proposed optimal Bayesian maintenance policy. The objective is to maximize the long‐run expected average system availability per unit time. The maintenance optimization model is formulated and solved in a semi‐Markov decision process (SMDP) framework. The posterior probability that the system is in the warning state is used for the residual life estimation and Bayesian control chart development. The prediction results show that the mean residual lives obtained in this paper are much closer to the actual values than previously published results. A comparison with the Bayesian control chart based on the previously published HMM and the age‐based replacement policy is given to illustrate the superiority of the proposed approach. The results demonstrate that the Bayesian control scheme with two dependent failure modes can detect the gear fault earlier and improve the availability of the system.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.002 | 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".