# Sensor Scheduling with Intelligent Optimization Algorithm Based on Quantum Theory

Authors: Zhiguo Chen; Yi Fu; Wenbo Xu
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

The particle swarm optimization (PSO) algorithm superiority exists in convergence rate, but it tends to get stuck in local optima. An improved PSO algorithm is proposed using a best dimension mutation technique based on quantum theory, and it was applied to sensor scheduling problem for target tracking. The dynamics of the target are assumed as linear Gaussian model, and the sensor measurements show a linear correlation with the state of the target. This paper discusses the single target tracking problem with multiple sensors using the proposed best dimension mutation particle swarm optimization (BDMPSO) algorithm for various cases. Our experimental results verify that the proposed algorithm is able to track the target more reliably and accurately than previous ones.


---

## Body

## 1. Introduction

Nowadays, the optimization problems of real-world increase rapidly, and they are almost nonlinear and often have several local optima, so it is very hard to find the global optimal solution fast. For example in target tracking [1, 2] system, management of different kinds of sensors to get desired result within acceptable time is a very difficult task.Heuristic search strategies can acquire faster solutions as they need not require the objective functions to be continuous or differentiable. For recent years the particle swarm optimization (PSO) algorithm in terms of social and cognitive behavior with heuristic search strategy has been successfully used in many real applications [3, 4] since it was proposed by Kennedy and Eberhart [5]. Like most biologically inspired algorithms, the PSO is population based, and the individuals which make up the population are referred to as particles. The main advantage of PSO algorithm is that it has fewer parameters to adjust, but when the search space is high its convergence speed will become very slow near the global optimum and get into local optima. PSO algorithm also shows poor quality results when it deals with large and complex data sets, and it often failed in searching for a global optimal solution when the objective function has a large number of dimensions. The reason for this phenomenon is not only the existence of the local optimal solutions especially for some multimodal functions, but also the velocities of the particles sometimes lapsed into degeneracy, so that the successive range was restricted in the subplain of the whole search space [6].Although it was confirmed that the PSO algorithm has potential to find global optimal solution on some benchmark functions [7], it could get stuck in local optima. So the issue of local optima in PSO algorithm has been studied widely and many different variants of PSO algorithm were proposed. For example, by dynamically adjusting the inertia weight w and acceleration weights c1, c2 in PSO algorithm, the convergence speed is increased and the swarm is encouraged to escape from local optimal [8]. Some other mutation techniques are used to mutate the positions of some particles in order to diverge the swarm [9]. However, it is still difficult for the modified methods above to find the global solutions for some complex applications. In this paper, a new mutation method called best dimension mutation (BDM) is proposed, and it enables the particles to converge to global optimum fast and easily escape from local optima. A new perturbation technique inspired by quantum mechanics is also introduced into original POS algorithm which is used to reinitialize the particles positions without distorting the ongoing search strategy when the particles are too close from each other. By combining the two proposed methodologies, the particles can escape from local optima more easily.The rest of the paper is organized as follows. Section2 discusses the tracking of single target using multiple noisy sensors. Section 3 presents the BDMPSO (best dimension mutated particle swarm optimization) algorithm. Section 4 shows our experimental results. Section 5 concludes the paper.


## 2. Sensor Scheduling for Target Tracking

Figure1 illustrates such a scene where a single target moves across a geographical area and several sensors are used to track the target simultaneously. The target state Xk=[xkx˙kyky˙k]′ is unknown and the brief target model is considered as
(1)Xk+1=AXk+Bωk,
where ωk is white Gaussian process noise with covariance matrix Q. The target state kinematics equation is modeled by system matrix A and the noise intensity is determined by matrix B. The target state is observed by several sensors and the measurement results are impaired by Gaussian noise. At given time k, the measurement from the nth sensor is a column vector given by
(2)Zkn=HnXk+vkn,
where vkn is the measurement noise of each sensor, which is assumed to be independent of other sensors and of the process noise. We make an assumption that covariance matrix Rn and observation matrix Hn are previously known, and the Kalman filtering techniques [10–13] are used to estimate the state of the target. For a given initial error covariance P0, the estimated error covariance of the state is given by
(3)Pk∣k=Pk∣k-1-Pk∣k-1H′Skn-1HPk∣k-1,
where
(4)Pk∣k-1=APk-1∣k-1A′+BQB′,Skn=HPk∣k-1H′+Rn.Figure 1
Single target tracking system with multiple sensors.The base station (BS), which schedules the sensors to be active or asleep, collects the latest information about the deleted and newly added sensors as soon as the parameters of the target have been obtained. In our work, we assume that only one sensor is scheduled to estimate the state of the target at any time. Therefore, there is only one sensor to be activated by the BS at a time. LetN describe the number of latest available sensors to take measurements and µ(T)={u1,u2,…,uT} represent the sensor scheduling sequence for k=1,2,…,T, and let uk∈{1,…,N} be the activated sensor at time step k. Our goal is to minimize the total estimated error of the target states given by the Kalman filter when k=1 to T and to weigh the total sensor usage cost. Calculating the trace of a matrix provides a cheaper and more effective means of defining a scaler based on the estimated error covariance than those of the other ways. Therefore, the trace of the error covariance matrix is considered as our scaler. By using a positive weighting factor w, we can weigh the cost between error and usage. If the cost function JT is defined to measure the performance of the state’s cumulative root mean square error and to weigh sensor usage cost for the time horizon {1,2,…,T}, then
(5)JT=∑k=1T{P(uk)+wck(uk)},
where P(uk)=trace(Pk∣k(uk)) represents the square root of the error covariance associated with the selected sensor uk at instant time k. The nth sensor usage cost at kth instant time is ck(n) and ω∈R+ is a constant weight coefficient. Our objective is to find an optimal sensor sequence which can produce the minimum cost at the entire time horizon. The optimal sensor sequence is described as μ*(T)={u1*,u2*,…,uT*}:
(6)μ*(T)=argmin∀uk{∑k=1T{P(uk)+wck(uk)}}.
From (6), we can see that there are total NT possible combinations to schedule the sensors. Up to now many optimal algorithms have been proposed to solve this sensor sequence problem. Dynamic programming (DP) and branch-and-bound (BB) were used to solve such problem, but the computational cost rose exponentially along with the increase in the number of sensors and the sequence length [14].Rollout Algorithm (RA) is closely approximate to a dynamic programming method which can overcome the exponential computational cost problem [15], and it can produce attractive suboptimal results not worse than traditional heuristic methods.Sliding Window (SW) is another suboptimal method and its window size will balance the computational cost and final results.The PSO algorithm can be used to solve above target tracking problem [16], but the quality will dramatically decrease with the increment of the sensors. An improved PSO algorithm will be proposed in Section 3 and it will produce acceptable global optimization result.


## 3. Best Dimension Mutated Particle Swarm Optimization

### 3.1. Best Dimension Mutation

Our goal is to develop a methodology which is able to converge faster than PSO algorithm while ensuring the solution is near optimal. In GA (genetic algorithm) or any hybridized PSO algorithm, dimensions of particles are just selected by an assigned probabilityP for mutation. The performance of PSO algorithm varies with different values of P for different cases. High value of P may result in the swarm divergence and misleading results in some applications. Our methodology aims to speed up the searching process with simple and useful mutation ways. The proposed technique inspired from quantum theory is the key measure to improve the performance of PSO algorithm which can perturb the particles when they are too close from each other.The PSO algorithm performs very rapid convergence rate at the beginning and will slow down during the remaining searching process [17], and sometimes the velocity of a particle will be zero at the end. This brings about the particles stagnated in local optima [18]. The new mutation technique will relocate the particles to new positions and keep moving around the searching space. The conventional mutation is carried out by selecting one or more dimensions of a particle probabilistically and then added a disturbance factor with special distribution [19, 20].We developed a new mutation technique called best dimension mutation (BDM) which will find the best dimension to perform mutation at each iteration step, and the selected dimension will be replaced by a random value from the searching space as follows:(1)
randomly select one particleXi from the swarm population Xit=(Xi1,Xi2,…,XiD);(2)
randomly selects number of dimensions in position vector of the selected particle and perform mutation for all selected dimensions separately. The mutated particles XM are given by XM=(XM1,XM2,…,XMs), where XMm=(Xi1,…,Xid-1,r,Xid+1,…,XiD) and r=randid(maxX-minX)+minX;(3)
select the particle denoted byXMm*with the best performance out of s number of mutated particles XM and the parent particle Xit, considering problem XMm*=argmin∀Xf(X),X∈{Xit,XM};(4)
update position of the particle by the best mutated one. The velocity of the particle can be calculated asXit+1=XMm*,  vit+1=Xit+1-Xit.Figure2 illustrates the flowchart of the proposed BDM procedure. It was observed that if more number of dimensions were selected at the beginning of the search process, the particles would find better solution in a short time period and the divergence of the swarm was more efficient. However, the computational complexity will increase with more dimensions. Therefore, we experimentally found that the performance and computational efficiency of the algorithm can be increased by selecting all of dimensions for a short period and gradually decreases toward the end of the search process. Figure 3 illustrates the selection of number of dimensions as number of iterations increase. The maximum number of iterations is denoted by IMAX. The mutation is carried out only for one particle in the swarm and it makes an additional s number of fitness evaluation at each iteration step.Figure 2
The flowchart of the proposed method of best dimension mutation (BDM).Figure 3
Selection of number of dimensions with number of iterations.


### 3.2. Refreshing Particles Based on Quantum Theory

The performance of the BDM methodology above can be increased by selecting all of the dimensions for a short period of time at the beginning and gradually decreasing toward the end of the searching process. However, the problem of getting stuck in local optima would occur inevitably. Therefore, a perturbation technique is applied to the particles when they are too close from each other. The particle’s position can be reinitialized with two different strategies as follows.(1)
Use Gaussian distribution with the mean as global best solutionGt and the variance as L% of the search space to generate the particles:
(7)Xit~Xit≠GtN(Gt,L).(2)
Use the delta potential well distribution to generate the particles as used in [21]:
(8)Xit~Xit≠GtGt±lg(1/u)2gln2L,whereu is a random number in the range (0, 1] and g is a constant variable.The particles generated by delta potential well distribution and Gaussian distribution are denoted by Qps and Gps, respectively, in Figure4. Both quantum distribution (delta potential well) and Gaussian distribution have a great chances to generate particles close to gbest (global best) position as shown in Figure 4. However, the delta potential distribution produces some particles significantly far away from gbestposition. This is the tunneling effect; that is, particles have a great chance to reach the global optima even if the global optima should be far away from the local optima [21]. We tested the performance of the PSO algorithm with both particles generating techniques. We experimentally found that the particles generated with quantum based technique in PSO algorithm produce better results than those produced with Gaussian techniques. Therefore, we will use delta potential well to generate the particles when they are too close to each other in this paper.Figure 4
Particles generated with Gaussian distribution and Delta potential well distribution (L=3, Gt=0, and g=2.5).The parameterL decides the position of the particles around gbest position. We can see from Figure 5 that the particles generated with larger L value are comparatively far away from gbest (where Gt=0). We assigned larger L from the start and linearly reduced it to zero with the increment of iterations to ensure the convergence of the particles. The algorithm will be very slow if the positions of the particles are calculated in each iteration, so we refresh the particles after tcap predefined iterations. We investigated the impact of tcap on final results and the value was chosen empirically.Figure 5
Particles generated with differentL values (L1=2, L2=5, Gt=0, and g=2.5).


### 3.3. Sensor Scheduling by BDMPSO

We assumed that we did not know the target parameters such as system matrixA, noise intensity B, and covariance matrix Q until the target appeared in the sensor field. Once the target has been detected the base station will awaken available sensors for target observing. After all information about the target and sensors has been collected, there will be a short period of time to schedule the sensor sequence. Therefore, the BDMPSO algorithm will be applied to produce optimal sensor sequence with the minimum iterations. As the number of sensors is discrete, we use rounding method to discretize the dimensions. Also the replacement mechanism is used when a particle goes beyond the search space as shown below:
(9)Xitd=round[randid(maxX-minX)+minX].The flowchart of the proposed BDMPSO is illustrated in Figure6.Figure 6
The flowchart of the proposed procedure for the BDMPSO algorithm.The entire procedure of BDMPSO procedure for sensor scheduling can be described as below.(1)
Att=1 randomly select particles from {xi1∈{u1,u2,…,uT}}i=1np, and each of which indicates a corresponding feasible sensor sequence. Initialize velocity Vi0, own best position pi0, and global best position G0, and set temp = 0.(2)
At iterationt, if temp = tcap (a predefined number of iterations), refresh all the particles except the global best one using delta potential well distribution and set temp = 0; else goto Step 3.(3)
Randomly select a particleXit from the swarm population and perform the BDM and go to Step 4.(4)
Evaluate the fitness value and update the own bestpit, global best G0, velocity Vit, and position Xit for all np particles. Increment temp by one and go to Step 5.(5)
Ift=IMAX then go to Step 6; else increment t by one and go to Step 2.(6)
The optimal sensor sequence of the problem is returned by the global best particle at the end of the{u1*,u2v,…,uT*}=GIMAX.


## 3.1. Best Dimension Mutation

Our goal is to develop a methodology which is able to converge faster than PSO algorithm while ensuring the solution is near optimal. In GA (genetic algorithm) or any hybridized PSO algorithm, dimensions of particles are just selected by an assigned probabilityP for mutation. The performance of PSO algorithm varies with different values of P for different cases. High value of P may result in the swarm divergence and misleading results in some applications. Our methodology aims to speed up the searching process with simple and useful mutation ways. The proposed technique inspired from quantum theory is the key measure to improve the performance of PSO algorithm which can perturb the particles when they are too close from each other.The PSO algorithm performs very rapid convergence rate at the beginning and will slow down during the remaining searching process [17], and sometimes the velocity of a particle will be zero at the end. This brings about the particles stagnated in local optima [18]. The new mutation technique will relocate the particles to new positions and keep moving around the searching space. The conventional mutation is carried out by selecting one or more dimensions of a particle probabilistically and then added a disturbance factor with special distribution [19, 20].We developed a new mutation technique called best dimension mutation (BDM) which will find the best dimension to perform mutation at each iteration step, and the selected dimension will be replaced by a random value from the searching space as follows:(1)
randomly select one particleXi from the swarm population Xit=(Xi1,Xi2,…,XiD);(2)
randomly selects number of dimensions in position vector of the selected particle and perform mutation for all selected dimensions separately. The mutated particles XM are given by XM=(XM1,XM2,…,XMs), where XMm=(Xi1,…,Xid-1,r,Xid+1,…,XiD) and r=randid(maxX-minX)+minX;(3)
select the particle denoted byXMm*with the best performance out of s number of mutated particles XM and the parent particle Xit, considering problem XMm*=argmin∀Xf(X),X∈{Xit,XM};(4)
update position of the particle by the best mutated one. The velocity of the particle can be calculated asXit+1=XMm*,  vit+1=Xit+1-Xit.Figure2 illustrates the flowchart of the proposed BDM procedure. It was observed that if more number of dimensions were selected at the beginning of the search process, the particles would find better solution in a short time period and the divergence of the swarm was more efficient. However, the computational complexity will increase with more dimensions. Therefore, we experimentally found that the performance and computational efficiency of the algorithm can be increased by selecting all of dimensions for a short period and gradually decreases toward the end of the search process. Figure 3 illustrates the selection of number of dimensions as number of iterations increase. The maximum number of iterations is denoted by IMAX. The mutation is carried out only for one particle in the swarm and it makes an additional s number of fitness evaluation at each iteration step.Figure 2
The flowchart of the proposed method of best dimension mutation (BDM).Figure 3
Selection of number of dimensions with number of iterations.


## 3.2. Refreshing Particles Based on Quantum Theory

The performance of the BDM methodology above can be increased by selecting all of the dimensions for a short period of time at the beginning and gradually decreasing toward the end of the searching process. However, the problem of getting stuck in local optima would occur inevitably. Therefore, a perturbation technique is applied to the particles when they are too close from each other. The particle’s position can be reinitialized with two different strategies as follows.(1)
Use Gaussian distribution with the mean as global best solutionGt and the variance as L% of the search space to generate the particles:
(7)Xit~Xit≠GtN(Gt,L).(2)
Use the delta potential well distribution to generate the particles as used in [21]:
(8)Xit~Xit≠GtGt±lg(1/u)2gln2L,whereu is a random number in the range (0, 1] and g is a constant variable.The particles generated by delta potential well distribution and Gaussian distribution are denoted by Qps and Gps, respectively, in Figure4. Both quantum distribution (delta potential well) and Gaussian distribution have a great chances to generate particles close to gbest (global best) position as shown in Figure 4. However, the delta potential distribution produces some particles significantly far away from gbestposition. This is the tunneling effect; that is, particles have a great chance to reach the global optima even if the global optima should be far away from the local optima [21]. We tested the performance of the PSO algorithm with both particles generating techniques. We experimentally found that the particles generated with quantum based technique in PSO algorithm produce better results than those produced with Gaussian techniques. Therefore, we will use delta potential well to generate the particles when they are too close to each other in this paper.Figure 4
Particles generated with Gaussian distribution and Delta potential well distribution (L=3, Gt=0, and g=2.5).The parameterL decides the position of the particles around gbest position. We can see from Figure 5 that the particles generated with larger L value are comparatively far away from gbest (where Gt=0). We assigned larger L from the start and linearly reduced it to zero with the increment of iterations to ensure the convergence of the particles. The algorithm will be very slow if the positions of the particles are calculated in each iteration, so we refresh the particles after tcap predefined iterations. We investigated the impact of tcap on final results and the value was chosen empirically.Figure 5
Particles generated with differentL values (L1=2, L2=5, Gt=0, and g=2.5).


## 3.3. Sensor Scheduling by BDMPSO

We assumed that we did not know the target parameters such as system matrixA, noise intensity B, and covariance matrix Q until the target appeared in the sensor field. Once the target has been detected the base station will awaken available sensors for target observing. After all information about the target and sensors has been collected, there will be a short period of time to schedule the sensor sequence. Therefore, the BDMPSO algorithm will be applied to produce optimal sensor sequence with the minimum iterations. As the number of sensors is discrete, we use rounding method to discretize the dimensions. Also the replacement mechanism is used when a particle goes beyond the search space as shown below:
(9)Xitd=round[randid(maxX-minX)+minX].The flowchart of the proposed BDMPSO is illustrated in Figure6.Figure 6
The flowchart of the proposed procedure for the BDMPSO algorithm.The entire procedure of BDMPSO procedure for sensor scheduling can be described as below.(1)
Att=1 randomly select particles from {xi1∈{u1,u2,…,uT}}i=1np, and each of which indicates a corresponding feasible sensor sequence. Initialize velocity Vi0, own best position pi0, and global best position G0, and set temp = 0.(2)
At iterationt, if temp = tcap (a predefined number of iterations), refresh all the particles except the global best one using delta potential well distribution and set temp = 0; else goto Step 3.(3)
Randomly select a particleXit from the swarm population and perform the BDM and go to Step 4.(4)
Evaluate the fitness value and update the own bestpit, global best G0, velocity Vit, and position Xit for all np particles. Increment temp by one and go to Step 5.(5)
Ift=IMAX then go to Step 6; else increment t by one and go to Step 2.(6)
The optimal sensor sequence of the problem is returned by the global best particle at the end of the{u1*,u2v,…,uT*}=GIMAX.


## 4. Simulation Results

In this section, we tested a single target tracking in a 2-dimensional Cartesian space, and the state of the target evolved with linear Gaussian dynamics. Our experiments used the constant velocity in target model. Therefore, the covariance matrixQ and system matrix A can be described as follows:
(10)A=[1Δt0001Δt0001Δt0001],Q=qΔt=[Δt24Δt200Δt21Δt2000Δt24Δt200Δt21],
where the scalar quantity q dominates the intensity of system noise and the state updates with time step Δt. We assigned q=20 and Δt=1 for all of the experiments. The sensor measurement showed a linear correlation of the target state and was impaired by white Gaussian noise in (2). All of the sensors are homogeneous, and the error covariances and usage costs differ from one another. The observation matrix H is a unit matrix with 4 by 4 for all sensors. There are 24 sensors used for the experiments all together and the error covariances of which can be described as follows:
(11)R1=103[200001.5000020000001.5],R2=103[2.500000.5000010000000.5],R3=103[15000000.500001.500001.5],R4=103[20000001.5000020000001.5],
where the other sensors’ error covariance eigenvalues are larger than R4. Among the entire time horizon, the usage costs are defined as c(1)=65, c(2)=25, c(3)=40, and c(n)=60, for all n≥4. Therefore, the optimal solution including R1, R2, R3, and R4 produced by sensors such that n>4 should be the same as that produced by four sensors only. The intention in generating these covariances is to change the landscape of the problem with the global solution unchanged. For all experiments the weighting factor w in (5) is assigned 1. We have measured the performance of the proposed method in contrast to PSO with time varying parameters (PSO-tp), Comprehensive Learning PSO [22] (CLPSO), Rollout Algorithm using PSO (RA1), Rollout Algorithm using one step-look-ahead (RA2), and Sliding Window (SW) approach. The set values of BDMPSO are tcap=30, L=2%, c=40, and np=30 and the rest parameters are the same as in [23].Firstly, we tested the ability of proposed algorithms with the length of the sensor scheduling sequences varying. Table1 shows the average results over 30 independent runs for all six different methods in different time horizons (the best costs are highlighted). For the algorithms above, the maximum fitness evaluation (FE) is 20000 with the exception of BDMPSO, being 15000. We can see from Table 1 that the performances of the RA2, SW, and PSO-tp decrease with the sequence length increasing. However, the performances of BDMPSO will not be affected by the increasing number of dimensions. By combining best dimension mutation and new refreshment technology, the performance of the BDMPSO algorithm makes a much more enhancement than others.Table 1
Comparison of cumulative cost for different time horizons.
T
SW (103)
RA1 (103)
RA2 (103)
PSO-tp (103)
CLPSO (103)
BDMPSO (103)
30
2.576
2.641
2.498
2.479
2.542
2.396
40
3.295
3.592
3.426
3.192
3.252
3.159
50
4.315
3.971
4.201
3.859
3.883
3.736
60
4.855
4.732
5.076
4.621
4.597
4.527
70
5.662
5.319
6.125
5.302
5.304
5.204
80
6.174
6.201
6.823
6.343
5.902
5.842
90
6.822
6.924
7.418
6.912
6.587
6.721
100
7.252
7.427
8.421
7.724
7.403
7.196
110
8.961
8.093
9.381
8.581
8.067
8.036
120
9.382
8.801
10.24
9.304
8.812
8.512Secondly, we analyzed the performance of the PSOs (PSO algorithms) by varying numbers of sensors. Table2 shows the average results over 30 independent runs for (the best costs are highlighted) all six different methods. The fitness evaluations (FEs) are assigned to 20000 for all the PSOs. As the SW and RA2 are deterministic means, the results are the same for different cases. The performances of RA2 and BDMPSO are better than the others’. However, it can be seen from Table 2 that the performances of PSO-tp and CLPSO decrease when the number of sensors increases, and easily get stuck in local optima. The BDMPSO produces the better results for all of the cases.Table 2
Comparison of cumulative cost for different numbers of sensors.
N
SW (103)
RA1 (103)
RA2 (103)
PSO-tp (103)
CLPSO (103)
BDMPSO (103)
3
7.476
7.324
7.389
7.395
7.557
7.242
6
7.476
7.406
7.389
7.413
7.562
7.392
9
7.476
7.364
7.389
7.630
7.642
7.331
12
7.476
7.426
7.389
7.598
7.585
7.329
15
7.476
7.524
7.389
7.621
7.612
7.326
18
7.476
7.631
7.389
7.655
7.620
7.346
21
7.476
7.630
7.389
7.623
7.632
7.363
24
7.476
7.762
7.389
7.692
7.593
7.379Thirdly, we compared the performance of PSOs with different numbers of FEs. The parameters were assigned to the same numbers except for the FEs which varied from 10000 to 40000. Table3 shows the average results over 30 independent runs for (the best costs are highlighted) all six different methods with sequence length of 100 units. It can be seen from Table 3 that the proposed BDMPSO achieves better result than other variant PSO algorithms and it converges to desired results in fewer iterations, but other PSOs will need considerably more numbers of FEs to achieve comparative result. Therefore, the proposed BDMPSO algorithm is more suitable for nearly linear problems in less time.Table 3
Comparison of cumulative cost for different FEs.
FEs
PSO-tp (103)
CLPSO (103)
BDMPSO (103)
Number of sensorsN=3
10000
7.812
7.509
7.348
15000
7.712
7.496
7.337
20000
7.712
7.400
7.315
30000
7.702
7.327
7.298
40000
7.642
7.307
7.297
Number of sensorsN=6
10000
7.713
8.904
7.405
15000
7.532
7.987
7.359
20000
7.501
7.640
7.313
30000
7.487
7.462
7.297
40000
7.486
7.462
7.297
Number of sensorsN=9
10000
9.387
9.846
7.409
15000
9.346
9.105
7.412
20000
8.615
8.510
7.406
30000
8.559
7.559
7.413
40000
8.578
7.542
7.357
Number of sensorsN=12
10000
11.762
10.824
7.768
15000
11.516
9.637
7.422
20000
11.327
9.120
7.425
30000
10.678
8.249
7.516
40000
10.519
7.348
7.496
Number of sensorsN=15
10000
12.513
11.305
8.098
15000
12.249
10.190
7.416
20000
12.301
9.598
7.387
30000
12.209
8.315
7.375
40000
11.879
7.627
7.375
Number of sensorsN=18
10000
14.138
11.467
8.304
15000
14.030
10.654
7.412
20000
13.975
10.213
7.327
30000
13.567
8.649
7.310
40000
13.439
7.781
7.309
Number of sensorsN=21
10000
14.725
11.496
8.398
15000
14.098
10.912
7.406
20000
14.134
10.146
7.378
30000
13.320
8.697
7.294
40000
13.140
8.416
7.292
Number of sensorsN=24
10000
15.412
11.849
8.792
15000
14.678
11.102
7.509
20000
14.355
10.534
7.376
30000
14.297
8.912
7.324
40000
14.295
8.246
7.324


## 5. Conclusions

We have presented an improved PSO algorithm and applied it to the target tracking problem. The best dimension mutation method with quantum based reinitialization technique makes the particles escape from the local optima correspondingly easier and accelerates the convergence rate. Relatively this methodology does not increase the computational cost significantly compared with the original PSO algorithm and also it is more easily to implement. To sum up, the proposed BDMPSO algorithm shows better performance and achieves the results faster than other existing ones for target tracking problem. We plan to focus on shortening the convergence time of BDMPSO algorithm in further work.



---

*Source: 853430-2013-10-10.xml*