Reliability-Box of Systems Under Model Parameter Uncertainty Based on Evidential Variable and Evidential Network
Hongping Yu, Li Mo, Yue Zhao
IEEE Access · 2022
doi:10.1109/access.2022.3206531 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Advanced engineering systems possess a large number of components with complicated failure dependencies. To accurately assess the system reliability, the degradation models of components should be known in advance and the model parameters should be accurately estimated via a large quantity of historical time-to-failure data. In real-world situations, due to limited data, lack of knowledge, and vague judgments from experts, components’ degradation model parameters are, however, inevitably encountered with epistemic uncertainty and oftentimes quantified as evidential variables. In this article, upper and lower bounds of system reliability, termed as reliability-box, are estimated when components’ degradation model parameters are elicited from experts and quantified by evidential variables. In the first place, the constrained optimization model is leveraged to assess the reliability-box of each component by giving the evidential variable of the component’s degradation model parameters. Next, based on the system structure, the evidential network of the system is constructed to propagate the epistemic uncertainty from the component level to the system level. Therefore, the focal elements of the evidential variable of system reliability, i.e., the system reliability bounds, can be assessed via the belief and plausibility functions to the mass function of the leaf node of the evidential network. The effectiveness of the proposed methods is demonstrated by a rolling system in the chip cutting detection module.
Abstract licence: CC BY-NC-ND
References38
38 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.