z-logo
Premium
A Novel Multi‐hidden Semi‐Markov Model for Degradation State Identification and Remaining Useful Life Estimation
Author(s) -
Su Chun,
Shen Jinyun
Publication year - 2013
Publication title -
quality and reliability engineering international
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 62
eISSN - 1099-1638
pISSN - 0748-8017
DOI - 10.1002/qre.1469
Subject(s) - viterbi algorithm , degradation (telecommunications) , computer science , reliability (semiconductor) , hidden markov model , markov chain , identification (biology) , markov model , markov process , state (computer science) , process (computing) , variable (mathematics) , product (mathematics) , data mining , artificial intelligence , reliability engineering , algorithm , machine learning , mathematics , engineering , statistics , power (physics) , geometry , quantum mechanics , biology , operating system , telecommunications , mathematical analysis , physics , botany
With the increase of product reliability, collecting time‐to‐failure data is becoming difficult, and degradation‐based method has gained popularity. In this paper, a novel multi‐hidden semi‐Markov model is proposed to identify degradation and estimate remaining useful life of a system. Multiple fused features are used to describe the degradation process so as to improve the effectiveness and accuracy. The similarities of the features are depicted by a new variable combined with forward and backward variables to reduce computational effort. The degradation state is identified using modified Viterbi algorithm, in which linear function is adopted to describe the contribution of each feature to the state recognition. Subsequently, the remaining useful life can be forecasted by backward recursive equations. A case study is presented, and the results demonstrate the validity and effectiveness of the proposed method. Copyright © 2012 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here