Sage Journals: Discover world-class research

Abstract

To improve the accuracy of fault diagnosis of bearing, the improved particle swarm optimization variational mode decomposition (VMD) and support vector machine (SVM) models are proposed. Aiming at the convergence effect of particle swarm optimization (PSO), dynamic inertia weight, and gradient information are introduced to improve PSO (IPSO). IPSO is used to optimize the optimal number of VMD modal components and the penalty factor, which is applied to the vibration signal decomposition. The fault sample set is constructed by calculating the multi-scale information entropy of each component signal obtained from the bearing vibration signals. At the same time, IPSO is used to optimize the support vector machine (IPSO-SVM), which is used to bearing fault diagnosis. The time-domain feature data set is used as the comparison data set, and the classical PSO, genetic algorithm, and cross-validation method are used as the comparison algorithm to verify the effectiveness of the method in this paper. The research results show that the optimized VMD can effectively decompose the vibration signal and can effectively highlight the fault characteristics. IPSO can increase the accuracy by 2% without adding additional costs. And the accuracy, volatility, and convergence error of IPSO are better than comparison algorithms.

Keywords

Bearing fault diagnosis particle swarm optimization VMD SVM

Introduction

The rotor system in large rotating machinery such as aero-engine is the power source of the entire machinery, and its supporting points are very prone to failure when working under alternating load conditions all year round. Especially for thermal rotating machinery such as aero-engine, the supporting point bearings have become the focus of research by many scholars at home and abroad due to the working conditions, installation positions, and the large dispersion of their own life.¹

The performance state of the bearing determines whether the rotor system can operate stably, and the traditional oil analysis method as one of the means of detecting the performance state of the industrial bearing, its technical means have gradually matured.² However, because the results of the oil analysis method are affected by the bearing failure status, inspectors, etc., and cannot detect early bearing failures, Mingfu et al.³ conducted research based on rotor dynamics and found that the vibration characteristics of the machinery can reflect the performance of the machinery status. Subsequently, vibration signal analysis is gradually applied to the field of bearing fault diagnosis. Many scholars collect vibration signals from the laboratory simulation platform, and combine them with spectrum analysis,⁴ wavelet transformation,⁵ time-frequency domain characteristics,⁶ machine learning,^6,7 and other algorithms to study fault vibration signals, and achieved rich results. However, due to the location of the bearings of rotating machinery such as aero-engine, the vibration sensor cannot be directly installed on the bearing seat. Therefore, the vibration signal collected by the sensor installed on the casing has obvious coupling, especially in the early failure of the bearing is more likely to be overwhelmed by noise.

For the above situation, algorithms such as empirical mode decomposition (EMD),^8,9 blind source decomposition,¹⁰ local mean value (LMV)¹¹ have been applied to the analysis of bearing fault vibration signals, and have achieved fruitful results with the efforts of many scholars.^8–11 EMD has problems such as lack of strict mathematical theory foundation, end effect, modal aliasing, over-envelope, etc.¹² LMV cannot avoid the problem of the false component signal.¹³ Because of the problems existing in the above algorithm, Dragomiretskiy and Zosso¹⁴ proposed a non-recursive Variational Mode Decomposition (VMD) method with strict mathematical proof in 2014. This method can accurately decompose signals, and has the advantages of low modal aliasing and high computational efficiency, so it has been widely used. Because the decomposition accuracy of VMD is affected by the number of component signal and penalty parameters, many scholars have proposed to use some optimization algorithm to optimize VMD, such as genetic algorithm,¹⁵ wolf pack algorithm,¹⁶ grasshopper optimization algorithm,¹⁷ and so on. However, these optimization algorithms also have their shortcomings. For example, genetic algorithms have a large number of calculations and are easy to block local extreme values.² And, after the analysis of vibration signals by the optimized VMD, it is necessary to perform spectrum analysis on the component signal to identify the fault category, which is particularly cumbersome.¹⁸

Based on the above reasons, this paper proposes an improved particle swarm optimization algorithm to optimize the diagnosis model of VMD and SVM. Considering that the particle swarm optimization algorithm is easy to fall into the local extreme value, which leads to the phenomenon of convergence effect,¹⁹ the dynamic inertia weight, and gradient information are introduced to improve the particle swarm optimization algorithm. Due to component failure occurs, its vibration signal has a shock vibration characteristic, which leads to a sparse characteristic of the vibration signal, and its information entropy can reflect this characteristic. Therefore, information entropy of VMD component signal as the fitness function, and improved particle swarm optimization algorithm is used to optimize the number of modal component signal and penalty parameter of VMD. The vibration signal is decomposed by optimized VMD, and the multi-scale entropy of each component is calculated to construct the fault sample data set. And the fault sample is diagnosed by the improved particle swarm optimized SVM.

In the model proposed in this paper, the improved particle swarm optimization algorithm is fully used to optimize VMD and SVM, which can effectively improve the accuracy of VMD’s decomposition of vibration signals and the classification accuracy of the SVM model for fault samples. At the same time, the multi-scale entropy, which can highlight the characteristics of vibration faults more than the time-frequency domain characteristic parameters, is used to construct the input data set of the IPSO-SVM model, which further increase the identification of the fault from the data source itself. Therefore, the method proposed in this paper can achieve more than 98% accuracy. The IPSO can obtain a better optimization effect than the PSO without adding additional time-consuming.

The rest of this paper is organized as follows: Section II introduces the theory of VMD and optimized VMD, and optimized VMD verification test. Section III introduces the theory of SVM. Section IV introduces the theory of improved particle swarm optimization algorithm and optimized support vector machine. Section V contains the bearing fault diagnosis process, bearing experiment, and diagnosis analysis results. Section VI concludes the proposed diagnosis method in this paper.

Optimized VMD

When rotating machinery is running, the signals collected by vibration sensors are mostly coupling signals due to the influence of other components. And the vibration characteristics of early weak faults of rotating machinery are more likely to be submerged in noise signals so that it is difficult to analyze mechanical fault characteristics through vibration signals. The variational modal algorithm proposed by Dragomiretskiy and Zosso¹⁴ in 2014 year can effectively decompose multi-coupled signals, which helps identify vibration characteristics of weak faults.

What is a VMD?

The goal of VMD is to decompose a real-valued input signal x(t) into a discrete number of sub-signals (modes) u_k, essentially based on the three concepts of Wiener Filtering, Hilbert Transform and Analytic Signal, Frequency Mixing and Heterodyne Demodulation.¹⁴ Since VMD has carried out a detailed analysis and description in Literature,¹⁴ this paper will not repeat it, but only describes the implementation process of VMD. And the alternate direction method of multipliers (ADMM) is used to alternately update the modal component u_k, the center frequency ω_k, and the Lagrangian multipliers λ(t) to calculate the saddle point of the Lagrangian function. The process is described as follows:

Step 1: Initialize modal components ${u_{k}} = {u_{1}, \dots, u_{k}}$ , the center frequency ${ω_{k}} = {ω_{1}, \dots, ω_{k}}$ , and the Lagrangian multipliers λ(t).

Step 2: Update the modal components u_k, the center frequency ω_k, and the Lagrangian multipliers λ(t) according to equation (1).

u_{k}^{n + 1} (ω) = \frac{f (ω) - \sum_{i < k} u_{k}^{n + 1} (ω) - \sum_{i < k} u_{k}^{n} (ω) + \frac{λ^{n} (ω)}{2}}{1 + 2 α {(ω - ω_{k}^{n})}^{2}}

(1)

ω_{k}^{n + 1} = \frac{\int_{0}^{\infty} ω {| u_{k}^{n + 1} (ω) |}^{2} d ω}{\int_{0}^{\infty} {| u_{k}^{n + 1} (ω) |}^{2} d ω}

(2)

λ^{n + 1} (ω) = λ^{n} (ω) + τ (f (ω) - \sum_{k} u_{k}^{n + 1} (ω))

(3)

Step 3: If $\sum_{k} (‖ u_{k}^{n + 1} - u_{k}^{n} ‖_{2}^{2} / ‖ u_{k}^{n} ‖_{2}^{2}) < ε$ , and the variational modal solution process ends, several modal components signal with finite bandwidth are obtained. Otherwise, Step 2 is repeated.

Optimized VMD

Since the number k of modal components signal u_k and the value of the quadratic penalty factor è have a greater impact on the result of VMD decomposition, PSO is used to optimize VMD. Considering that the particle swarm optimization algorithm is easy to fall into the local extreme value, which leads to the phenomenon of convergence effect,¹⁹ the dynamic inertia weight and gradient information are introduced to improve the particle swarm optimization algorithm. This section describes optimized VMD by Improved PSO, while the improved PSO is described in section IV in this paper.

When the bearing is faulty, there will be periodic shock waves in the vibration signal, which makes the signal show strong sparse characteristics. When the vibration signal contains more noise signals, the periodic shock characteristics in the vibration signal are not obvious, which makes the vibration signal less sparse. When the sparsity of the vibration signal is strong, the envelope entropy value is small. When the sparsity of the vibration signal is weak, the envelope entropy value is larger.¹⁵ The envelope entropy value of each component u_k obtained by VMD is used as the fitness function (equation (4)) of IPSO optimized VMD.

f = - \sum_{j = 1}^{N} ((a (j) / \sum_{j = 1}^{N} a (j)) \lg (a (j) / \sum_{j = 1}^{N} a (j)))

(4)

Where a(j) represents the envelope signal of x(j) after Hilbert Transform.²⁰

The optimized VMD by IPSO is briefly described as follows: the individual with the smallest envelope entropy in the population found in the first iteration, as well as the modal component u_k, the number of components k, and the quadratic penalty factor è corresponding to the individual are regarded as the optimal global optimal solution. In each subsequent iteration, the minimum envelope entropy value obtained this time is compared with the global minimum envelope entropy value. If the current envelope entropy value is smaller than the global envelope entropy value, the individual with the smallest envelope entropy in the population found in this time, as well as the modal component u_k, the number of components k, and the quadratic penalty factor è are regarded as the optimal global optimal solution. Otherwise, the next iteration is executed until the algorithm termination condition is met. When the algorithm satisfies the termination condition, the global optimal solution is used as the optimal parameters of VMD, to realize the optimization of VMD.

Algorithm verification

The simulation signal is used to verify the effect of optimized VMD by the IPSO. In the simulation process, the sampling frequency of the vibration signal is 1024 Hz, and the sampling time lasts 1 s. The simulation signal is obtained by the following formula:

{\begin{matrix} x_{1} = 15 \sin (2 π f_{1} t + φ_{1}) \\ x_{2} = 10 \sin (2 π f_{2} t + φ_{2}) \\ x_{3} = 3 \sin (2 π f_{3} t + φ_{3}) \\ x (t) = x_{1} + x_{2} + x_{3} \\ f_{1} = 120 Hz, f_{2} = 80 Hz, f_{3} = 50 Hz \\ φ_{1} = 5 rad, φ_{2} = 2.5 rad, φ_{3} = 1 rad \end{matrix}

(5)

The simulation signal x(t) and the components of signal x(t) are shown in Figure 1. The optimized VMD by IPSO is used to decompose the signal x(t), and the minimum envelope entropy value of decomposed signal changes with the number of iteration steps as shown in Figure 2. The global minimum envelope entropy value is 0.14218, (k, è) = (3, 1782), so that the number k of modal components u_k in VMD is set to 3, and the quadratic penalty factor è is set to 1782, the vibration signal decomposition result is shown in Figure 3. By comparing Figures 1 and 3, it is found that the VMD decomposition signals are consistent with the components that constitute the x(t) signal, but the component signals obtained by the VMD decomposition have a slight phase shift phenomenon. The result of spectrum analysis of VMD decomposition component signals is shown in Figure 4. It can be seen from Figure 4 that the VMD decomposition components can more accurately find the characteristic frequency multiplication of each component in the signal x(t).

Figure 1.

Simulation signal x(t) and its component signals.

Figure 2.

Minimum envelope entropy value change curve.

Figure 3.

VMD decomposition results of signal x(t).

Figure 4.

Spectrum analysis of VMD component signals.

Support vector machine

To accurately identify the bearing fault from the coupled signal requires not only the effective separation of vibration sources of vibration signals but also a recognition algorithm that can capture fault characteristic information. Support Vector Machine (SVM) can transform low-dimensional linearly inseparable problems into linearly separable problems by mapping them to higher-dimensional Spaces.²¹ In addition, SVM is widely used in all kinds of fault diagnosis because of its simplicity and high efficiency.²² Since SVM is relatively mature and has been described in detail in the literature,²¹ it will not be discussed in this paper.

The penalty parameter c and the kernel parameter g of SVM are the key issues that determine whether the SVM can effectively classify the fault samples. The common solution to this problem is to use random generation, cross-validation, or optimization algorithm to optimize parameters c and g. Literature²¹ shows that these methods have their shortcomings. Therefore, in this paper, the improved particle swarm algorithm optimization is used to optimize SVM, and the optimized SVM is used for bearing fault diagnosis.

Optimized SVM by IPSO

Particle Swarm Optimization (PSO) is an intelligent optimization algorithm obtained by studying the predation behavior of birds. The basic theory of PSO has been described in detail in the literature,²³ so the basic principle is not introduced in this paper. The PSO is easy to fall into the local extreme value, which leads to the phenomenon of convergence effect.¹⁹ And its inertial behavior easily affects the search movement state, which easily reducing its search accuracy. So, Improved Particle Swarm Optimization (IPSO) is proposed in this paper.

What is an IPSO?

When the number of iterations is small, the global search capability should be improved. When the number of iterations is large, the local search capability should be improved. For this reason, we introduce the dynamic inertia weight ω, which dynamically changes the spatial searching ability of particles. Its calculation method is shown in equation (6).

ω = ω_{max} - (ω_{max} - ω_{min}) {(\frac{step}{\max Step})}^{2}

(6)

Where ω_max, ω_min represent the maximum and minimum inertia weights respectively, step represents the current iteration number of the particle, maxStep represents the maximum number of iterations of the particle.

To accelerate the movement of the particles toward the optimal target, we introduce gradient information²⁴ to solve this problem.

Firstly, the fitness function fitness( x ) of PSO optimized SVM is defined, as shown in equation (7).

\begin{matrix} fitness (x) = fitness (x | c, g) = fitness (c, g) \\ = min \sum_{i = 1}^{n} {(f (x | c, g) - f_{o} (x | c, g))}^{2} \end{matrix}

(7)

Where f( x| c,g), f_o( x| c,g) respectively represent the actual output and expected output of the SVM under the penalty parameter c and the kernel parameter g. n represents the number of validation set samples.

Secondly, it is assumed that all partial derivatives of fitness( x ) with respect to the variable x ( x = (c, g)) exist, it can be expressed as equation (8).

\nabla fitness (x) = (\frac{\partial fitness (x)}{\partial c} \frac{\partial fitness (x)}{\partial g})

(8)

When the variables in the target are linear, equation (8) can be expressed as equation (9).

\nabla fitness (x) = (\frac{dfitness (x)}{dc} \frac{dfitness (x)}{dg})

(9)

Suppose the individual vector of the population P is expressed as x ¹, x ²,…, x ^p. For the objective function fitness( x ), the individual vectors are arranged according to the direction of gradient change from large to small. The direction of gradient change can be expressed as equation (10). The greater the gradient mode length, the greater the direction change rate. So, the particle position in the particle swarm is updated according to equation (11).

\nabla gra = min (| \frac{dfitness (x)}{dc} |, | \frac{dfitness (x)}{dg} |)

(10)

x (k | t + 1) = x (k | t) - 0.01 \times v (t) \cdot \nabla gra

(11)

Where x(k|t+1), x(k|t) respectively represent the position of the k-th variable in the individual at time t + 1 and time t, v(t) represents the velocity of the particle at time t.

In this way, the particle can search along with the optimal target.

Optimized SVM by IPSO

The flow chart of Optimized SVM by IPSO is shown on the right of Figure 5, which consists of the IPSO optimization part and the SVM network part. The error of SVM network diagnostic validation set samples is taken as the fitness function (equation (7)) of IPSO optimization of SVM. And the penalty parameter c and kernel parameter g that minimize the validation set error are found through continuous iteration of IPSO, to realize the optimization of SVM. The steps of the IPSO-SVM network algorithm are described as follows:

Step 1: The penalty parameter c and kernel parameter g of SVM are used as the variables optimized by IPSO, that is, each particle contains two particle genes. The particle population variables are coded with real numbers and are initialized randomly.

Step 2: The fitness value of the population is calculated according to equation (7). And the local optimal solution of the individual is found.

Step 3: Calculate and sort the individual vector gradients, update the particle position according to equation (11), and update the position of the optimal individual in real-time.

Step 4: Determine whether the termination conditions are met, if not, repeat steps 2–3. If so, output the optimal individual and assign it to the penalty parameter c and kernel parameter g of the SVM.

Figure 5.

Bearing fault diagnosis process based on IPSO optimized VMD and SVM models.

Bearing fault diagnosis base on optimized VMD and SVM

Bearing fault diagnosis process

The bearing fault diagnosis process based on IPSO optimized VMD and SVM models are shown in Figure 5. The process is mainly composed of three parts, including IPSO (middle), optimized VMD by IPSO (left), and optimized SVM by IPSO (right).

The process is briefly described as follows: Firstly, the vibration signals of bearing faults under different working conditions are collected through the laboratory bearing fault simulation platform. Secondly, IPSO is used to optimize the modal number and penalty parameters of VMD. Thirdly the optimized VMD is used to decompose the vibration signal under different working conditions, and the multi-scale entropy of each component is calculated to construct the fault characteristic sample data. IPSO is used to optimize SVM, and the optimized SVM is used for bearing fault diagnosis.

Bearing experiment

The bearing experimental platform is shown in Figure 6. The bearing vibration signal data under different working conditions are collected from the platform to verify the effectiveness of the optimized VMD and SVM models based on IPSO.

Figure 6.

Bearing experiment platform.

In the experiment, the rotor speed is 988 rpm; and each cycle sensor samples 1024 points; and each experiment collects 16 cycles. In the experiment, four types of bearing faults vibration signal are simulated, including normal, inner ring fault, outer ring fault, and rolling element fault. The bearing size and simulation fault information used in the experiment are shown in Table 1. And the time domain signals of the four-fault types are shown in Figure 7.

Table 1.

Bearing size and simulation fault information.

Bearing type	Roller diameter	Bearing inner diameter	Bearing outer diameter	Number of rollers	Contact angle
307	14.5 mm	35 mm	80 mm	7	0°
Fault types	Label	Fault size	Training set	Validation set	Test set
Normal	1	0	1000	400	100
Rolling element	2	0.5 mm	1000	400	100
Inner ring	3	0.25 mm	1000	400	100
Outer ring	4	0.25 mm	1000	400	100

Figure 7.

Time domain signal under different working conditions.

Data set preparation

The VMD method optimized by IPSO is used to decompose the vibration signal. The vibration signal components of VMD and its spectrum diagrams under different working conditions are shown in Figure 8. As can be seen from Figure 8, the modal spectrum diagrams of each component under each working condition do not overlap obviously, and each component has different central frequency bands, which shows that the VMD optimized by IPSO can effectively decompose the vibration signal of the different working condition.

Figure 8.

Vibration signal decomposition results based on optimized VMD method.

Although the optimized VMD can effectively decompose the vibration signal, for identifying the bearing fault characteristic frequency, it is necessary to calculate its inherent characteristic frequency according to the size of the bearing, and then identify the bearing fault through the frequency spectrum.¹ The above method is not universal because the bearing fault characteristic frequency changes due to changes in bearing size. Therefore, the characteristic data set is constructed by calculating the multi-scale entropy (MSE) of each component. Based on the research conclusion in literature,²⁵ when calculating MSE in this paper, the embedding dimension is 6 and the value of a multi-scale factor is 12, so the characteristic matrix of 4× (12 × 6) can be obtained. In the data set, the normal condition label is 1, the outer ring fault label is 2, the rolling element fault label is 3, and the inner ring fault label is 4. The ratio of training set samples, validation set samples, and test set samples are 3:1:2.

To avoid errors caused by order of magnitude and dimension problems between characteristic parameters to diagnosis results, the samples are normalized according to equation (11).

x = \frac{x_{i} - x_{min}}{x_{max} - x_{min}}

(11)

Where x_max, x_min respectively represent the maximum and minimum values of a certain characteristic parameter. x_i represents the i-th value of a certain type of characteristic parameter. x represents the normalized value.

The time-domain characteristic parameters² set is used as the comparison data set of VMD multi-scale entropy, and the classical particle swarm optimization algorithm (PSO), genetic algorithm (GA), and cross-validation algorithm are used as the comparison optimization algorithm to optimize SVM. The effectiveness of this method is verified from two aspects of the data set and optimization algorithm.

The cross-validation SVM algorithm is denoted as GridSearchSVM, and its cross-validation samples are validation sets. The optimized SVM by PSO is denoted as PSO-SVM. The parameters setting of PSO are the same as IPSO, including c1 = c2 = 1.5, the number of iteration maximum step is 100, the size of particle swarm is 30, the maximum weight is 0.9, and the minimum weight is 0.4, the maximum search speed of particles is 10, the minimum search speed is −10, and the optimization parameter is 2. The optimized SVM by the genetic algorithm is denoted as GA-SVM. And its maximum iteration step is 100, the population size is 30, the crossover probability is 0.6, the mutation probability is 0.05, and the optimization parameter is 2. The kernel function used in SVM is the radial basis function.

Diagnosis accuracy analysis

The bearing fault samples are diagnosed by several algorithms mentioned in the previous section. And its diagnostic results of several algorithms are shown in Table 2. Note: To avoid the difference in the diagnosis result caused by the inconsistency of the population initialization in the algorithm, so based on the same data set and algorithm, the average value of the repeated diagnosis 30 times is used as the result evaluation standard. As shown in Table 2, the optimal results of each item in the algorithm have been marked in bold, and its visualization is shown in Figure 9. From Table 2 and Figure 9, it can be found that under the VMD multi-scale entropy or time-domain characteristics data set, the diagnostic method proposed in this paper has the best effect. And its diagnostic accuracy for different fault types has reached more than 98%, while other diagnostic methods are relatively poor. Compared with PSO, the accuracy of the IPSO is improved by about 2%, and there is no obvious difference in time consumption. The diagnostic accuracy of GA is second only to the IPSO. And its diagnostic results are consistent with the conclusions of the literature.²¹ But the GA is relatively time-consuming. The diagnosis effect of SVM optimized by cross-validation method is relatively poor. However, because the cross-validation method avoids the iterative process in the optimization algorithm, its calculation speed is faster than other algorithms. For fault diagnosis, it is acceptable to get effective recognition results by spending acceptable consumption, so the algorithm proposed in this paper has more advantages in bearing fault diagnosis.

Table 2.

Diagnosis results of different algorithms.

Data set	Algorithms	Accuracy of the test set (%)					The error of validation set	Average time (s)
Data set	Algorithms	Inner ring	Outer ring	Rolling element	Normal	Overall	The error of validation set	Average time (s)
VMD multi-scale entropy	IPSO-SVM	98.37781395	98.5827222	98.599066	98.60251356	98.54052893	0.022909944	19.5389142
	PSO-SVM	96.74016332	96.65543476	96.76978443	96.36779391	96.63329411	0.028819889	20.327842
	GA-SVM	97.49076608	97.52375606	97.58072638	97.52226213	97.52937766	0.025123204	23.50885988
	GridSearchSVM	92.55605375	93.19406761	92.63204271	93.04650507	92.85716729	\	11.856216
Time-domain	IPSO-SVM	97.49177882	97.54216516	97.60680936	97.68125942	97.58050319	0.108293613	20.622913
	PSO-SVM	96.58567714	96.43046389	96.34717905	96.59536066	96.48967019	0.172505816	18.51044887
	GA-SVM	96.92877384	97.23169526	97.00887239	97.06512435	97.05861646	0.127233811	23.4368577
	GridSearchSVM	92.85570014	93.05175949	93.26803097	92.75308319	92.98214345	\	12.433882

Figure 9.

Diagnosis results of different algorithms.

As shown in Table 2, under two different data sets, the diagnostic results of IPSO-SVM and GA-SVM models are not significantly different, which the IPSO-SVM model does not show obvious advantages. The reasons for this phenomenon are as follows. Firstly, from the perspective of the data itself, multi-scale entropy can highlight the fault characteristics of vibration signals more than time-domain characteristics. Secondly, the essence of IPSO-SVM and GA-SVM models is the SVM model. Therefore, there is no essential difference in the structure of the SVM model except for the penalty parameter and the kernel parameter of the SVM model. Under the same data source, if the penalty parameters and kernel parameters of the two SVM models are set the same, the SVM model will get the same result. Thirdly, compared with the particle swarm optimization algorithm, the genetic algorithm makes its population types more diverse due to the existence of mutation and crossover mode. So, it is easier to search for extreme value. Based on the above reasons, the diagnostic results of IPSO-SVM and GA-SVM models are not much different. However, the particle swarm optimization algorithm is simpler and faster than the genetic algorithm. Therefore, this is also the main purpose of this paper to choose the optimization algorithm.

In addition, in terms of diagnostic results. Under the validation data set, the average convergence error of the IPSO-SVM model is the smallest and reaches 0.022909944. The diagnosis time of the IPSO-SVM model is also reduced by 1–2 s compared with the PSO-SVM model. At the same time, the diagnostic accuracy of the IPSO-SVM model for different faults reaches more than 98%, while the best diagnosis effect of other algorithms can only reach 97%. This shows the effectiveness of the IPSO-SVM model.

Analysis of algorithm stability

Because of the randomness of the initial population of the intelligent optimization algorithm, the results of each diagnosis are different. So, the fluctuation of the intelligent optimization algorithm is analyzed. The diagnosis results of IPSO, PSO, and GA 30 times are shown in Figure 10. It can be seen from Figure 10 that the fluctuation of diagnosis results is within 3% no matter what kind of data set. Under VMD multi-scale entropy data set, the fluctuation of the diagnosis algorithm is smaller than that under the time-domain characteristics set, which may be because vibration signal is composed of multiple vibration sources. It is impossible to express various fault characteristics accurately by extracting the time domain statistical characteristics directly from the original vibration signal, which makes the characteristics data set have some common linearity. So, the diagnosis algorithm cannot accurately capture the characteristic details, which leads to larger fluctuation. On the contrary, after the vibration signal is decomposed by VMD, the differences between the characteristics are obvious. And the diagnosis algorithm can accurately capture the characteristics, thus making the difference of diagnosis result of different algorithms smaller.

Figure 10.

The diagnosis results of IPSO, PSO, and GA for 30 times.

Algorithm diagnosis error analysis

Based on VMD multi-scale entropy data set, the average convergence error trend of several algorithms is shown in Figure 11. It can be seen from error trend Figure 11 that IPSO, PSO, and GA can converge to smaller error values. However, the IPSO has a faster convergence speed, and it can be seen from Table 2 that the convergence error value of the IPSO is smaller. Therefore, through diagnosis accuracy analysis, stability analysis, and error analysis, it can be found that the method proposed in this paper can better diagnose bearing faults.

Figure 11.

The average convergence error trend of algorithms.

Conclusion

Aiming at the reasons for weak signal, multi-coupling, and difficulty in bearing fault diagnosis, an improved particle swarm optimization algorithm is proposed to optimize the diagnosis model of VMD and SVM in this paper.

Considering that particle swarm optimization is easy to fall into local extremum and lead to convergence effect, dynamic inertia weight is introduced to change particle searching ability and gradient information is introduced to strengthen particle searching toward the optimal solution. When a mechanical component fails, its vibration signals show shock characteristics, which leads to sparse characteristics of the vibration signal. And information entropy of the vibration signal can reflect this phenomenon. Therefore, based on this point, the adaptability function of IPSO to optimized VMD is constructed. To improve the accuracy of bearing fault diagnosis, the multi-scale entropy of components signal obtained from vibration signals decomposed by VMD is calculated. Based on the multi-scale entropy, the fault characteristic data set is constructed. The optimized SVM by IPSO is used to realize the diagnosis of bearing fault samples.

The research results show that the method proposed in this paper can effectively identify bearing faults, and its diagnostic accuracy is over 98%. The data set constructed with VMD components is more effective than the time-frequency domain feature data set. It is easier to highlight the fault characteristics of the vibration signal and is more conducive to fault diagnosis and recognition. The IPSO can obtain a better optimization effect than the PSO without adding additional time-consuming.

Footnotes

Handling editor: Carmen Bujoreanu

Declaration of conflicting interests

The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The author(s) received no financial support for the research, authorship, and/or publication of this article.

ORCID iD

Qingfeng Zhang

References

Sheng

. Applied research on aeroengine bearing fault diagnosis based on extreme learning machine. Master’s thesis, Civil Aviation University of China, Tianjin, 2019.

Jun

Sheng

Jiacheng

, et al. Rolling bearing fault diagnosis based on IGA-ELM network. Acta Aeronaut Astronaut Sin 2018; 39: 233–244.

Mingfu

Dali

Jianming

, et al. Structure dynamics design method of aero-engine high pressure rotor. J Aerosp Power 2014; 29: 1505–1519.

Jun

Jiaze

Guangcai

Analysis of aero-engine vibration signal. J Syst Simul 2020; 32: 525–532.

Jun

Liming

Chao

Aero-engine fault diagnosis based on one-class classification and wavlet fractal. J Propulsion Technol 2007; 28: 82–85.

Jun

Sheng

Xubo

, et al. Application of BQGA-ELM network in the fault diagnosis of rolling bearings. J Vib Shock 2019; 38: 192–200.

Jun

Peng

Sheng

, et al. Aero-engine bearing fault diagnosis based on MGA-BP neural network. J Vib Meas Diagn 2020; 40: 381–388+423.

Huang

Shen

Long

, et al. The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis. Proc R Soc Lond A Math Phys Eng Sci 1998; 454: 903–995.

Junbai

Yongzhi

Yong

, et al. Fault diagnosis of airborne fuel pump based on EMD and SVM. J Beijing Univ Aeronaut Astronaut 2021: 1–14. DOI: 10.13700/j.bh.1001-5965.2020.0620.

10.

Xiaoping

Mingfu

. Vibration signal separation techniques for double rotor aero-engines. Mech Sci Technol 2006; 025: 487–490+496.

11.

Guiji

Xiaolong

. Variational mode decomposition method and its application on incipient fault diagnosis of rolling bearing. J Vib Eng 2016; 29: 638–648.

12.

Ling

Xiaoan

. Performance contrast between LMD and EMD in fault diagnosis of turbine rotors. J Chin Soc Power Eng 2014; 34: 945–951.

13.

Junsheng

Songrong

Bin

, et al. LMD energy moment and variable predictive model based class discriminate and their application in intelligent fault diagnosis of roller bearing. J Vib Eng 2013; 26: 751–757.

14.

Dragomiretskiy

Zosso

. Variational mode decomposition. IEEE Trans Signal Process 2014; 62: 531–544.

15.

Jie

. Fault diagnosis of bearing combining parameter optimized variational mode decomposition based on genetic algorithm with 1.5-dimensional spectrum. J Propulsion Technol 2017; 38: 1618–1624.

16.

Jiaoxin

Can

Yongcun

, et al. Fault diagnosis of bearing based on VMD and SVM optimized by GWO. Coal Mine Mach 2021; 42: 147–150.

17.

Jianhai

Jing

, et al. Fault feature extraction method of rolling bearing based on parameter optimized VMD. J Vib Shock 2021; 40: 86–94.

18.

Jun

. Vibration characteristic analysis and intelligent fault diagnosis of gearboxes. Doctor’s thesis, Zhejiang University, Zhe Jiang, 2018.

19.

Huixuan

Hong

. Application design of MATLAB neural network. Beijing, China: Machinery Industry Press, 2010.

20.

Guiji

Xiaolong

. Parameter optimized variational mode decomposition method with application to incipient fault diagnosis of rolling bearing. J Xi’an Jiaotong Univ 2015; 49: 73–81.

21.

Jun

Sheng

Jiacheng

, et al. Application of genetic algorithm optimized SVM in aeroengine wear fault diagnosis. Lubr Eng 2018; 43: 89–97.

22.

Chunhua

Hengxing

Baojia

, et al. Bearing fault diagnosis based on the deep learning feature extraction and WOA SVM state recognition. J Vib Shock 2019; 38: 31–37+48.

23.

Jun

Jiangbo

. Aero-engine fault diagnosis based on IPSO-Elman neural network. J Aerosp Power 2017; 32: 3031–3038.

24.

Liu

Zhong

, et al. A multi-objective optimization algorithm based on gradient information. CIESC J 2013; 64: 4401–4409.

25.

Xiantai

Changxi

Weidong

. Fault diagnosis method for high-speed train lateral damper based on variational mode decomposition and multiscale entropy. J Vib Meas Diagn 2019; 39: 292–297+442.

Bearing fault diagnosis based on improved particle swarm optimized VMD and SVM models

Abstract

Keywords

Introduction

Optimized VMD

What is a VMD?

Optimized VMD

Algorithm verification

Support vector machine

Optimized SVM by IPSO

What is an IPSO?

Optimized SVM by IPSO

Bearing fault diagnosis base on optimized VMD and SVM

Bearing fault diagnosis process

Bearing experiment

Data set preparation

Diagnosis accuracy analysis

Analysis of algorithm stability

Algorithm diagnosis error analysis

Conclusion

Footnotes

Declaration of conflicting interests

Funding

ORCID iD

References