A Novel Sampling Method Based on Normal Search Particle Swarm Optimization for Active Learning Reliability Analysis

In active learning reliability methods, an approximation of limit state function (LSF) with high precision is the key to accurately calculating the failure probability (P-f). However, existing sampling methods cannot guarantee that candidate samples can approach the LSF actively, which lowers the accuracy and stability of the results and causes excess computational effort. In this paper, a novel candidate samples-generating algorithm was proposed, by which a group of evenly distributed candidate points on the predicted LSF of performance function (either the real one or the surrogate model) could be obtained. In the proposed method, determination of LSF is considered as an optimization problem in which the absolute value of performance function was considered as objective function. After this, a normal search particle swarm optimization (NSPSO) was designed to deal with such problems, which consists of a normal search pattern and a multi-strategy framework that ensures the uniform distribution and diversity of the solution that intends to cover the optimal region. Four explicit performance functions and two engineering cases were employed to verify the effectiveness and accuracy of NSPSO sampling method. Four state-of-the-art multi-modal optimization algorithms were used as competitive methods. Analysis results show that the proposed method outperformed all competitive methods and can provide candidate samples that evenly distributed on the LSF.

Automated summary

In active learning reliability methods, obtaining an approximation of the limit state function (LSF) with high precision is crucial for accurately calculating the failure probability (P-f). Existing sampling methods do not ensure active approach to the LSF, leading to decreased accuracy and stability in results and increased computational effort. This study proposes a novel candidate samples-generating algorithm that obtains a group of evenly distributed candidate points on the predicted LSF of performance function. It uses a normal search particle swarm optimization (NSPSO) to address the optimization problem of determining the LSF, achieving uniform distribution and diversity of the solution.