IBPSO-Based MUSIC Algorithm for Broken Rotor Bars Fault Detection of Induction Motors

Abstract

In spectrum analysis of induction motor current, the characteristic components of broken rotor bars (BRB) fault are often submerged by the fundamental component. Although many detection methods have been proposed for this problem, the frequency resolution and accuracy are not high enough so that the reliability of BRB fault detection is affected. Thus, a new multiple signal classification (MUSIC) algorithm based on particle swarm intelligence search is developed. Since spectrum peak search in MUSIC is a multimodal optimization problem, an improved bare-bones particle swarm optimization algorithm (IBPSO) is proposed first. In the IBPSO, a modified strategy of subpopulation determination is introduced into BPSO for realizing multimodal search. And then, the new MUSIC algorithm, called IBPSO-based MUSIC, is proposed by replacing the fixed-step traversal search with IBPSO. Meanwhile, a simulation signal is used to test the effectiveness of the proposed algorithm. The simulation results show that its frequency precision reaches 10⁻⁵, and the computational cost is only comparable to that of traditional MUSIC with 0.1 search step. Finally, the IBPSO-based MUSIC is applied in BRB fault detection of an induction motor, and the effectiveness and superiority are proved again. The proposed research provides a modified MUSIC algorithm which has sufficient frequency precision to detect BRB fault in induction motors.

1 Introduction

Induction motors are essential components and play an irreplaceable role in industrial production process [1]. Although this motor is simple-structure, low-cost, reliable and robust, it is also prone to failure due to reasons, such as harsh working environment, internal incipient defects [2]. Broken rotor bars (BRB) or end ring cracking is one of the most common faults of induction motor, which accounts for about 10% of all failures [3]. This percentage is inconspicuous, but BRB fault will not only reduce the efficiency, but also cause other faults, such as bearing fault, air-gap eccentricity [4]. In severe cases, broken pieces of the rotor bar may even damage the stator windings during operation [5]. Therefore, rotor fault detection of induction motor in early stage is essential and significant.

When broken bars occur, new sideband components at f_brk= (1 ± 2ks)f₁ Hz will appear in the stator current spectrum, where k= 1, 2, 3,…, f₁ is the supply frequency and s is the motor slip [6]. So the sideband components can be regarded as fault characteristics, and their frequency detection is key to identify the BRB fault. However, the strongest fault-related components at (1 ± 2s)f₁ Hz are quite close to fundamental component due to small slip value and their amplitudes are relatively small, which make them easy to be submerged by the leakage of fundamental component, reducing the reliability of BRB fault detection. In addition, their signal property differs significantly under various motor-working conditions. When motor runs in steady state, the values of f_brk are almost constant, and when motor is running in transient state, such as start up or load change, the values of f_brk are variable, that is to say, the fault-related components are non-stationary signals. For these two different properties of stator current, scholars have adopted many different signal processing methods.

In transient state, promising results have been obtained through approaches based on short-time Fourier transform [7], continuous or discrete wavelet transform [7, 8], fractional Fourier transform [9], complex empirical mode decomposition [10] and Synchrosqueezing transform [11]. Yet, the frequency resolution and accuracy of these methods are low, which restrict their applications.

For steady state of induction motor, spectrum analysis based on discrete Fourier transform (DFT) is the most popular method for BRB fault detection. However, in this case, the influence of spectrum leakage of fundamental component is more serious due to smaller slip value. To solve this problem, many distinctive methods have been developed, such as instantaneous power [12], particle swarm optimization [13] and Hilbert transform [14]. The main idea of these methods is to filter the fundamental component or convert it into a DC component from current signal. Then DFT is implemented to highlight the fault characteristics. Although these methods based on DFT analysis can eliminate the influence of fundamental component, their performances are restricted by DFT own shortcomings. For example, the frequency resolution is limited by measurement time, namely, high frequency resolution needs to be ensured with a long enough measurement time. If the signal measurement period is too long, the probability of load fluctuations, noise and other interference factors will be increased, which will affect the accuracy of fault detection [15].

As one of the modern spectrum estimation methods, multiple signal classification (MUSIC) algorithm has a capability of original signal extrapolation and high frequency resolution. Therefore, MUSIC has been introduced into the BRB fault detection of induction motor. Garcia-Perez et al. [16] applied MUSIC to multiple faults detection of induction motor. On the basis of MUSIC, Fang et al. [17] moved the maximum eigenvector of fundamental component into noise subspace to constitute a new noise space. The results indicate that this method not only eliminates the influence of fundamental component, but also improves the frequency resolution. ZMUSIC method based on the frequency spectrum zooming technique and MUSIC was presented by Kia et al. [18], to further improve the frequency resolution and computational efficiency. A hybrid scheme based on MUSIC and empirical mode decomposition was proposed by Camarena-Martinez et al. [19], to detect multiple faults of induction motor. Romero-Troncoso et al. [20] detected rotor unbalance fault using a hybrid MUSIC method combined with complete-ensemble-EMD. Another method that combined optimization algorithm with MUSIC was presented by Xu et al. [21]. It solved the problem that MUSIC couldn’t compute the amplitudes and phases of components. However, when the MUSIC is used in BRB fault detection, its efficiency of spectrum peak search is low due to fixed-step and traversal search.

Particle swarm optimization (PSO) is an emerging global optimization technology proposed by Kennedy et al. [22], in 1995. Because of the advantages of simple concept, easy realization, effective solution to complex problems, PSO has been widely applied in practical engineering problems, such as structural optimization [23], design optimization, PID controller tuning, stretch force trajectory optimization and parameter optimization [24]. However, the standard PSO and most improved algorithms are designed to deal with the problem which includes only one global optimal solution in search space. They are not suitable for searching multiple extremes, such as searching spectrum peaks in MUSIC. To optimize multimodal problem, scholars have introduced niche technology into evolutionary algorithm, and accordingly presented many strategies [25, 26], such as pre-selection technique, crowding strategy, fitness sharing, species conservation, but several issues still remain. For instance, low convergence speed and precision, trapped in local optimum and error fluctuation may compromise the optimization results.

This paper tries to improve PSO and take the advantages of PSO and MUSIC for BRB detection in induction motor. Organization of this paper is as follows. In Section 2, the principles of MUSIC are introduced firstly. In Section 3, an improved bare-bones PSO (IBPSO) is proposed for multimodal optimization problem. In Section 4, a new MUSIC method based on IBPSO is proposed and its simulation analysis is also conducted. In Section 5, the IBPSO-based MUSIC is applied in BRB fault detection and its performance is compared with DFT and traditional MUSIC.

2 Multiple Signal Classification

As a kind of frequency estimation technique based on matrix eigenvalue decomposition, multiple signal classification (MUSIC) was proposed by Schmid [27] in the 1980s. Its main idea is described below. Firstly, through eigenvalue decomposition, the information space of observed signal is divided into two orthogonal subspaces, namely, signal subspace and noise subspace. Then the frequency components in observed signal can be estimated by constructing spectrum according to subspaces’ orthogonality.

Assuming that observed signal y(n) consists of P complex sinusoidal signals and white noise, it is expressed as

$$y(n)\, = \,\sum\limits_{q = 1}^{P} {A_{q} \exp [{\text{j}}(2\uppi_{q} n\, + \,\phi_{q} )]} \, + \,h(n) .$$

(1)

Where n= 1, 2, …, N, N is the number of sampling points, A_q, f_q, φ_q are amplitude, frequency and initial phase of the qth sinusoidal signal respectively, h(n) is a complex white noise with a zero mean and a variance τ².

For the observed signal of Eq. (1), a M × N matrix is constructed as follows (M>>P)

$${\varvec{Y}}(n)\, = \,\left[ {y(n),\,y(n\, + \,1),\, \ldots ,y(n\, + \,M\, - \,1)} \right].$$

(2)

Its autocorrelation matrix is

$${\varvec{R}}_{yy} = \,{\text{E}}\left\{ {\varvec{Y}(n)\varvec{Y}^{\text{T}} (n)} \right\} ,$$

(3)

where superscript T represents the conjugate transpose of matrix, E is digital expectation.

Then, all eigenvalues decomposed from R_yy are sorted in the descending order. The subspace spanned by eigenvectors corresponding to the P largest eigenvalues is the signal subspace S. The subspace spanned by the rest of eigenvectors is the noise subspace G.

Since subspaces S and G are orthogonal, signal frequency vectors and noise subspace are also orthogonal, that is

$${\varvec{D}}(f_{q} ) \bot {\varvec{G}} ,$$

(4)

where D(f_q)= [1, exp(j2πf_q), exp(j4πf_q), …, exp(j2πMf_q)].

For frequency f_q included in signal y(n), since D(f_q)^T·G= 0, then PM(f_q)= 1/|D(f_q)^T·G|² will take a peak at f_q. Therefore, signal frequency estimation can be obtained by searching peaks of PM(f_q) with step Δf.

3 Improved Bare-Bones Particle Swarm Optimization

3.1 Particle Swarm Optimization

Particle swarm optimization (PSO) is a global optimization technique. It was developed by Kennedy and Eberhart, according to the simulation of social behavior of natural biological groups. In PSO algorithm, there are many particles flying around in a multi-dimension search space. Each particle represents a candidate solution of the problem and adjusts its position based on two optima. One is its personal best position p_i, namely, its own flying experiences, while the other is the global best position p_g, namely, flying experiences of companions. Meanwhile, each particle also corresponds to a fitness value determined by optimization function. Since PSO is a iterative optimization algorithm, in each generation, the velocity v_i= [v_i1, v_i2, …, v_iβ] and position x_i= [x_i1, x_i2, …, x_iβ] of each particle are updated by the following formulas [22],

$$\begin{aligned} v_{ij} (m + 1)\, = & \,wv_{ij} (m)\, + \,c_{1} r_{1} (p_{ij} (m)\, - \,x_{ij} (m)) \\ & + \,c_{2} r_{2} (p_{{{\text{g}}j}} (m)\, - \,x_{ij} (m)), \\ \end{aligned}$$

(5)

$$x_{ij} (m + 1) = x_{ij} (m) + v_{ij} (m + 1),$$

(6)

where w is an inertia weight to control exploration in the search space, c₁ and c₂ are two learning factors, r₁ and r₂ are two random numbers within (0, 1), – v_max≤ v_ij≤ v_max, and v_max is the maximum velocity set by the user, i= 1, 2, …, α, α is the population size of particle swarm, j= 1, 2, …, β, β is the dimension of search space.

3.2 Bare-Bones Particle Swarm Optimization

Clerc and Kennedy [28] analyzed the trajectory of particles, and proved that each particle x_i converges to B_i which is a weighted average of its personal best and global best in the standard PSO algorithm, that is

$$B_{ij} \, = \,\frac{{c_{1j} p_{ij} \, + \,c_{2j} p_{{{\text{g}}j}} }}{{c_{1j} \, + \,c_{2j} }} .$$

(7)

where c_1j and c_2j are two random numbers within (0, 1). When iteration number tends to infinity, all the particles will converge to the same point.

Based on above, Kennedy [29] proposed the bare-bones particle swarm optimization (BPSO) in 2003. In BPSO, a Gaussian distribution based on the p_i and p_g is used to update particle’s position. The update formula is

$$x_{ij} (m\, + \,1)\, = \,\chi (\mu_{ij} (m),\eta_{ij}^{2} (m)) ,$$

(8)

where $\mu_{ij} (m)\, = \,{{(p_{ij} (m)\, + p_{{{\text{g}}j}} (m))} \mathord{\left/ {\vphantom {{(p_{ij} (m)\, + p_{{{\text{g}}j}} (m))} 2}} \right. \kern-0pt} 2}$ is the mean of Gaussian distribution, and $\eta_{ij}^{2} (m)\, = \,\left| {p_{ij} (m)\, - \,p_{{{\text{g}}j}} (m)} \right|$ is the standard deviation.

Compared with the standard PSO, BPSO needs less control parameters, and that is more suitable for practical application.

3.3 Improved BPSO

In MUSIC, the spectrum peak search is a multimodal optimization problem that needs to search for all global optimum solutions and as many local optimum solutions as possible. For this problem, a novel strategy of subpopulation determination based on the excellent work of Refs. [25, 26] is proposed in this section, and then is introduced into BPSO to realize multimodal search. Compared with Refs. [25, 26], the improved BPSO (IBPSO) has three differences: (1) Personal best position is selected as a candidate of seeds to prevent oscillation; (2) A similarity of species σ is defined for maintaining the diversity of seeds, where σ is a Euclidean distance between any two particles; (3) Each seed particle is the core of subpopulation, and non-seed particles are distributed to the subpopulation of the nearest seed. The pseudo code of improved seed selection strategy is shown as follows:

As described above, seed selection strategy is executed in each generation of the evolutionary process. First of all, according to the fitness value, personal best positions of all particles are arranged in descending order to form a set Spbest. Then, the similarity between each individual in Spbest and each existing seed of X_s (called seed set) is compared. If the Euclidean distance between them is larger than threshold value σ^*, this personal best position will be added to X_s.

The basic steps of IBPSO are as follows:

Step 1::

Initialize particles’ positions, personal best positions and seed set X_s. Set algorithm parameters, including population size α, maximum generation m_max and species similarity threshold σ^*

Step 2::

Calculate the fitness of each particle

Step 3::

Update personal best position p_i

Step 4::

According to the fitness, arrange all p_i in descending order

Step 5::

Update seed set X_s

Step 6::

Assign each particle to the nearest seed by calculating the distance between them

Step 7::

According to Eq. (8), update particle positions, where p_g is the seed found in Step 5;

Step 8::

If the condition of termination is satisfied (i.e., the fitness error is less than the threshold or the iterative number exceeds the maximum), stop iterative procedure and output all the seed positions and fitness values. Otherwise, return to Step 2

3.4 IBPSO Performance Analysis

A benchmark function, Rastrigin, is used to verify the effectiveness of IBPSO. And the performance of IBPSO is compared with species conserving genetic algorithm (SCGA) [25] and species-based PSO (SPSO) [26].

In mathematical optimization, Rastrigin function is a typical example of non-linear multimodal function and often used as a performance test problem for optimization algorithms. For two independent variables, it is defined as

$$\hbox{min} F(x_{1} ,x_{2} )\, = \,\sum\limits_{j = 1}^{2} {[x_{j}^{2} \, - \,10\cos (2\uppi x_{j} )\, + \,10]} ,$$

(9)

where $x_{1} ,x_{2} \, \in \,[ - \,5,\;5]$. Three-dimensional diagram of Eq. (9) is shown in Figure 1. As the plot shows, Rastrigin function has large search space and large number of local minima. So solving this multimodal optimization is a fairly difficult task.

Figure 1

Rastrigin benchmark function

In this test, the target of three algorithms is to find one global optimum and eight local optima with best fitness. Their parameter configurations are shown in Table 1. With the same initial population, three algorithms are performed on above benchmark function. The results are shown in Figures 2 and 3.

Table 1 Parameter configurations for the selected optimization algorithms

Figure 2

Convergence curves of three algorithms

Figure 3

Optimizing results of three algorithms

As shown in Figure 2, the performance of IBPSO is the best, SCGA second, whereas SPSO worst. There is an error fluctuation on the convergence curve of SPSO, because its seeds are selected from the particles in each generation. Conversely, SCGA and IBPSO respectively adopt the species conservation strategy and improved seed selection strategy to effectively avoid this problem. We also can see that IBPSO is better than the other two algorithms both in convergence speed and precision. In Figure 2, the convergence precision AES is defined as

$$AES\, = \,\frac{1}{SN}\sum\limits_{i = 1}^{SN} {\left| {F(\varvec{kgo}_{\varvec{i}} )\, - \,F(\varvec{sd}_{\varvec{i}} )} \right|} ,$$

(10)

where SN is the number of known global optima, F(·) is the fitness function. A pair of kgo_i and sd_i represents that for each real optimum kgo_i, there is correspondingly a closest species seed sd_i to kgo_i.

As shown in Figure 3(a) and (b), for the given nine optimal solutions, SCGA finds eight, and SPSO finds only five. Unfortunately, the SPSO also fail to find the global optimal solution (0, 0) with best fitness. The reason is that they adopt fixed niche radius to determine subpopulations, which limits the global search ability of algorithm. On the contrary, IBPSO has an improvement. It can adaptively adjust subpopulations according to the distance between each particle and seed. This behavior makes particles have a larger flight range at the beginning of iteration, which can improve the global search ability. And with the increasing generations, search radius can be reduced automatically to improve the local search ability. Figure 3(c) verifies that IBPSO finds all the optimal solutions with high location accuracy.

In addition, only species similarity threshold σ^* needs to be set in IBPSO so that the effect of parameters will be reduced. So the IBPSO is more suitable for application in engineering.

4 IBPSO-Based MUSIC and Simulation Analysis

4.1 IBPSO-Based MUSIC

In traditional MUSIC algorithm, we need to pre-set the calculation step ∆f of peak search. And then a traversal search with step ∆f is performed in the whole frequency domain or within an empirical frequency range. However, this search strategy has two shortages. (1) Since search step ∆f is fixed, frequency resolution is limited; (2) With decreasing search step, computational time will make a sharp increase, which influences the real-time performance of algorithm. In this section, a new MUISC algorithm combining the traditional MUSIC and IBPSO is proposed, which can fast find multiple spectrum peaks with high precision. To achieve multiple peaks search by IBPSO, an objective function (fitness function) must be established first. According to the principles of MUSIC, fitness function is defined as

$$Fitness(f_{q} )\, = \,\left| {{\varvec{D}}(f_{q} )^{\text{T}} \cdot {\varvec{G}} \cdot {\varvec{G}}^{\text{T}} \cdot {\varvec{D}}(f_{q} )} \right| .$$

(11)

And then the fixed-step traversal search is replaced by IBPSO to improve the performances of MUSIC. The specific steps of IBPSO-based MUSIC are as follows.

Step 1::

Measure a set of signal data, and construct its autocorrelation matrix R_yy

Step 2::

Generate the signal subspace S and noise subspace G by handling R_yy with eigenvalue decomposition.

Step 3::

Encode the f_q of Eq. (1) to form population particles, and select the Eq. (11) as the fitness function.

Step 4::

Search multiple spectrum peaks in the frequency domain by using IBPSO.

4.2 Simulation Analysis

When the BRB fault occurs in induction motor, sideband components will be generated in the stator current. Among these fault-related components, amplitudes of f_br1= (1 ± 2s)f₁ are maximum. Thus, to analyze the performance of the IBPSO-based MUSIC in BRB fault detection, the simulated current signal is designed as

$$i_{\text{br}} (t)\, = \,I_{1} \cos ( 2\uppi f_{1} t\, + \,\phi_{1} )\, + \,I_{{{\text{bp}}1}} \cos [ 2\uppi(1\, - \,2s)f_{1} t\, + \,\phi_{{{\text{bp}}1}} ]\, + \,I_{{{\text{bn}}1}} \cos [ 2\uppi(1\, + \,2s)f_{1} t\, + \,\phi_{{{\text{bp}}1}} ]\, + \,h(t) .$$

(12)

where Ι₁, f₁, φ₁ are amplitude, frequency and initial phase of fundamental current, and their values are 10, 50 and π/4, respectively. Set I_bp1= I_bn1= 0.2 A, (1 – 2s)f₁= 49.5438 Hz, (1 + 2s)f₁= 50.4562 Hz, φ_bp1= π/2 rad, φ_bn1= π rad. h(t) is uniformly distributed random noise signal within (– 0.2, 0.2). The sampling frequency of simulated current is 250 Hz, and sampling length is 500. Then traditional MUSIC and the proposed algorithm are applied to this signal. In traditional MUSIC, search step ∆f is set to 0.1 Hz, 0.01 Hz, 0.001 Hz, respectively, and the simulation results are shown in Table 2. In the IBPSO-based MUSIC, its related parameters are set as follows: population size is 60, maximum iterative number is 30, species similarity threshold σ^* = 0.3. Since IBPSO is a stochastic optimization algorithm, the proposed method runs 50 times independently. Its statistical results are shown in Table 3.

Table 2 MUSIC estimation results with different search step

Table 3 Estimation results of IBPSO-based MUSIC

Table 2 shows that traditional MUSIC has a very high frequency resolution even with a short-time data window. Therefore, it has superiority in the stator current spectrum analysis, especially in BRB fault detection of induction motor. However, its estimation accuracy of frequency is limited by search step, that is, the highest accuracy will not exceed ∆f. And the increasing search step results in increasing error of the fault-related frequencies. Fortunately, it is an exception for fundamental frequency, because 50 Hz is an integer multiple of the search steps like 0.1, 0.01, and 0.001. For the IBPSO-based MUSIC, the estimation accuracy of fault-related frequencies reaches 10⁻⁵, even 10⁻⁷ for fundamental frequency, as Table 3 shown. And the maximum error in 50 times of operation doesn’t exceed 10⁻⁴. Therefore, in terms of precision, the proposed algorithm has far exceeded the traditional MUSIC with Δf= 0.001 Hz.

Table 4 compares the two algorithms’ computational costs. For the MUSIC, the calculation time will increase sharply with the decrease of search step. Namely, the improvement of accuracy is at the expense of computation. For the proposed algorithm, not only the frequency precision reaches 10⁻⁵ (as shown in Table 3), and the calculation cost is only 0.339 s that is equivalent to the traditional MUSIC with Δf= 0.1 Hz.

Table 4 Computation cost comparison for the algorithms

Therefore, IBPSO-based MUSIC obtains a prominent improvement on solution accuracy and search efficiency contrasting with traditional MUSIC.

5 Application in BRB Fault Detection of Induction Motors

In this section, IBPSO-based MUSIC is applied in BRB fault detection of an actual induction motor. The general view of the experimental setup is shown in Figure 4. The motor drives an 8 kW generator to supply 20 sets of incandescent bulbs. The incandescent bulb groups can be switched to adjust the motor load as required. With three Hall current sensors, current signals are acquired into the computer for detection and analysis by the analog signal acquisition card PCI8622.

Figure 4

Experimental test bench

The type of test induction motor is Y132M-4, and its main technical parameters are shown in Table 5. Besides a healthy rotor, the motor is equipped with a fault rotor to simulate the BRB fault. This fault rotor has one broken bar with a drilling hole (diameter: 8 mm and depth: 10 mm), as shown in Figure 5.

Table 5 Specifications of the test motor

Figure 5

Fault rotor with one broken bar

There are two experimental conditions, namely, one broken bar under half load (s= 0.02200) and one broken bar under full load (s= 0.04133). A phase current i_a is used to detect BRB fault, and its waveforms under two conditions are shown in Figure 6. Sampling interval of current signal is 7 ms, and sampling length is 200. The parameters of IBPSO are the same as that in Section 4.2. In order to compare the results, the traditional MUSIC and DFT algorithm are also used to analyze the measured current signals.

Figure 6

Fault motor currents under different load

In Figure 7, the results of three algorithms (i.e., MUSIC with search step ∆f= 0.001 Hz, DFT, and IBPSO-based MUSIC) under full load are compared. As is known, the components of (1 ± 2s)f₁ are the characteristics of BRB fault. Generally, it’s relatively easy to find out the fault features under full load, because fault components have highest amplitudes and are furthest away from fundamental component. Thus, three algorithms can all distinguish fault-related components, as shown in Figure 7. However, the distinction effects of MUSIC and IBPSO-based MUSIC are more obvious, this is because their calculation principles can avoid the spectrum leakage effectively. Moreover, the algorithms based on MUSIC have better frequency resolution. Although DFT has bigger errors on both fundamental frequency and fault-related frequencies, it has an absolute advantage on computation time.

Figure 7

Spectrum analysis results of three algorithms at full-load condition

Figure 7(a) and (b) show that both two algorithms have a high frequency resolution. However, for traditional MUSIC, spectrum peaks can only appear at the integer multiples of ∆f (0.001 Hz) due to usage of fixed step size. As shown in Figure 7(b), three spectrum peaks are only located at 45.861 Hz, 50.023 Hz and 54.224 Hz. Therefore, traditional MUSIC cannot attain a finer frequency resolution. Contrastively, it is obvious that IBPSO-based MUSIC can find higher spectrum peaks no matter for fundamental frequency or for fault feature frequencies (under the same signal subspace and noise subspace). Figure 7(a) and (b) prove that the frequency resolution and accuracy of IBPSO-based MUSIC are higher than MUSIC. Meanwhile, IBPSO-based MUSIC also takes a less computation time. In this experiment, its time cost is only 0.106 s comparing with 4.054 s of MUSIC, which greatly improves the search efficiency. Accordingly, IBPSO-based MUSIC is more suitable and reliable for BRB fault detection.

Figure 8 shows the experimental results under half load. On this occasion, fault components are more weak and closer to fundamental component. So it’s more difficult to extract and highlight fault components. Comparing the results of three algorithms in Figure 8, IBPSO-based MUSIC has the best performance and low computation cost.

Figure 8

Spectrum analysis results of three algorithms at half-load condition

6 Conclusions

• (1) An improved BPSO (IBPSO) is proposed to make it more suitable for multimodal optimization problem. Compared with SCGA and SPSO, the solution quality and convergence speed are improved greatly.

• (2) Based on multimodal intelligence search of the IBPSO, a new MUSIC algorithm is proposed for BRB fault detection. Contrasting with traditional MUSIC, the IBPSO-based MUSIC obtains a prominent improvement on frequency accuracy and search efficiency.

• (3) Finally, DFT, MUSIC and IBPSO-based MUSIC are compared in BRB fault detection of an actual induction motor. Experimental results show that the proposed algorithm has the best frequency resolution and accuracy, which make it more reliable to detect the BRB fault.