An approximate algorithm for prognostic modelling using condition monitoring information
Established condition based maintenance modelling techniques can be computationally expensive. In this paper we propose an approximate methodology using extended Kalman-filtering and condition monitoring information to recursively establish a conditional probability density function for the residual...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 211; číslo 1; s. 90 - 96 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
16.05.2011
Elsevier Elsevier Sequoia S.A |
| Edice: | European Journal of Operational Research |
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Established condition based maintenance modelling techniques can be computationally expensive. In this paper we propose an approximate methodology using extended Kalman-filtering and condition monitoring information to recursively establish a conditional probability density function for the residual life of a component. The conditional density is then used in the construction of a maintenance/replacement decision model. The advantages of the methodology, when compared with alternative approaches, are the direct use of the often multi-dimensional condition monitoring data and the on-line automation opportunity provided by the computational efficiency of the model that potentially enables the simultaneous condition monitoring and associated inference for a large number of components and monitored variables. The methodology is applied to a vibration monitoring scenario and compared with alternative models using the case data. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0377-2217 1872-6860 |
| DOI: | 10.1016/j.ejor.2010.10.023 |