Ant Colony Pheromone Mechanism-Based Passive Localization Using UAV Swarm

Abstract

The problem of passive localization using an unmanned aerial vehicle (UAV) swarm is studied. For multi-UAV localization systems with limited communication and observation range, the challenge is how to obtain accurate target state consistency estimates through local UAV communication. In this paper, an ant colony pheromone mechanism-based passive localization method using a UAV swarm is proposed. Different from traditional distributed fusion localization algorithms, the proposed method makes use of local interactions among individuals to process the observation data with UAVs, which greatly reduces the cost of the system. First, the UAVs that have detected the radiation source target estimate the rough target position based on the pseudo-linear estimation (PLE). Then, the ant colony pheromone mechanism is introduced to further improve localization accuracy. The ant colony pheromone mechanism consists of two stages: pheromone injection and pheromone transmission. In the pheromone injection mechanism, each UAV uses the maximum likelihood (ML) algorithm with the current observed target bearing information to correct the initial target position estimate. Then, the UAV swarm weights and fuses the target position information between individuals based on the pheromone transmission mechanism. Numerical results demonstrate that the accuracy of the proposed method is better than that of traditional localization algorithms and close to the Cramer–Rao lower bound (CRLB) for small measurement noise.

1. Introduction

Passive localization technology using unmanned aerial vehicle (UAV) swarms has been developed and widely used in industry and military fields in recent years [1]. At present, the localization methods of UAV swarms can be mainly divided into two types: active localization and passive localization. Different from active localization, which actively emits electromagnetic waves, passive localization systems only receive and analyze the radiation source signal emitted by targets to obtain their location.

In actual application scenarios, time difference of arrival (TDOA) [2,3,4,5,6], received signal strength (RSS) [7,8,9,10,11], frequency difference of arrival (FDOA) [12], angle of arrival (AOA) [13,14,15,16,17,18,19,20,21,22], and their combined algorithms [23,24,25,26,27,28,29,30,31,32] are common passive localization techniques. However, TDOA and FDOA localization methoda require precise timing and synchronization, which increases the cost and complexity of the implementation. The performance of RSS localization significantly relies on the environment and thus, it is often used in indoor localization scenarios. Since the AOA source localization method does not require synchronization between receivers like TDOA localization, it is widely used [33].

In the application of AOA passive localization, the noise measurement equation is highly nonlinear with respect to the unknown target position. One of the most commonly used algorithms is the pseudo-linear estimator (PLE), which concentrates the nonlinear term into a noise term and estimates the target position using the least-square (LS) optimization algorithm [13,14]. By calculating the PL equation error, a distance weighted least-squares (DWLS) algorithm can be developed to more precisely measure the target position [15]. Meanwhile, how to reduce the estimation bias in AOA localization becomes an important problem. The maximum likelihood estimator (MLE) can be used to eliminate the measurement error of the system [16,17,18]. In terms of passive localization research for UAVs, the paired AOA information is used to improve the localization performance of the system [19]. The theory of UAV optimal heading angle generation is described in [20]. In some complex urban environments, the UAV passive localization is affected by the occlusion of buildings. The AOA localization algorithm for multipath fading and non-line-of-sight (NLOS) propagation is researched in [21]. The statistical algorithms are applied in [22] to find optimal and sub-optimal estimates. However, due to the limitations of UAVs’ computing power and real-time transmission bandwidth, the observed data of the above algorithms usually need to be transmitted to a ground center for processing. The main disadvantages of the centralized localization methods can be divided into the following: (a) too much dependence on the fusion center. If the link is cut off or interfered, the overall localization performance will be degraded; (b) localization algorithms cannot respond quickly to the emerging radiation source.

Meanwhile, some progress has been made in the research on decentralized mobile node localization. A mobile wireless sensor network localization algorithm was proposed in in [34], which improved the localization accuracy by using the Monte Carlo method. Ref. [35] introduced a delay-tolerant algorithm that eliminates the processing constraints of static sensor nodes. For the self-organizing network, Ref. [36] researched the cooperative method of network localization and node tracking, which improved the tracking performance of the system. The method mentioned above is realized on the premise that all sensor network nodes can receive the target signal. However, the beamwidth of UAV reconnaissance antennae is usually narrow in practical scenarios, and only a few UAVs can receive the target signal first. In this paper, the above problems can be solved by the ant colony localization algorithm based on the biological self-organization effect.

The ant colony pheromone mechanism originates from observing the self-organizing behavior of real ants to explore the cooperation mechanism [37]. Information transferring between individuals and the environment depends on the pheromone production [38]. Inspired by the ant colony foraging, this paper proposes a passive localization algorithm for UAV swarms based on the ant colony pheromone mechanism. Without increasing the number of UAVs, the target position can be accurately estimated.

Compared with existing methods, the main contributions of this paper are summarized as follows.

(a) Under the condition of limited UAV communication and observation range, the proposed method can obtain accurate target state consistency estimation through local UAV communication. Target position can be estimated by using only the information interaction between individuals. (b) The ant colony pheromone mechanism is introduced into the UAV swarm passive localization scenario to improve localization accuracy. (c) The influence of different passive localization algorithms and relevant parameters, e.g., the number of UAVs, the communication radius of UAV, on localization accuracy, are analyzed.

The rest of this paper is organized as follows: Section 2 models the scenario of passive localization of a UAV swarm. Section 3 contains a detailed analysis of the passive location algorithm based on the ant colony pheromone mechanism proposed in this paper. In Section 4, the performances of different algorithms are analyzed to demonstrate the effectiveness of the proposed method. Concluding remarks are given in Section 5.

2. Problem Description and Modeling

The UAV swarm passive localization geometry is shown in Figure 1. In order to obtain better localization result, it is assumed that K UAVs are evenly distributed in the rectangular area,

$$(x_i,y_i)\in [x_{min},x_{max}]\times [y_{min},y_{max}].$$

(1)

Assume that each UAV can only communicate with UAVs within a certain distance and denote this communication distance as $r_c$. The basic condition of short-range communication between the i th UAV and the j th UAV can be written as:

$$r_{i,j}=\sqrt{{(x_i-x_j)}^2+{(y_i-y_j)}^2},r_{i,j}\le r_c,(\forall i\ne j).$$

(2)

The position matrix of the UAV swarm can be expressed as:

$$\mathbf{U}={\left[{\mathbf{u}}_1,{\mathbf{u}}_2,\dots ,{\mathbf{u}}_K\right]}^{\mathrm{T}},{\mathbf{u}}_k={\left[x_k,y_k\right]}^{\mathrm{T}},k=1,2,\dots ,K$$

(3)

where $u_k$ denotes the position vector of the UAV; $x_k$ and $y_k$ represent the coordinate information. Let $\mathit{p}={[x,y]}^{\mathrm{T}}$ denote the position of a radiation source target. The angle between UAV and the target ${\theta }_k$ can be calculated by [39]:

$$sin{\theta }_k=\frac{x-x_k}{r_k},cos{\theta }_k=\frac{y-y_k}{r_k}$$

(4)

where ${\mathbf{r}}_k=∥\mathit{p}-{\mathbf{u}}_k∥$ is the distance between the UAV and the target.

The position relationship between UAVs is determined by

$$sin{\theta }_{i,j}=\frac{x_i-x_j}{r_{i,j}},cos{\theta }_{i,j}=\frac{y_i-y_j}{r_{i,j}}$$

(5)

where ${\theta }_{i,j}$ denotes the angle between the i th UAV and the j th UAV; $(x_i,y_i)$ and $(x_j,y_j)$ represent the coordinate information of $u_i$ and $u_j$, respectively.

The target bearing angle ${\widehat{\theta }}_k$ measured by the k th UAV consists of the real bearing angle ${\theta }_k$ and the noise $n_k$.

$${\widehat{\theta }}_k={\theta }_k+n_k$$

(6)

where $n_k$ can be modeled by a Gaussian random variable with zero mean and variance ${\sigma }_{nk}^2$.

3. The Proposed Method

The initial distribution of multiple UAVs are dispersed as illustrated in Figure 2, and each UAV is independently reconnoitering. If a UAV finds the radiation source signal, it will send the bearing information to the UAV within the communication radius. After receiving the radiation source bearing information, the UAVs in the neighborhood adjust their reconnaissance direction.

3.1. Target Initial Position Estimate

As shown in Figure 2, the UAVs marked by the red square indicate that the target was detected at the initial moment. Due to the different directions of the UAV reconnaissance direction, only a small number of UAVs can receive the radiation source signal. These UAVs perform coarse target localization based on the PLE algorithm as the initial estimated position of the target.

The observation equation can be represented as [14]:

$${\mathbf{a}}_k\mathit{p}={\mathit{b}}_k+{\mathbf{\xi }}_k$$

(7)

where ${\mathbf{a}}_k=[sin{\widehat{\theta }}_k,-cos{\widehat{\theta }}_k]$, ${\mathit{b}}_k=[sin{\widehat{\theta }}_k,-cos{\widehat{\theta }}_k]u_k$, and ${\xi }_k=r_{k}sin{n}_k$ is the error term caused by the bearing noise.

From the observation equations of K UAVs, we can obtain

$$\mathit{Ap}=\mathit{b}+\mathbf{\xi }$$

(8)

where $\mathit{A}={[{\mathbf{a}}_1^{\mathrm{T}}{\mathbf{a}}_2^{\mathrm{T}}...{\mathbf{a}}_K^{\mathrm{T}}]}^{\mathrm{T}}$, $\mathit{b}={[{\mathit{b}}_1^{\mathrm{T}}{\mathit{b}}_2^{\mathrm{T}}...{\mathit{b}}_K^{\mathrm{T}}]}^{\mathrm{T}}$ and $\mathbf{\xi }={[{\mathbf{\xi }}_1^{\mathrm{T}}{\mathbf{\xi }}_2^{\mathrm{T}}...{\mathbf{\xi }}_K^{\mathrm{T}}]}^{\mathrm{T}}$. The covariance matrix $\mathit{C}$ of the noise term $\mathbf{\xi }$ is given by $\mathit{C}=E\left[\mathbf{\xi }{\mathbf{\xi }}^{\mathrm{T}}\right]$.

According to the principle of LS and (8), the initial estimate position of the target by the PLE algorithm can be expressed as

$${\widehat{p}}_0={\left({\mathit{A}}^{\mathrm{T}}\mathit{A}\right)}^{-1}{\mathit{A}}^{\mathrm{T}}\mathit{b}.$$

(9)

3.2. The Ant Colony Pheromone Mechanism

The ant colony pheromone mechanism is derived from biological phenomena in nature. An ant colony can judge and choose its path using pheromone concentration to improve foraging efficiency. Inspired by ant colony foraging, a passive localization algorithm for UAV swarms based on the ant colony pheromone mechanism is proposed in this section. The ant colony pheromone mechanism can be divided into pheromone injection and pheromone transmission. The pheromone injection mechanism corrects the initial target position estimate based on a single individual, while the pheromone transmission mechanism further improves localization accuracy by weighting and fusing between individuals. The pheromone update mechanism is shown in Algorithm 1.

Algorithm 1 The pheromone update algorithm.

At time t,

Step1: Pheromone injection. Each UAV uses the current received target

bearing information to correct the initial position estimate ${\widehat{p}}_0$.

1:for $i=1:K$

2:   if the i th UAV contains target position information

3:       $\widehat{p_i}(t+1)=MLE(\widehat{p_i}\left(t\right),{\widehat{\theta }}_i\left(t\right),u_i)$

6:    End

7:End

Step2: Pheromone transmission. Each UAV is weighted by the pheromone

transmitted by other UAVs in the communication radius

1:for $i=1:K$

2:   for $j=1:K$

3:      if $r_{ij}\left(k\right)\le r_c,(\forall i\ne j)$, and  the j th UAV does not contain the

the target position pheromone

4:       ${\widehat{p}}_j(t+1)={\widehat{p}}_i\left(t\right)$

5:      else if the j th UAV contains the target position pheromone

6:       ${\widehat{p}}_j(t+1)={\omega }_{k,1}{\widehat{p}}_i\left(t\right)+{\omega }_{k,2}{\widehat{p}}_j\left(t\right)$

7:       End

8:    End

9:End

In Algorithm 1, ${\widehat{p}}_i\left(t\right)$ and ${\widehat{p}}_j\left(t\right)$ represent the existing target position estimate of the i th UAV and the j th UAV, respectively. ${\widehat{p}}_i(t+1)$ and ${\widehat{p}}_j(t+1)$ represent the target position estimate of the i th UAV and the j th UAV at the next moment, respectively. $MLE(\widehat{p_i}\left(t\right),{\widehat{\theta }}_i\left(t\right),u_i)$ denotes the MLE iteration algorithm, which uses the gradient descent method and the bearing information received by the i th UAV ${\widehat{\theta }}_i\left(t\right)$ to correct $\widehat{p_i}\left(t\right)$. ${\omega }_{k,1}$ and ${\omega }_{k,2}$ correspond to the weight information of different UAV pheromones, respectively.

3.2.1. Pheromone Injection

In the pheromone injection mechanism, each UAV uses the MLE algorithm and the current observed bearing information to correct the coarse target position estimate. The MLE of the target position is defined as the value of $\mathit{p}$ that maximizes the likelihood function. The likelihood function of the target bearing measured by K UAVs can be expressed as [40]:

$$f\left(\widehat{\mathbf{\theta }}\right|\mathit{p})={\displaystyle \frac{1}{{\left(2\pi \right)}^{K/2}{\left|\mathit{Q}\right|}^{1/2}}}{e}^{-1/2{(\widehat{\mathbf{\theta }}-\mathbf{\theta }\left(\mathit{p}\right))}^T{\mathit{Q}}^{-1}(\widehat{\mathbf{\theta }}-\mathbf{\theta }\left(\mathit{p}\right))}$$

(10)

where $\mathit{Q}=$diag$({\sigma }_{n1}^2,{\sigma }_{n2}^2,...,{\sigma }_{nK}^2)$ is the covariance matrix of bearing noise; diag() represents the function that transforms the row vector into a diagonal matrix. $\mathbf{\theta }\left(\mathit{p}\right)={[{\theta }_1\left(p\right){\theta }_2\left(p\right)...{\theta }_K\left(p\right)]}^{\mathrm{T}}$ is the true bearing vector and $\widehat{\mathbf{\theta }}={[{\widehat{\theta }}_1{\widehat{\theta }}_2...{\widehat{\theta }}_K]}^{\mathrm{T}}$ is the measured history bearings of the k th UAV.

The maximum value of the likelihood function can also be expressed as the minimum value of the cost function:

$$minf\left(\mathit{p}\right)={(\widehat{\mathbf{\theta }}-\mathbf{\theta }\left(\mathit{p}\right))}^{\mathrm{T}}{\mathit{Q}}^{-1}(\widehat{\mathbf{\theta }}-\mathbf{\theta }\left(\mathit{p}\right)).$$

(11)

The initial estimated position of the target obtained by Equation (9) is used as the input of the likelihood function, and the gradient descent method is used to iterate the target position. The estimated position of the target update is given by:

$${\widehat{\mathit{p}}}_{new}={\widehat{\mathit{p}}}_{old}-\alpha {\left[\frac{\partial f\left(\mathit{p}\right)}{\partial x}\frac{\partial f\left(\mathit{p}\right)}{\partial y}\right]}^{\mathrm{T}}$$

(12)

where ${\widehat{\mathit{p}}}_{new}$ and ${\widehat{\mathit{p}}}_{old}$ represent the target position before and after the update, respectively. $\alpha$ is the learning rate of the MLE algorithm. In the above, $\frac{\partial f\left(\mathit{p}\right)}{\partial x}$ and $\frac{\partial f\left(\mathit{p}\right)}{\partial y}$ are the partial derivatives of the function with respect to the target position [40], which are given by:

$$\frac{\partial f\left(\mathit{p}\right)}{\partial x}=2{(\theta \left(\mathit{p}\right)-\widehat{p})}^{\mathrm{T}}{\mathit{Q}}^{-1}\frac{\partial \theta \left(\mathit{p}\right)}{\partial x},$$

(13)

$$\frac{\partial f\left(\mathit{p}\right)}{\partial y}=2{(\theta \left(\mathit{p}\right)-\widehat{p})}^{\mathrm{T}}{\mathit{Q}}^{-1}\frac{\partial \theta \left(\mathit{p}\right)}{\partial y}.$$

(14)

where $\frac{\partial \theta \left(\mathit{p}\right)}{\partial x}$ and $\frac{\partial \theta \left(\mathit{p}\right)}{\partial y}$ can be obtained by:

$$\frac{\partial \theta \left(\mathit{p}\right)}{\partial x}={[\frac{-\Delta y_1}{r_1^2}\frac{-\Delta y_2}{r_2^2}...\frac{-\Delta y_K}{r_K^2}]}^{\mathrm{T}},$$

(15)

$$\frac{\partial \theta \left(\mathit{p}\right)}{\partial y}={[\frac{-\Delta x_1}{r_1^2}\frac{-\Delta x_2}{r_2^2}...\frac{-\Delta x_K}{r_K^2}]}^{\mathrm{T}}.$$

(16)

Here, $\Delta y_k=y-y_k$, $\Delta x_k=x-x_k$.

3.2.2. Pheromone Transmission

As shown in Figure 3, each UAV also receives the pheromone transmitted by other UAVs in the communication range when performing pheromone transmission. Compared with the initial state in Figure 2, more UAVs will be added to locate the radiation source through the pheromone transmission mechanism. If the current UAV already contains the target position estimate, it is fused with those estimates obtained by the UAVs within the communication radius in the Bayesian manner. After a limited number of communications and updates, each UAV receives the most accurate and consistent target bearing information.

When the bearing noise $n_k$ is small, ${\mathbf{\xi }}_k$ can be similarly expressed as:

$${\mathbf{\xi }}_k={\mathit{r}}_{k}sin{n}_k\approx {\mathit{r}}_k{n}_k.$$

(17)

The covariance matrix of noise term $\mathbf{\xi }$ can be obtained by:

$$\mathit{C}=\mathrm{diag}({\mathit{r}}_1^2{\sigma }_{n1}^2,{\mathit{r}}_2^2{\sigma }_{n2}^2,...,{\mathit{r}}_k^2{\sigma }_{nk}^2).$$

(18)

The weighted matrix $\mathit{W}$ is given by:

$$\mathit{W}={\mathit{C}}^{-1}=\mathrm{diag}(1/\left({\mathit{r}}_1^2{\sigma }_{n1}^2\right),1/\left({\mathit{r}}_2^2{\sigma }_{n2}^2\right),...,1/\left({\mathit{r}}_k^2{\sigma }_{nk}^2\right)).$$

(19)

In the case of K UAVs, the weight of m th UAV is given by:

$${\omega }_{k,m}=\frac{1/\left(r_m^2{\sigma }_{nm}^2\right)}{{\sum }_{i=1}^K\left(1/\left(r_i^2{\sigma }_{ni}^2\right)\right)}.$$

(20)

Assuming that the estimated value $\widehat{\mathit{p}}$ has a linear relationship with the measured values ${\widehat{\mathit{p}}}_{k,1}$, ${\widehat{\mathit{p}}}_{k,2}$,..., ${\widehat{\mathit{p}}}_{k,K}$ [41], the estimate value of multi-UAVs can be expressed as:

$$\widehat{\mathit{p}}={\omega }_{k,1}{\widehat{\mathit{p}}}_{k,1}+{\omega }_{k,2}{\widehat{\mathit{p}}}_{k,2}+...+{\omega }_{k,K}{\widehat{\mathit{p}}}_{k,K}.$$

(21)

Combining Equations (20) and (21), the position estimation of the target can be represented as:

$$\widehat{\mathit{p}}={\displaystyle \frac{1/\left({\mathit{r}}_1^2{\sigma }_{n1}^2\right){\widehat{\mathit{p}}}_{k,1}+1/\left({\mathit{r}}_2^2{\sigma }_{n2}^2\right){\widehat{\mathit{p}}}_{k,2}+...+1/\left({\mathit{r}}_K^2{\sigma }_{nK}^2\right){\widehat{\mathit{p}}}_{k,K}}{{\sum }_{i=1}^K\left(1/\left({\mathit{r}}_i^2{\sigma }_{ni}^2\right)\right)}}.$$

(22)

In the unbiased estimation problem, the Cramer–Rao lower bound (CRLB) is usually used to measure the validity of the estimate value. The closer the root mean square error (RMSE) of an estimate is to CRLB, the more accurate the estimate is. To calculate CRLB, the Fisher Matrix is introduced as follows:

$$\mathit{F}=\left[\begin{array}{cc}-\mathrm{E}\left[\frac{{\partial }^2}{\partial x^2}f(\widehat{\theta }\mid \mathit{p})\right]\hfill & -\mathrm{E}\left[\frac{{\partial }^2}{\partial x\partial y}f(\widehat{\theta }\mid \mathit{p})\right]\hfill \\ -\mathrm{E}\left[\frac{{\partial }^2}{\partial y\partial x}f(\widehat{\theta }\mid \mathit{p})\right]\hfill & -\mathrm{E}\left[\frac{{\partial }^2}{\partial y^2}f(\widehat{\theta }\mid \mathit{p})\right]\hfill \end{array}\right]$$

(23)

$$\mathit{F}={\left.⌈\frac{\partial \theta \left(\mathit{p}\right)}{\partial x}\frac{\partial \theta \left(\mathit{p}\right)}{\partial y}\right]}^T{\mathit{Q}}^{-\mathbf{1}}\left[\frac{\partial \theta \left(\mathit{p}\right)}{\partial x}\frac{\partial \theta \left(\mathit{p}\right)}{\partial y}\right]$$

(24)

$\mathit{Q}$ is the initial value of the covariance matrix $\mathit{C}$ of the noise term $\mathbf{\xi }$.

$$\mathit{Q}=\mathrm{diag}({\sigma }_{n1}^2,{\sigma }_{n2}^2,...,{\sigma }_{nK}^2).$$

(25)

Combining with Equations (15) and (16), the Fisher matrix can be represented as

$$\mathit{F}=\sum _{\mathrm{k}=1}^{\mathrm{K}}\frac{1}{{\sigma }_{\mathrm{nK}}^2{\mathrm{r}}_{\mathrm{k}}^4}\left[\begin{array}{cc}{\left(\Delta y_K\right)}^2& -\Delta x_K\Delta y_K\\ -\Delta x_K\Delta y_K& {\left(\Delta x_K\right)}^2\end{array}\right].$$

(26)

The CRLB is equal to the inverse of the Fisher matrix:

$$CRLB={\mathit{F}}^{-1}.$$

(27)

To summarize the proposed algorithm (Figure 4):

(a)

A small number of UAVs receiving radiation source signals use PLE to compute an initial target location estimate ${\widehat{p}}_0$;

(b)

Based on the pheromone injection mechanism, each UAV uses MLE to self-correct to obtain the next moment estimate ${\widehat{p}}_i(t+1)$;

(c)

Radiation source information can be transmitted to the whole network through the pheromone transmission mechanism. Each UAV is weighted with other individuals within the communication radius to obtain the revised target location estimate ${\widehat{p}}_j(t+1)$.

4. Simulation Results

In order to verify the performance of the proposed method, we present two numerical examples in this section. One is the case of a single-fixed target and the other is the case of a single-unfixed target. The proposed method is compared to the PLE, MLE, and weighted pseudo-linear estimator (WPLE) [14] algorithms. In the above algorithms, the MLE is computed using the gradient descent iterations and the initial estimation of the target position is set to be the result of the PLE. In the proposed method, the initial target position estimate is obtained by a small number of UAVs based on the PLE algorithm. Then, the ant colony pheromone mechanism is introduced to correct the initial target position. In the simulation experiment, the bearing measurement errors are assumed to be independent and identically distributed zero-mean Gaussian random variables.

4.1. A Single-Fixed Target

The simulation scenario is shown in Figure 5. The true target location is placed at (−155,175) m. 20 UAVs are randomly distributed in an area of 200 m × 200 m. The range of bearing noise standard deviation ${\sigma }_{nk}$ is set from $1^{\circ }$ to $8^{\circ }$, corresponding to 0.0175 to 0.1396 rad.

4.1.1. Bearing Standard Deviation

The RMSEs of the position estimate with the standard deviation of the bearing measurement noise ranging from 0.0175 to 0.1396 rad are shown in Figure 6. The communication radius of the UAVs $r_c$ is set to 60 m. Figure 6 demonstrates the superior performance of the proposed method compared with the PLE algorithm. The proposed method, MLE, and WPLE are very close to the CRLB for small measurement noise. The bias of position estimate is illustrated in Figure 7. We observe that the bias curves of the MLE and the proposed method are relatively close, and their performance is better than the PLE and the WPLE algorithms. From Figure 6 and Figure 7, it can be seen that the localization performance of the proposed method is very close to the MLE algorithm. The maximum RMSE difference between the proposed method and MLE algorithm does not exceed 0.3 m. Compared with the MLE algorithm, the proposed method only uses the local observation information of UAVs. The advantage of the proposed method is in realizing the distributed processing of UAV local observation information under limited communication and observation range.

4.1.2. The Number of UAVs

The RMSEs of the position estimate as a function of the number of UAVs ranging from 30 to 50 are shown in Figure 8. The bearing noise standard deviation ${\sigma }_{nk}$ and the UAV’s communication radius $r_c$ are set to $4\pi /180$ rad and 60 m, respectively. It can be seen that the performance of the proposed method is better than the PLE and the WPLE. The performance of the MLE method is closed to the CRLB. The bias of the PLE, WPLE, and MLE are compared with the proposed method in Figure 9. The proposed method produces smaller bias than that of the PLE, WPLE, and MLE over the measurement noise examined.

4.1.3. The Communication Radius of UAV

Figure 10 and Figure 11 illustrate the RMSE and bias results for the UAV’s communication radius ranging from 10 m to 100 m, respectively. The bearing noise standard deviation ${\sigma }_{nk}$ is set to $4\pi /180$ rad. As expected, with the increase of the communication radius of the UAVs, more UAVs are weighted in the pheromone transmission mechanism; therefore, the RMSE and bias of the proposed method gradually decrease.

4.2. A Single-Unfixed Target

A single-unfixed target localization geometry employed in the RMSE and bias is depicted in Figure 12. The target follows a linear trajectory defined by $y=x$ and generates $N=5$ target positions with equal intervals. The bearing noise standard deviation ${\sigma }_{nk}$ and the UAVs’ communication radius $r_c$ are set to $4\pi /180$ rad and 60 m, respectively. The number of UAVs is set to 20.

The RMSE and the bias of position estimate versus the target distance are shown in Figure 13 and Figure 14, respectively. Since the UAVs are gathered on one side of the target, the traditional distributed fusion method obtains relatively little target bearing information. However, the proposed method can realize the sharing of local localization information through the pheromone transmission mechanism, and so can achieve consistency of global estimation information. Each UAV is weighted with other UAVs in the neighborhood to improve positioning accuracy. The performance of the proposed method is better than the PLE, MLE, and WPLE algorithms. The RMSE curves of the PLE, MLE, and WPLE are close to each other. The position estimation bias results show that the proposed method yields the smallest bias. The PLE algorithm exhibits the worst bias among all the algorithms. While the biases of the MLE and WPLE algorithms are not as small as that of the proposed method, their errors are closer to the PLE algorithm.

5. Conclusions

In order to solve the problem of passive localization of UAV swarms under limited communication and observation range, a passive localization algorithm based on the ant colony pheromone mechanism was proposed in this paper. Firstly, the initial target position estimate was calculated by a small number of UAVs based on the PLE algorithm. Then, an ant colony pheromone mechanism, which includes pheromone injection and pheromone transmission, was introduced to improve the localization accuracy. Pheromone injection was used to modify the initial target localization estimate of a single individual. The information interaction between UAV individuals was used to improve the localization accuracy in the pheromone transmission mechanism. Finally, the localization performances of different algorithms and parameters were compared in simulation. The experimental results shown that the system with the added ant colony pheromone mechanism has higher localization correctness and RMSE performance close to the CRLB for small noise.