.png){kind=icon}
Return
A Bayesian model and numerical algorithm for CBM availability maximization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-011-1013-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we consider an availability maximization problem for a partially observable system subject to random failure. System deterioration is described by a hidden, continuous-time homogeneous Markov process. While the system is operational, multivariate observations that are stochastically related to the system state are sampled through condition monitoring at discrete time points. The objective is to design an optimal multivariate Bayesian control chart that maximizes the long-run expected average availability per unit time. We have developed an efficient computational algorithm in the semi-Markov decision process (SMDP) framework and showed that the availability maximization problem is equivalent to solving a parameterized system of linear equations. A numerical example is presented to illustrate the effectiveness of our approach, and a comparison with the traditional age-based replacement policy is also provided.
Keywords:
Availability maximization
Semi-Markov decision process
Hidden Markov model
Condition-based maintenance
Multivariate Bayesian control chart
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more