Abstract

Most of the existing methods for estimating time-dependent failure credibility (TDFC) are based on optimization algorithms, which may result in a heavy burden on the computational cost and accuracy issue related to the local optimization. In order to achieve the best compromise between computational accuracy and cost, an efficient method is proposed in this work by embedding a single-loop adaptive Kriging model (S-AK) into the dichotomy searching algorithm (S-AK-DSA). The proposed S-AK-DSA can be regarded as a double-loop procedure. In the inner loop, the Kriging model of the real time-dependent performance function (TD-PF) is updated iteratively to accurately predict the signs of the upper/lower boundary of the TD-PF minimum with respect to the time variable at the given membership level. Based on the inner loop, the outer loop searches TDFC by continuously dichotomizing the searching interval of the TDFC. The advantages of S-AK-DSA are mainly manifested in two aspects. Firstly, S-AK-DSA converts the problem of optimizing the exact value of the upper/lower boundary into the problem of accurately identifying their signs, which can avoid the use of optimization algorithms. Secondly, at different membership levels, the S-AK-DSA method chooses the candidate sample pool and continuously updates the current Kriging model of TD-PF, and the adaptive learning function as well as appropriate stopping criterion can effectively reduce the cost of predicting the signs of the upper/lower boundary and improve the computational accuracy. Four case studies are introduced to demonstrate the feasibility and superiority of the proposed S-AK-DSA approach.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.