.png){kind=icon}
Return
A new algorithm for prognostics using Subset Simulation
.png){kind=icon}
OA
AI
DOI：10.1016/j.ress.2017.05.042.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work presents an efficient computational framework for prognostics by combining the particle filter-based prognostics principles with the technique of Subset Simulation, first developed in S.K. Au and J.L. Beck [Probabilistic Engrg. Mech., 16 (2001), pp. 263-2777, which has been named PFP-SubSim. The idea behind PFP-SubSim algorithm is to split the multi-step-ahead predicted trajectories into multiple branches of selected samples at various stages of the process, which correspond to increasingly closer approximations of the critical threshold. Following theoretical development, discussion and an illustrative example to demonstrate its efficacy, we report on experience using the algorithm for making predictions for the end-of-life and remaining useful life in the challenging application of fatigue damage propagation of carbon-fibre composite coupons using structural health monitoring data. Results show that PFP-SubSim algorithm outperforms the traditional particle filter-based prognostics approach in terms of computational efficiency, while achieving the same, or better, measure of accuracy in the prognostics estimates. It is also shown that PFP-SubSim algorithm gets its highest efficiency when dealing with rare-event simulation. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Prognostics
Rare events
Stochastic modeling
Subset Simulation
Journal
R
IF:
11
Papers:
9.0K
Citations:
5.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more