Shixun Wu , Miao Zhang , Kanapathippillai Cumanan , Kai Xu and Zhangli LanSingle Base Station Tracking Approaches with Hybrid TOA/AOD/AOA Measurements in Different Propagation EnvironmentsAbstract: In this paper, mobile terminal (MT) tracking based on time of arrival (TOA), angle of departure (AOD), and angle of arrival (AOA) measurements with one base station is investigated. The main challenge is the unknown propagation environment, such as line-of-sight (LOS), non-line-of-sight (NLOS) modeled as one-bounce scattering or mixed LOS/NLOS propagations, which may result in heterogeneous measurements. For LOS scenario, a linear Kalman filter (LKF) algorithm is adopted through analyzing and deriving the estimated error of MT. For NLOS scenario, as the position of scatterer is unknown, a nonlinear range equation is formulated to measure the actual AOD/AOA measurements and the position of scatterer, and three different algorithms: The extended Kalman filter (EKF), unscented Kalman filter (UKF) and an approximated LKF are developed. For mixed LOS/NLOS scenario, the modified interacting multiple model LKF (M-IMM-LKF) and the identified LKF algorithms (I-LKF) are utilized to address the issue of the frequent transition between LOS and NLOS propagations. In comparison with EKF and UKF algorithms, the simulation results and running time comparisons show the superiority and effectiveness of the LKF algorithm in LOS and NLOS scenarios. Both M-IMM-LKF and I-LKF algorithms are capable to significantly reduce the localization errors, and better than three existing algorithms. Keywords: Extended Kalman filter (EKF) , interacting multiple model (IMM) , linear Kalman filter (LKF) , non-line-of-sight (NLOS) , tracking , unscented Kalman filter (UKF) I. INTRODUCTIONPRECISE mobile terminal (MT) tracking is one of the key technologies that has numerous practical applications, such as emergency rescues, intelligent transportation systems, location-based services, as well as several commercial or military applications. The most widely utilized MT tracking approaches are based on the received signal strength (RSS), time of arrival (TOA), time difference of arrival (TDOA), and angle of arrival (AOA) measurements [1]–[5]. The main challenge for precise MT tracking is the non-lineof- sight (NLOS) propagation, where the line-of-sight (LOS) propagation between transmitter and receivers are blocked by different obstacles. A significant research work has been focused on this problem, which can be mainly divided into two groups, single measurement and hybrid measurements. For single measurement, MT tracking is achieved with a single type of measurement, i.e., TOA, TDOA, AOA or RSS. A linear Kalman-based interacting multiple model (IMM) algorithm is proposed in [6] to smooth the NLOS range measurement, which can accurately estimate the range distance between base station (BS) and MT. However, the NLOS range errors are assumed to be Gaussian random variables with known mean and variance. The work in [7] employs the estimated range errors for NLOS detection, where two biased extended Kalman filter (EKF) algorithms with NLOS mitigation are proposed. Due to the unknown condition of LOS or NLOS propagation, particle filter (PF) method is exploited to estimate the unknown condition, and then EKF is applied in [8]. The work in [9] utilizes the modified EKF to jointly estimate the state of MT and propagation condition, and a Bayesian data fusion algorithm is exploited to further reduce the tracking errors. For NLOS errors with the assumption of definite but unknown distributions, a Rao-blackwellized PF and parameter learning method is proposed in [10]. In [11], a robust EKF algorithm with robust regression for NLOS scenario is proposed, then by collaborating with another EKF algorithm, an IMM-based algorithm is formulated for mixed LOS/NLOS scenario. The work in [12] presents a method to distinguish NLOS measurements from LOS measurementss with standard deviation of range measurements and K-means clustering, where LOS measurement is reconstructed by polynomial fitting, and a novel EKF algorithm is developed. Utilizing the measured parameters of multipath, a multipath-assisted tracking algorithm for long-term evolution (LTE) systems is proposed in [13]. The cooperative localization method for tracking problems is investigated in [14], where a semi-definite programming (SDP) based cooperative tracking algorithm is proposed to mitigate the NLOS error. A novel NLOS identification algorithm based on distributed filtering and data association is studied in [15] to mitigate the effect of NLOS propagation. In [16], the multisensory single cluster filter is exploited to recursively estimate the state of MT and map feature, and a PF is presented. By utilizing biased feature of min-max algorithm, a hybrid constrained Kalman filter based on linear Kalman filter (LKF) and unscented Kalman filter (UKF) is investigated in [17]. Integrating Gaussian mixture model (GMM), IMM, and EKF, a Gaussian IMM-EKF algorithm is proposed to address the problem of the frequent transitions of range measurement between LOS and NLOS in [18]. Hypothesis testing is used for NLOS identification, an enhanced closest neighbor data association approach combined with PF is proposed in [19]. For hybrid measurements, the MT tracking can be achieved through multiple systems or multiple types of measurements, such as global navigation satellite system (GNSS)/cellular network, TOA/AOA, TDOA/AOA, TOA/RSS, etc. Three different EKF filter algorithms only with LOS propagation are evaluated by hybrid positioning which is based on signals from satellites and BSs [20]. In [21], NLOS identification and Kalman filter-based mitigation methods are utilized to reduce the NLOS error. An AOA selection process is used to deal with the effects of inaccurate NLOS AOA measurement, then a hybrid TDOA/AOA tracking algorithm based on EKF is presented to mitigate the effect of NLOS error. Combining EKF with IMM algorithm for accurately smoothing range estimate between BSs and MT, an extended Kalman-based IMM tracking algorithm with hybrid TOA/RSS measurement is proposed to mitigate the NLOS effects in [22]. By introducing a slack variable into motion state and considering the relationship between this variable and the position estimate, a hybrid unified Kalman tracking algorithm is developed with hybrid TOA/TDOA measurements in [23]. A hybrid scheme in an urban scenario with GNSS and cellular network is presented in [24], where the EKF algorithm is used to integrate the TDOA measurements from the cellular network and the pseudorange measurements from GNSS. Despite the approaches from the above mentioned works have the capability to effectively reduce the impact of NLOS errors, the hearability problem [6] may be a critical issue due to the assumption that there are three or more BSs involved in the tracking process. When a MT is near the serving BS, it must reduce its power to avoid causing interference to other users. However, too weak transmitted power may not be received by three or more nearby BSs to estimate the position of MT. In addition, involving multiple BSs simultaneously in the tracking process will result in additional information exchange overhead and latency [25], [26]. Fortunately, with emerging millimeter-wave technique for the fifth generation (5G) and beyond, it is possible to track the position of MT with one BS by exploiting TOA, AOA, and angle of departure (AOD) measurements [27]–[29], when both BS and MT are equipped with multiple antennas or array of antenna. The hybrid TOA/AOD/AOA localization method utilizing a single BS can be broadly classified into two categories: static positioning and dynamic tracking. The main challenge is the unknown propagation environment, i.e., LOS, one-bounce (OB) or multi-bounce (MB) scattering. For static positioning, under the premise of OB scattering, a nonlinear constrained optimization localization approach is present to reduce the feasible search area of solution by leveraging AOD and AOA measurements [30]. By exploiting the geometric relation between AOD and AOA, a theoretic threshold is derived to decide whether the propagation path is LOS or NLOS. Subsequently, a data fusion localization algorithm, incorporating residual weighting, is employed to process both LOS and OB scattering measurements [31]. The estimated errors of OB scattering paths are derived, a linear cooperative localization algorithm is proposed by one-order Taylor expansion in [32]. When the MB scattering is present, without the synchronization between MT and BS, the work in [33] proposes a double identification algorithm to identify and discard the MB path. Meanwhile, an ensemble learningbased model is proposed to classify the LOS, OB, or MB paths using 5G channel parameters [34]. Moreover, an iterative weighted least square is proposed to mitigate the effects of MB paths with different weights [35]. It is noteworthy that the aforementioned works operate under the assumption of a multipath environment, where only LOS and OB paths are deemed conducive to enhancing positioning accuracy. For dynamic tracking, an EKF tracking algorithm with the position of scatters is proposed in [36], premised on stationary scatterers and OB environment. With the assumption of LOS and OB NLOS paths, a radio-environmental mapping assisted PF is proposed to accurately estimate the position of MT as well as nearby scatterers [27]. However, the positions of MT and scatterer are integrated into the state space, resulting in a high dimensional unknown parameter space. A nonlinear least squares method is employed to estimate the position of MT and the orientation relative to the BS, subsequently leveraging a LKF to perform MT tracking [37]. The time bias is introduced, an ordinary differential equation (ODE) solver integrated with a long short-term memory (LSTM) network is proposed to achieve continuous and precise tracking [38]. Nevertheless, these approaches primarily focus on OB paths. In a multipath environment, when a LOS path is available, its measured parameters offer superior suitability and reliability for tracking compared to OB paths, even though OB paths can contribute to improved tracking performance. In the absence of a LOS path, OB paths are utilized for tracking. Due to the uncertainty surrounding scatterers, only one path is typically considered. To the best of our knowledge, none of the existing works has considered developing a hybrid TOA/AOD/AOA tracking approach with single BS and one path. In this paper, we distinguish our approach from prior works in [27], [36] by excluding the position of scatterers in the state space model for the OB NLOS environment. Furthermore, we analyze the scenarios involving LOS or OB paths without considering MB paths, which are more relevant to practical applications than the works in [37], [38] that only OB path is present. This choice is justified by two reasons. On the one hand, MB paths with significant attenuation and weaker signal strengths are infrequent in millimeter-wave frequencies, as noted in [27], [39]. On the other hand, LOS or OB paths can be effectively distinguished within a multipath environment, as demonstrated in [33], [34]. Hence, we investigate three distinct propagation environments, i.e., LOS, OB or hybrid LOS/OB propagation environment. The primary challenges for hybrid TOA/AOD/AOA tracking lie in the unknown position of scatterers in NLOS scenarios and the frequent transitions between LOS and NLOS propagation. To tackle these challenges, an approximated LKF is utilized to deal with the unknown position of scatterer, while the modified interacting multiple model LKF (M-IMM-LKF) and the identified LKF algorithms (I-LKF) are exploited to address the issue of the frequent transition between LOS and NLOS propagation. Our contributions can be summarized as follows: 1) Firstly, for LOS environment, hybrid TOA/AOD/AOA measurements is divided into two combinations, each combination can estimate the position of MT with the geometry relation, and a new LKF algorithm is proposed to track the position of MT by deriving the estimated error of MT. 2) Secondly, for NLOS environment, the NLOS propagation is modeled as OB scattering. Due to the unknown position of scatterer, the nonlinear relationship between position of scatterer and the actual AOD/AOA measurements is constructed. Plugging this relationship and the position of BS into NLOS TOA measurement equation, a new nonlinear measurement equation is defined. Similarly, the EKF and UKF algorithms can be directly realized to track the position of MT with this new measurement equation. However, due to the high computational complexity of UKF and low tracking accuracy of EKF, an approximated LKF algorithm is proposed by utilizing the geometric feature among the actual TOA/AOD/AOA measurements. 3) Thirdly, for mixed LOS/NLOS environment, the key issue is the frequent transition between LOS and NLOS, which leads to the large tracking error. To address this issue, M-IMM-LKF and I-LKF algorithms based on the developed LOS and NLOS LKF algorithms are proposed. 4) Finally, extensive simulation results are conducted to evaluate the performance of the developed algorithms. The proposed LKF algorithms show the better tracking accuracy and lower running time than EKF algorithm in LOS or NLOS environment. Additionally, the M-IMMLKF and I-LKF algorithms can reduce the tracking error in mixed LOS and NLOS environment, when the transition between LOS and NLOS occurs. The rest of this paper is organized as follows. In Section II, state and measurement models are presented. Section III demonstrates the EKF algorithm and derives the LKF algorithm for LOS environment. Section IV develops the EKF, UKF and LKF algorithms for NLOS environment. In Section V, two new algorithms referred to as M-IMM-LKF and I-LKF are presented. Section VI provides simulation results to demonstrate the effectiveness of the proposed algorithms. Finally, conclusions are drawn in Section VII. II. SYSTEM MODELA. State ModelIn this paper, we consider a moving MT with motion state [TeX:] $$X(k)=[x(k), y(k), x(k), y(k)]^T,$$ where (x(k), y(k)) denote the horizontal and vertical coordinates of MT at time instant [TeX:] $$k, \quad(\dot{x {(k)}}, \dot{y(k)})$$ are the corresponding horizontal and vertical velocities. The MT served by home BS is moving on a 2Dplane and its movement with random acceleration can be modeled as [6]–[12], [20], [21]
where
[TeX:] $$A=\left[\begin{array}{cccc} 1 & 0 & \Delta t & 0 \\ 0 & 1 & 0 & \Delta t \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{array}\right], G=\left[\begin{array}{cc} \Delta t^2 / 2 & 0 \\ 0 & \Delta t^2 / 2 \\ \Delta t & 0 \\ 0 & \Delta t \end{array}\right],$$ and [TeX:] $$\Delta t$$ is the sampling period. The vector-valued processing noise [TeX:] $$W(k-1)=\left[w_x(k-1), w_y(k-1)\right]^T$$ is assumed to be a Gaussian random variable with zero mean and covariance [TeX:] $$Q=\sigma_w^2 \cdot I_{2 \times 2},$$ where [TeX:] $$I_{2 \times 2} \text { is a } 2 \times 2$$ identity matrix. B. Measurement ModelThe signal propagation between the BS and the MT is LOS or OB scattering, as shown in Fig. 1. The MT transmits the signal to the serving BS while trying to localize itself. From the development of multiple-input multiple-output (MIMO) and millimeter wave techniques, we can obtain three parameters, i.e., the measured range, the AOD and the AOA of the propagation path [26], [40]. Therefore, when the signal experiences LOS propagation path, its mathematical expressions are given by
(2)[TeX:] $$\begin{aligned} r(k) & =\sqrt{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2}+n(k) \\ & =r^0(k)+n(k)=c \cdot t(k), \\ \alpha(k) & =\alpha^0(k)+m(k), \\ \beta(k) & =\beta^0(k)+v(k), \end{aligned}$$
[TeX:] $$\begin{gathered} \alpha^0(k)= \begin{cases}\operatorname{atan}\left(\frac{y_1-y(k)}{x_1-x(k)}\right), & x_1 \geq x(k), y_1 \geq y(k), \\ \pi+\operatorname{atan}\left(\frac{y_1-y(k)}{x_1-x(k)}\right), & x_1 \lt x(k), y_1 \geq y(k), \\ \pi+\operatorname{atan}\left(\frac{y_1-y(k)}{x_1-x(k)}\right), & x_1 \lt x(k), y_1 \lt y(k), \\ 2 \pi+\operatorname{atan}\left(\frac{y_1-y(k)}{x_1-x(k)}\right), & x_1 \geq x(k), y_1 \lt y(k),\end{cases} \\ \beta^0(k)= \begin{cases}\operatorname{atan}\left(\frac{y(k)-y_1}{x(k)-x_1}\right), & x(k) \geq x_1, y(k) \geq y_1, \\ \pi+\operatorname{atan}\left(\frac{y(k)-y_1}{x(k)-x_1}\right), & x(k) \lt x_1, y(k) \geq y_1, \\ \pi+\operatorname{atan}\left(\frac{y(k)-y_1}{x(k)-x_1}\right), & x(k) \lt x_1, y(k) \lt y_1, \\ 2 \pi+\operatorname{atan}\left(\frac{y(k)-y_1}{x(k)-x_1}\right), & x(k) \geq x_1, y(k) \lt y_1,\end{cases} \end{gathered}$$ where [TeX:] $$\left(x_1, y_1\right)$$ is the position of home BS, c is the speed of light, [TeX:] $$t(k), \alpha(k), \text { and } \beta(k)$$ are the measured TOA, AOD, and AOA parameters, respectively. The [TeX:] $$r^0(k), \alpha^0(k), \text { and } \beta^0(k)$$ denote the actual range, the AOD and the AOA, respectively, whereas atan is the function of inverse tangent. The n(k), m(k), and v(k) are white Gaussian random variables with the standard deviation [TeX:] $$\sigma_n, \sigma_\alpha, \text { and } \sigma_\beta,$$ respectively. However, for the signal experiencing OB scattering path [26], [29]–[42], the mathematical expressions can be provided as
(3)[TeX:] $$\begin{aligned} r(k)= & \sqrt{\left(x(k)-x^{\prime}(k)\right)^2+\left(y(k)-y^{\prime}(k)\right)^2} \\ & +\sqrt{\left(x_1-x^{\prime}(k)\right)^2+\left(y_1-y^{\prime}(k)\right)^2}+n(k) \\ = & r^0(k)+n(k)=c \cdot t(k), \\ \alpha(k) & =\alpha^0(k)+m(k), \\ \beta(k) & =\beta^0(k)+v(k), \end{aligned}$$
[TeX:] $$\begin{gathered} \alpha^0(k)=\begin{cases} \operatorname{atan}\left(\frac{y^{\prime}(k)-y(k)}{x^{\prime}(k)-x(k)}\right), & x^{\prime}(k) \geq x(k), y^{\prime}(k) \geq y(k), \\ \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y(k)}{x^{\prime}(k)-x(k)}\right), & x^{\prime}(k) \lt x(k), y^{\prime}(k) \geq y(k), \\ \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y(k)}{x^{\prime}(k)-x(k)}\right), & x^{\prime}(k) \lt x(k), y^{\prime}(k) \lt y(k), \\ 2 \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y(k)}{x^{\prime}(k)-x(k)}\right), & x^{\prime}(k) \geq x(k), y^{\prime}(k) \lt y(k), \end{cases} \\ \beta^0(k)=\begin{cases} \operatorname{atan}\left(\frac{y^{\prime}(k)-y_1}{x^{\prime}(k)-x_1}\right), & x^{\prime}(k) \geq x_1, y^{\prime}(k) \geq y_1, \\ \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y_1}{x^{\prime}(k)-x_1}\right), & \left.x^{\prime}(k\right) \lt x_1, y^{\prime}(k) \geq y_1, \\ \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y_1}{x^{\prime}(k)-x_1}\right), & x^{\prime}(k) \lt x_1, y^{\prime}(k) \lt y_1, \\ 2 \pi+\operatorname{atan}\left(\frac{y^{\prime}(k)-y_1}{x^{\prime}(k)-x_1}\right), & x^{\prime}(k) \geq x_1, y^{\prime}(k) \lt y_1, \end{cases} \end{gathered}$$ where [TeX:] $$\left(x^{\prime}(k), y^{\prime}(k)\right)$$ is the unknown position of the scatterer at time k. The continuous motion of MT inherently results in dynamic variations within the propagation paths. In addition, in a multipath environment where LOS path is absent, one OB path is typically selected for MT tracking. However, it cannot guarantee that an OB path with similar scattering characteristics will consistently be chosen at any given time. As a result, the random position of scatter is more convincing and adaptable to the different propagation environment. III. THE PROPOSED TRACKING ALGORITHMS WITH ONLY LOS PATHIn the LOS propagation environment, based on the linear state model defined in (1), we can directly apply the existing algorithms, such as EKF or UKF to track the position of MT with nonlinear measurement parameters that are shown in (2). Since this nonlinear measurement can be adequately approximated utilizing the first-order Taylor series linearization, an EKF is introduced, offering a comparable performance to the UKF while providing a reduced computational burden. Furthermore, leveraging the geometric relationship among TOA/AOD/AOA measurements offers a potential to further enhance the tracking performance. A. The Tracking Algorithms based on Nonlinear FilteringThe nonlinear measurement parameters defined in (2) can be expressed as a vector form:
where
[TeX:] $$\begin{aligned} \mathbf{r}(k) & =\left[\begin{array}{c} r(k) \\ \alpha(k) \\ \beta(k) \end{array}\right], \mathbf{n}(k)=\left[\begin{array}{c} n(k) \\ m(k) \\ v(k) \end{array}\right], \\ \mathbf{h}(X(k)) & =\left[\begin{array}{c} \sqrt{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2} \\ \alpha^0(k) \\ \beta^0(k) \end{array}\right] . \end{aligned}$$ This nonlinear measurement can be linearized around the predicted estimate [TeX:] $$\hat{X}(k)$$ and it is expressed as
where
(6)[TeX:] $$H=\left[\frac{\partial \mathbf{h}}{\partial x(k)}(\hat{X}(k)), \frac{\partial \mathbf{h}}{\partial y(k)}(\hat{X}(k)), \mathbf{0}_{3 \times 1}, \mathbf{0}_{3 \times 1}\right],$$
[TeX:] $$\begin{aligned} \frac{\partial \mathbf{h}}{\partial x(k)}=\left[\begin{array}{c} \frac{x(k)-x_1}{\sqrt{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2}} \\ -\frac{y(k)-y_1}{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2} \\ -\frac{y(k)-y_1}{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2} \end{array}\right], \\ \frac{\partial \mathbf{h}}{\partial y(k)}=\left[\begin{array}{c} \frac{y(k)-y_1}{\sqrt{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2}} \\ \frac{x(k)-x_1}{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2} \\ \frac{x(k)-x_1}{\left(x(k)-x_1\right)^2+\left(y(k)-y_1\right)^2} \end{array}\right] . \end{aligned}$$ By substituting (5) into (4), we obtain the approximated measurement equations:
The EKF recursive algorithm [36] for LOS propagation environment is summarized in Algorithm 1. B. The Tracking Algorithms based on Linear FilteringIt is obvious that LOS propagation is the special case of OB scattering. As shown in Fig. 2, when the path is LOS propagation, the scatterer C is on the line of BS and MT, both A and B will converge to the position of MT. Thus, we can utilize the position of A and B to estimate the position of MT. The position of A and B related to the measured model in (2) can be calculated as
(8)[TeX:] $$\binom{x_A}{y_A}=\binom{x_1}{y_1}+\binom{r(k) \cdot \cos (\beta(k))}{r(k) \cdot \sin (\beta(k))},$$
(9)[TeX:] $$\binom{x_B}{y_B}=\binom{x_1}{y_1}-\binom{r(k) \cdot \cos (\alpha(k))}{r(k) \cdot \sin (\alpha(k))} .$$In general, it is assumed that the angle noise v(k) is small. Therefore, we have [TeX:] $$\cos (v(k)) \approx 1 \text { and } \sin (v(k)) \approx v(k) .$$ Substituting the angle measurement equations (2) into (8) and dropping the quadratic term of the noise, the following approximation can be obtained
(10)[TeX:] $$\begin{aligned} \binom{x_A}{y_A} & \approx\binom{x_1}{y_1}+\binom{r^0(k) \cdot \cos \left(\beta^0(k)\right)+a_1}{r^0(k) \cdot \sin \left(\beta^0(k)\right)+b_1} \\ & =\binom{x(k)}{y(k)}+\binom{a_1}{b_1}, \end{aligned}$$where [TeX:] $$a_1=-r^0(k) \cdot \sin \left(\beta^0(k)\right) \cdot v(k)+\cos \left(\beta^0(k)\right) \cdot n(k),$$ [TeX:] $$b_1=r^0(k) \cdot \cos \left(\beta^0(k)\right) \cdot v(k)+\sin \left(\beta^0(k)\right) \cdot n(k) \text {. }$$ Similarly the position of B can be derived as
(11)[TeX:] $$\begin{aligned} \binom{x_B}{y_B} & \approx\binom{x_1}{y_1}-\binom{r^0(k) \cdot \cos \left(\alpha^0(k)\right)+a_2}{r^0(k) \cdot \sin \left(\alpha^0(k)\right)+b_2} \\ & =\binom{x(k)}{y(k)}+\binom{a_2}{b_2}, \end{aligned}$$where [TeX:] $$a_2=r^0(k) \cdot \sin \left(\alpha^0(k)\right) \cdot m(k)-\cos \left(\alpha^0(k)\right) \cdot n(k),$$ [TeX:] $$b_2=-r^0(k) \cdot \cos \left(\alpha^0(k)\right) \cdot m(k)-\sin \left(\alpha^0(k)\right) \cdot n(k) .$$ Combining (10) with (11), a new linear measurement equation with matrix form is expressed as
where
(13)[TeX:] $$\begin{gathered} H_1=\left[\begin{array}{llll} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{array}\right], S(k)=\frac{1}{2}\binom{a_1+a_2}{b_1+b_2}, \\ Y_1(k)=\frac{1}{2}\left(\binom{x_A}{y_A}+\binom{x_B}{y_B}\right) . \end{gathered}$$Due to the unknown actual range and angles of the vector S(k), we exploit the measured range and angles to replace them. Then, we can express the covariance estimate of S(k) as
where
(15)[TeX:] $$\begin{aligned} R_{11}= & \frac{1}{4}\left((\cos (\beta(k))-\cos (\alpha(k)))^2 \cdot \sigma_n^2+(r(k) \cdot \sin (\alpha(k)))^2\right. \\ & \left.\times \sigma_\alpha^2+(r(k) \cdot \sin (\beta(k)))^2 \cdot \sigma_\beta^2\right), \end{aligned}$$
(16)[TeX:] $$\begin{aligned} & R_{22}= \\ & \frac{1}{4}\left((\sin (\beta(k))-\sin (\alpha(k)))^2 \times \sigma_n^2+(r(k) \cdot \cos (\alpha(k)))^2\right. \\ & \left.\times \sigma_\alpha^2+(r(k) \cdot \cos (\beta(k)))^2 \cdot \sigma_\beta^2\right), \end{aligned}$$
(17)[TeX:] $$\begin{aligned} & R_{12}=R_{21}= \\ & \frac{1}{4}((\cos (\beta(k))-\cos (\alpha(k))) \cdot(\sin (\beta(k)) \\ & \quad-\sin (\alpha(k))) \cdot \sigma_n^2-r(k)^2 \cdot \sin (\alpha(k)) \cdot \cos (\alpha(k)) \\ & \left.\times \sigma_\alpha^2-r(k)^2 \cdot \sin (\beta(k)) \cdot \cos (\beta(k)) \cdot \sigma_\beta^2\right), \end{aligned}$$From (8) to (17), the TOA/AOD/AOA measurements are strategically segregated into two distinct combinations: TOA/AOD and TOA/AOA. Each of these combinations individually computes the position of MT by exploiting the underlying geometric relations, subsequently averaging the results to mitigate the impact of noise. Therefore, the tracking performance of LKF can be improved. Combing (1) and (12), the classical LKF recursive algorithm for LOS propagation environment is given in Algorithm 2. IV. THE PROPOSED TRACKING ALGORITHMS WITH ONLY OB PATHIn the OB scattering scenario, although the measured parameters shown in (3) are the nonlinear function of motion state X(k), it is not possible to directly apply the existing algorithms, such as EKF or UKF, to track the position of MT. This is due to the fact that the position of the scatterer is unknown. In this section, we present two methods to cope with this problem. One is to derive the nonlinear relation between position of scatterer and the actual AOD/AOA, and the other one is to construct a new linear relation of the motion state X(k) utilizing the geometric feature among the actual TOA/AOD/AOA. A. The Tracking Algorithms based on Nonlinear FilteringAs shown in Fig. 2, the position of scatterer C is the interSection point of two lines. The equations of these two lines can be expressed as
(18)[TeX:] $$\begin{aligned} y-y(k) & =\tan \left(\alpha^0(k)\right) \cdot(x-x(k)) \\ y-y_1 & =\tan \left(\beta^0(k)\right) \cdot\left(x-x_1\right), \end{aligned}$$where tan is the function of tangent. Therefore, we can compute the position of scatterer as
(19)[TeX:] $$\begin{aligned} x^{\prime}(k) & =\frac{a}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}, \\ y^{\prime}(k) & =\frac{b}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}, \end{aligned}$$where [TeX:] $$a=y_1-\tan \left(\beta^0(k)\right) \cdot x_1+x(k) \cdot \tan \left(\alpha^0(k)\right)-y(k),$$ [TeX:] $$b=\tan \left(\alpha^0(k)\right) \cdot y_1-\tan \left(\alpha^0(k)\right) \cdot \tan \left(\beta^0(k)\right) \cdot x_1+\tan \left(\alpha^0(k)\right) \cdot \tan \left(\beta^0(k)\right) \cdot x(k)-\tan \left(\beta^0(k)\right) \cdot y(k).$$ Substituting (19) into (3), we can obtain the nonlinear measurement as follows:
where
(21)[TeX:] $$\begin{aligned} h(X(k), m(k), v(k))= & \sqrt{\left(x(k)-x^{\prime}(k)\right)^2+\left(y(k)-y^{\prime}(k)\right)^2} \\ & +\sqrt{\left(x_1-x^{\prime}(k)\right)^2+\left(y_1-y^{\prime}(k)\right)^2}, \end{aligned}$$Following similar concepts of Taylor series, we can linearize this nonlinear measurement function around the predicted estimate [TeX:] $$\hat{X}(k)$$ using the partial derivatives of the measurement function as follows:
(22)[TeX:] $$\begin{aligned} h(X(k), m(k), v(k))= & h(\hat{X}(k), 0,0)+H \cdot(X(k)-\hat{X}(k)) \\ & +V \cdot\binom{m(k)}{v(k)}, \end{aligned}$$where
(23)[TeX:] $$H=\left[\frac{\partial h}{\partial x(k)}(\hat{X}(k), 0,0), \frac{\partial h}{\partial y(k)}(\hat{X}(k), 0,0), 0,0\right],$$
[TeX:] $$\begin{aligned} \frac{\partial h}{\partial x(k)}= & \frac{\left(x^{\prime}(k)-x(k)\right)\left(\frac{\partial x^{\prime}(k)}{\partial x(k)}-1\right)+\left(y^{\prime}(k)-y(k)\right) \frac{\partial y^{\prime}(k)}{\partial x(k)}}{\sqrt{\left(x^{\prime}(k)-x(k)\right)^2+\left(y^{\prime}(k)-y(k)\right)^2}} \\ & +\frac{\left(x^{\prime}(k)-x_1\right) \frac{\partial x^{\prime}(k)}{\partial x(k)}+\left(y^{\prime}(k)-y_1\right) \frac{\partial y^{\prime}(k)}{\partial x(k)}}{\sqrt{\left(x^{\prime}(k)-x_1\right)^2+\left(y^{\prime}(k)-y_1\right)^2}}, \\ \frac{\partial h}{\partial y(k)}= & \frac{\left(x^{\prime}(k)-x(k)\right) \frac{\partial x^{\prime}(k)}{\partial y(k)}+\left(y^{\prime}(k)-y(k)\right)\left(\frac{\partial y^{\prime}(k)}{\partial y(k)}-1\right)}{\sqrt{\left(x^{\prime}(k)-x(k)\right)^2+\left(y^{\prime}(k)-y(k)\right)^2}} \\ + & \frac{\left(x^{\prime}(k)-x_1\right) \frac{\partial x^{\prime}(k)}{\partial y(k)}+\left(y^{\prime}(k)-y_1\right) \frac{\partial y^{\prime}(k)}{\partial y(k)}}{\sqrt{\left(x^{\prime}(k)-x_1\right)^2+\left(y^{\prime}(k)-y_1\right)^2}}, \\ & \frac{\partial x^{\prime}(k)}{\partial x(k)}=\frac{\tan \left(\alpha^0(k)\right)}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}, \\ & \frac{\partial x^{\prime}(k)}{\partial y(k)}=-\frac{1}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}, \\ & \frac{\partial y^{\prime}(k)}{\partial x(k)}=\frac{\tan \left(\alpha^0(k)\right) \cdot \tan \left(\beta^0(k)\right)}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)} \\ &\frac{\partial y^{\prime}(k)}{\partial y(k)}=-\frac{\tan \left(\beta^0(k)\right)}{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}, \end{aligned}$$
(24)[TeX:] $$V=\left[\frac{\partial h}{\partial m(k)}(\hat{X}(k), 0,0), \frac{\partial h}{\partial v(k)}(\hat{X}(k), 0,0), 0,0\right],$$
[TeX:] $$\begin{aligned} \frac{\partial h}{\partial m(k)}= & \frac{\left(x^{\prime}(k)-x(k)\right)\left(\frac{\partial x^{\prime}(k)}{\partial m(k)}-1\right)+\left(y^{\prime}(k)-y(k)\right) \frac{\partial y^{\prime}(k)}{\partial m(k)}}{\sqrt{\left(x^{\prime}(k)-x(k)\right)^2+\left(y^{\prime}(k)-y(k)\right)^2}} \\ & +\frac{\left(x^{\prime}(k)-x_1\right) \frac{\partial x^{\prime}(k)}{\partial m(k)}+\left(y^{\prime}(k)-y_1\right) \frac{\partial y^{\prime}(k)}{\partial m(k)}}{\sqrt{\left(x^{\prime}(k)-x_1\right)^2+\left(y^{\prime}(k)-y_1\right)^2}}, \\ \frac{\partial h}{\partial v(k)}= & \frac{\left(x^{\prime}(k)-x(k)\right) \frac{\partial x^{\prime}(k)}{\partial v(k)}+\left(y^{\prime}(k)-y(k)\right)\left(\frac{\partial y^{\prime}(k)}{\partial v(k)}-1\right)}{\sqrt{\left(x^{\prime}(k)-x(k)\right)^2+\left(y^{\prime}(k)-y(k)\right)^2}} \\ + & \frac{\left(x^{\prime}(k)-x_1\right) \frac{\partial x^{\prime}(k)}{\partial v(k)}+\left(y^{\prime}(k)-y_1\right) \frac{\partial y^{\prime}(k)}{\partial v(k)}}{\sqrt{\left(x^{\prime}(k)-x_1\right)^2+\left(y^{\prime}(k)-y_1\right)^2}}, \\ \frac{\partial x^{\prime}(k)}{\partial m(k)}=& \frac{x(k) \cdot \frac{-\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)\right)}{\cos ^2\left(\alpha^0(k)\right)}-\frac{-a}{\cos ^2\left(\alpha^0(k)\right)}}{\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)\right)^2}, \\ \frac{\partial y^{\prime}(k)}{\partial m(k)}=& \frac{x_1 \cdot \frac{\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)}{\cos ^2\left(\alpha^0(k)\right)}-\frac{a}{\cos ^2\left(\alpha^0(k)\right)}}{\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)\right)^2}, \\ \frac{\partial x^{\prime}(k)}{\partial v(k)}= & \frac{d \cdot\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)\right)+b \cdot \frac{1}{\cos ^2\left(\alpha^0(k)\right)}}{\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)^2\right.}, \\ \frac{\partial y^{\prime}(k)}{\partial v(k)}= & \frac{e \cdot\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)\right)-b \cdot \frac{1}{\cos ^2\left(\beta^0(k)\right)}}{\left(\tan \left(\alpha^0(k)\right)-\tan \left(\beta^0(k)\right)^2\right.}, \\ d= & -y_1 \cdot \frac{1}{\cos ^2\left(\alpha^0(k)\right)}+\left(x_1-x(k)\right) \cdot \tan \left(\beta^0(k)\right) \cdot \frac{1}{\cos ^2\left(\alpha^0(k)\right)}, \\ e= & \left(x_1-x(k)\right) \cdot \tan \left(\alpha^0(k)\right) \cdot \frac{1}{\cos ^2\left(\beta^0(k)\right)}+y(k) \cdot \frac{1}{\cos ^2\left(\beta^0(k)\right)} . \end{aligned}$$ Substituting (22) into (20), we obtain the approximated range as follows:
(25)[TeX:] $$\begin{aligned} r(k)= & h(\hat{X}(k), 0,0)+H \cdot(X(k)-\hat{X}(k)) \\ & +V \cdot\binom{m(k)}{v(k)}+n(k) . \end{aligned}$$Thus, the EKF recursive algorithm for OB scattering environment is summarized in Algorithm 3. As we know, EKF linearizes the nonlinear system model by Taylor series expansion and assumes that the noise is Gaussian distribution. From (20), due to the unknown scatterer whose position is computed from (19), it is highly nonlinear relation with the position of MT. In addition, the noise in (20) is non-Gaussian. Therefore, EKF may lead to large errors in OB scattering environment. Different to EKF, the UKF approximates the probability distribution of nonlinear functions through the unscented transform, a process that does not entirely rely on the assumption of Gaussian noise. The UKF selects a specific set of points known as sigma points, which can represent the Gaussian distribution of the original state. These points are then transformed through the nonlinear function, yielding an approximation of the probability distribution of the transformed state. This method can preserve the characteristics of nonlinear functions more accurately, thereby providing good performance even when dealing with nonlinear Gaussian noise [43], [44]. Furthermore, in our tracking problem, the state model of (1) is linear and Gaussian, whereas the measurement model of (20) is nonlinear and non-Gaussian. This scenario can be effectively handled by the UKF [44], and the utilization of particle filters is advocated in scenarios for which the models are entirely nonlinear and non-Gaussian. Since the state vector can be predicted from (1), we can directly generate the sigma points in the UKF through unscented transform
(26)[TeX:] $$\chi^i(k)=\left\{\begin{array}{cc} \hat{X}^{\prime}(k), & i=0 \\ \hat{X}^{\prime}(k)+\left(\sqrt{(M+\lambda) \hat{P}^{\prime}(k)}\right)^i, \\ i=1, \cdots, M \\ \hat{X}^{\prime}(k)-\left(\sqrt{(M+\lambda) \hat{P}^{\prime}(k)}\right)^i, \\ i=M+1, \cdots, 2 M \end{array}\right.$$where M is the dimension of vector [TeX:] $$\hat{X}^{\prime}(k), \lambda=\alpha^2(M+\kappa)-M$$ is a scaling parameter, α is a parameter that determines the spread of the sigma points and is usually set to a small positive value (for example, 1e-3), κ is a secondary scaling parameter which is usually set to 0, [TeX:] $$\left(\sqrt{(M+\lambda) \hat{P}^{\prime}(k)}\right)^i$$ is the ith row of the matrix square root X which is satisfied with [TeX:] $$X \cdot X=(M+\lambda) \hat{P}^{\prime}(k),$$ where
[TeX:] $$\begin{gathered} \hat{X}^{\prime}(k)=\left[\begin{array}{c} \hat{X}(k) \\ 0 \\ 0 \end{array}\right]_{M \times 1}, \\ \hat{P}^{\prime}(k)=\left[\begin{array}{cccc} \hat{P}^{(k)} & 0_{4 \times 1} & 0_{4 \times 1} & 0_{4 \times 1} \\ 0_{1 \times 4} & \sigma_n^2 & 0 & 0 \\ 0_{1 \times 4} & 0 & \sigma_\alpha^2 & 0 \\ 0_{1 \times 4} & 0 & 0 & \sigma_\beta^2 \end{array}\right], \end{gathered}$$ [TeX:] $$0_{m \times n}$$ is a m-by-n matrix of zeros. The corresponding weights of sigma points are defined as
(27)[TeX:] $$\begin{aligned} W m^i & =\left\{\begin{array}{ll} \frac{\lambda}{M+\lambda}, & i=0 \\ \frac{1}{2(M+\lambda)}, & i \neq 0 \end{array},\right. \\ W c^i & = \begin{cases}\frac{\lambda}{M+\lambda}+1-\alpha^2+\beta, & i=0 \\ \frac{1}{2(M+\lambda)}, & i \neq 0\end{cases}, \end{aligned}$$where β is used to incorporate prior knowledge of the distribution (β = 2 is optimal for Gaussian distribution [TeX:] $$W m^i \text{ and } W c^i$$) are used to compute the mean and covariance of the posterior sigma points, respectively. Based on the above explanation, the UKF recursive algorithm for OB scattering environment is summarized in Algorithm 4. B. The Tracking Algorithm based on Linear FilteringFrom (3), it is obvious that the nonlinear filter can be used to deal with this tracking problem. However, when signal experiences OB scattering, as shown in Fig. 2, the position of MT is on the line of AB if the measured noise is ignored. Thus, the true nonlinear measured parameters in (3) can be transformed into the following linear form:
(28)[TeX:] $$\begin{aligned} & \left(\cos \left(\alpha^0(k)\right)+\cos \left(\beta^0(k)\right)\right) \cdot y(k) \\ & -\left(\sin \left(\alpha^0(k)\right)+\sin \left(\beta^0(k)\right)\right) \cdot x(k) \\ & =y_1 \cdot\left(\cos \left(\alpha^0(k)\right)+\cos \left(\beta^0(k)\right)\right) \\ & \quad-x_1 \cdot\left(\sin \left(\alpha^0(k)\right)+\sin \left(\beta^0(k)\right)\right) \\ & \quad-r^0(k) \cdot \sin \left(\alpha^0(k)-\beta^0(k)\right). \end{aligned}$$When substituting the measured parameters in (3) into (28), to obtain the simple results, a reasonable approximation about trigonometric function of actual angles can be given as follows:
(29)[TeX:] $$\begin{aligned} \cos \left(\alpha^0(k)\right)+\cos \left(\beta^0(k)\right) \approx & \approx \cos (\alpha(k))+\cos (\beta(k)) \\ \sin \left(\alpha^0(k)\right)+\sin \left(\beta^0(k)\right) \approx & \sin (\alpha(k))+\sin (\beta(k)) \\ \sin \left(\alpha^0(k)-\beta^0(k)\right) \approx & \sin (\alpha(k)-\beta(k))-\cos (\alpha(k) \\ & -\beta(k)) \cdot(m(k)-v(k)) . \end{aligned}$$Then, we can obtain the following approximation equation in matrix form:
where
(31)[TeX:] $$\begin{aligned} Y(k)= & y_1 \cdot(\cos (\alpha(k))+\cos (\beta(k)))-x_1 \cdot(\sin (\alpha(k)) \\ & +\sin (\beta(k)))-r(k) \cdot \sin (\alpha(k)-\beta(k)), \end{aligned}$$
(32)[TeX:] $$\begin{aligned} & H(k)= \\ & {[-\sin (\alpha(k))-\sin (\beta(k)), \cos (\alpha(k))+\cos (\beta(k)), 0,0]}, \end{aligned}$$
(33)[TeX:] $$\begin{aligned} \varepsilon(k)= & r(k) \cdot \cos (\alpha(k)-\beta(k)) \cdot(m(k)-v(k))+\sin (\alpha(k) \\ & -\beta(k)) \cdot n(k)-\cos (\alpha(k)-\beta(k)) \cdot n(k) \cdot m(k) \\ & +\cos (\alpha(k)-\beta(k)) \cdot n(k) \cdot v(k) . \end{aligned}$$From (33), the noise [TeX:] $$\varepsilon(k)$$ contains not only additive noise, but also multiplicative noise, but it can be approximated as a Gaussian distribution. Combining (1) with (30), the classical LKF recursive algorithm for OB scattering environment is provided in Algorithm 5. V. THE PROPOSED TRACKING ALGORITHMS WITH HYBRID LOS AND OB PATHThe above analysis assume that all the propagation paths are LOS or OB scattering. However, the LOS and OB scattering shown in Fig. 1 may appear alternatively. Thus, when both LOS and OB scattering paths are present, the proposed EKF, UKF or LKF algorithms shown in Section III and IV are not adaptable. Therefore, new methods need to be developed to deal with this scenario. Our idea is developed based on two aspects. On the one hand, the propagation path LOS or OB scattering is considered to be a Markov process with two interactive modes named as IMM. On the other hand, LOS or OB scattering is identified first, and then the corresponding filtering algorithm is applied to it. A. Modified IMM LKF Tracking AlgorithmThe signal propagation between the BS and the MT with LOS or OB scattering can be considered as a switching mode system and a two-state Markov process can describe this switching mode system. Thus, based on the basic principle of IMM algorithm [6], [8], [11], [18], [22], we can directly track the position of MT with our proposed LOS-LKF and OBLKF algorithms. This algorithm illustrated in Fig.3 is consists of five parts, the mixing probability, the interaction, the LKF algorithm, the mode probability update and the combination. The state is estimated by two parallel LKF algorithms (i.e., Algorithm 2: LOS-LKF and Algorithm 5: OB-LKF) based on the corresponding models. In [6], [11], [22], the mode probabilities of the present conditions are calculated and updated by a likelihood function via their respective estimate errors. However, the likelihood function in LOS-LKF is not suitable. The error of (12) in LOS-LKF is a two-dimensional vector, its likelihood function needs to compute the covariance matrix of errors. After a few iterations, the probability of LOS is almost zero, which lead to the performance degradation of tracking. Therefore, we need to find another likelihood function to adapt the LOSLKF mode. Fortunately, in LOS propagation, we can use the estimate error of range measurement to evaluate the tracking accuracy of MT rather than the estimate error of (12). Thus, the modified IMM-LKF recursive algorithm referred to as MIMM- LKF is proposed and summarized in Algorithm 6. B. LKF Tracking Algorithm based on LOS IdentificationWithout the knowledge of signal propagation condition, the idea of IMM algorithm is to model it as a two-state Markov process. However, if the condition of signal propagation can be identified correctly, we can then apply the corresponding LOS or OB LKF algorithm to track the position of MT. The work in [31] introduces a small positive number Δ as a threshold to identify LOS propagation when it satisfies the following condition:
Furthermore, this threshold Δ is determined by the probability of detection [TeX:] $$P_d$$ as
where [TeX:] $$Q(x)=(1 / \sqrt{2 \pi}) \int_x^{\infty} e^{-t^2 / 2} d t .$$ Then, the identified LKF recursive algorithm with linear state model (1) and linear measurement model (12) or (30) denoted as I-LKF is presented in Algorithm 7. VI. SIMULATION RESULTS AND DISCUSSIONIn this section, we provide simulation results to validate the proposed tracking algorithms and compare the localization accuracy of MT tracking under different propagation environments. The MT has a steady velocity of 10 m/s and moves in a trajectory as shown in Fig. 4. The sample length and the sample interval [TeX:] $$\Delta t$$ are 200 and 1 s, respectively. The position of BS is (0, 0) and the random acceleration variance [TeX:] $$\sigma_w^2$$ shown in (1) is chosen as [TeX:] $$1 \mathrm{~m} / \mathrm{s}^2 .$$ The angle measurement noise shown in (2) and (3) is assumed to be a white Gaussian random variable with zero mean and the same standard deviation [TeX:] $$\sigma_\alpha=\sigma_\beta,$$ whereas the range measurement noise is also assumed to be a white random variable with zero mean and standard deviation [TeX:] $$\sigma_n=5 \mathrm{~m}.$$ The initial estimate of MT is [TeX:] $$X(0)=[-500,0,0,-10]^T$$ with initial covariance matrix [TeX:] $$P(0)=\operatorname{diag}[100,100,100,100].$$ In order to compare the estimated trajectory and cumulative probability distribution (CDF) of localization error with different algorithms, root square error (RSE) defined as [TeX:] $$R S E=\sqrt{(\hat{x}(k)-x(k))^2+(\hat{y}(k)-y(k))^2}$$ is chosen as the criterion. Moreover, in order to smooth the effect of measured noise at time k, the corresponding average localization error (ALE) defined as [TeX:] $$A L E=(1 / N) \sum_{i=1}^N \sqrt{\left(\hat{x}_i(k)-x(k)\right)^2+\left(\hat{y}_i(k)-y(k)\right)^2},$$ where N = 500 is the number of Monte-Carlo simulations. A. Simulation of LOS or OB Scattering Environment1) Simulation of LOS environment: For LOS scenario, the range and angle measurement parameters are generated from (2). We have evaluated and compared two algorithms, i.e., LOS-EKF and LOS-LKF, each with and without AOD measurements. Due to significant effect of the angle error, Fig. 5 shows the ALE versus the standard deviation of angle measurement. When the angle error is small, all the algorithms have the similar performance. However, as the increase of the angle error, the performance of all algorithms is degraded. Notably, our proposed LOS-LKF with TOA/AOD/AOA performs the best tracking accuracy. Interestingly, it is observed that the inclusion of AOD measurement in EKF does not enhance but rather diminishes its tracking accuracy. The reason is that the AOD is highly correlated with the AOA, and the non-diagonal elements of the covariance matrix will be significantly nonzero. This affects the calculation of Kalman gain, resulting in a decrease in tracking accuracy. The standard deviation of angle measurement is set to [TeX:] $$2^{\circ},$$ the ALE versus time instant k is presented in Fig. 6, and the CDF of localization error is shown in Fig. 7. In addition, Fig. 8 illustrates the estimated and actual trajectories of MT. From Figs. 6–8, we realize that the tracking accuracy of our proposed LOS-LKF is the best, and comparatively large localization errors are occurred when the motion direction of MT is changed. 2) Simulation of OB scattering environment: In OB scattering environment, the range and angle measurement parameters are generated from (3). The position of scatterer is located inside a circular disk of fixed radius [TeX:] $$R_d,$$ which is called the circular scattering model [25], [30], [31], [32], [45], [46] whose distance from a scatterer to MT is uniformly distributed in the range of [TeX:] $$\left[0, R_d\right],$$ and the angle is uniformly distributed in the range of [TeX:] $$[0,2 \pi].$$ Three algorithms, i.e., OB-EKF, OBUKF, and OB-LKF are evaluated and compared. Our proposed OB-LKF assumes that the angle error is small. In order to validate the effectiveness of it with large angle error, Fig. 9 illustrates the ALE versus the standard deviation of angle measurement. It is shown that both OB-LKF and OB-UKF are better than OB-EKF. As the increase of the angle error, the performance of two algorithms is degraded. When the angle error is small, OB-LKF is slightly superior to OB-UKF. As the increase of the angle error whose value is larger than four degrees, OB-LKF is slightly worse than OB-UKF. In addition, the standard deviation of angle measurement is set to [TeX:] $$1^{\circ},$$ Fig. 10 presents the estimated and actual trajectories of MT, the CDF of localization error is shown in Fig. 11, and the ALE versus time instant k is presented in Fig. 12. From Figs. 10–12, it is easy to see that, most of the time, the OB-LKF has the highest localization accuracy, followed by OB-UKF and then OB-EKF. The OB-LKF and OB-UKF can track the trajectory of MT very well, whereas the tracking accuracy of OB-EKF is decreased as time goes by. The reason is that EKF algorithm with first-order Taylor series expansion is not effective for highly nonlinear problems. As the same conclusion in LOS environment, comparatively large localization errors also occur when the motion direction of MT is changed. 3) Comparison of running time: From the literature, the computational complexity of EKF, UKF, and LKF can be easily understood. UKF is the highest, followed by EKF and then LKF. However, the comparison of the actual computational time about these three algorithms is more convincing. Table I provides the computational time of three algorithms with an average of 10000 runs. The experiments are processed on the computer with Intel ® Core™ i5-6200U CPU 64 bit processor and 4 GB memory. From Table I, it can be realized that the computer running time of LKF is the lowest, while that of UKF is the highest. These results confirm our knowledge on this. However, it is seen that the running time of these three algorithms in OB scattering is more than that of LOS. In fact, the updated stage of UKF and EKF need to compute the estimated range and angles in LOS, whereas only the estimated range is computed in OB scattering. In addition, there are two measurement equations in LOS, while only one is existing in OB scattering. Therefore, it is reasonable that the running time of LOS is higher than that of OB scattering. TABLE I
In this subsection, three algorithms, i.e., EKF, UKF and LKF, are compared with hybrid TOA/AOD/AOA measurements in LOS or OB scattering condition. From the simulation results, in any of these conditions, the proposed LKF algorithm can track the position of MT accurately. Moreover, the comparison of running time demonstrates that LKF algorithm has also the lowest computational time. Therefore, our proposed LKF algorithms are better methods to track the position of MT in their respective conditions. B. Simulation of Hybrid LOS and OB Scattering EnvironmentIn our simulation, LOS or OB scattering is changed for each 50 samples in an alternate way. The measured range and angle are generated using the same method mentioned in Section A. The two-state Markov transition probability matrix for the M-IMM-LKF algorithm is chosen by [TeX:] $$T=\left[\begin{array}{ll} p_{11} & p_{12} \\ p_{21} & p_{22} \end{array}\right]=\left[\begin{array}{ll} 0.95 & 0.05 \\ 0.05 & 0.95 \end{array}\right],$$ and the initial prior probabilities are set to [TeX:] $$\mu_i=0.5, i=1,2 .$$ The probability of detection for I-LKF is set to [TeX:] $$P_d=0.95.$$ 1) Analysis of the proposed tracking algorithms: The performance of the proposed tracking algorithms are affected by three factors, i.e., the range standard deviation [TeX:] $$\sigma_n,$$ angle standard deviation [TeX:] $$\sigma_\alpha, \sigma_\beta,$$ and scattering radius [TeX:] $$R_d.$$ Fig. 13 provides the CDF of localization error with different [TeX:] $$\sigma_n.$$ When [TeX:] $$\sigma_n$$ is small, the proposed two algorithms have the same performance. As it increases, I-LKF is slightly better than MIMM- LKF. As shown in Fig. 14, we see that [TeX:] $$\sigma_\alpha, \sigma_\beta$$ has greater influence on our proposed algorithms than [TeX:] $$\sigma_n.$$ As the increase of [TeX:] $$\sigma_\alpha, \sigma_\beta,$$ the performance is greatly reduced. But, I-LKF is still superior to M-IMM-LKF . From Fig. 15, it is shown that [TeX:] $$R_d$$ has little effect on our proposed algorithms. 2) Comparison with the existing algorithms: Due to the one propagation path with TOA/AOD/AOA measurement, only three other algorithms, i.e., NLS [30], IMM [6,11,22], and DF [31] can be compared. In hybrid LOS and OB scattering environment, Fig. 16 provides the estimated and actual trajectories of MT, the CDF of localization error is shown in Fig. 17, and the ALE versus time instant k is presented in Fig. 18. From Figs. 16–18, we see that IMM algorithm is not capable of tracking the position of MT accurately, and the proposed two algorithms are better than NLS and DF. When the motion direction of MT is changed and the LOS/OB scattering transition is happened, large localization error is present for our proposed algorithms. The reason is the inaccurate state estimation, and this state needs to be updated by the TOA/AOD/AOA measurement. After several iterations, the tracking accuracy is significantly improved. However, the localization errors of NLS and DF are relatively small, because these two algorithms do not rely on the state equation, and directly localize the MT with TOA/AOD/AOA measurements. Overall, the proposed algorithms are superior to the existing algorithms. In addition, from Algorithm 6 and Algorithm 7, it is obvious that the computational complexity of I-LKF is lower than that of IMM-LKF, and it is not necessary to compare the actual computational time of these two algorithms. Therefore, for hybrid TOA/AOA/AOD localization model, both M-IMMLKF and I-LKF algorithm can deal with the problem about the frequent transition between LOS and OB scattering. VII. CONCLUSIONSIn this paper, hybrid TOA/AOD/AOA tracking algorithms with single BS and one path were investigated in different propagation environments. In LOS propagation environment, the proposed LKF algorithm had the same localization accuracy with the existing EKF and UKF algorithms, but lower computational time. Moreover, in OB scattering environment, the performance of the proposed EKF, UKF, and LKF algorithms were evaluated and compared. Simulation results and running time analysis showed that LKF algorithm was superior to EKF and UKF algorithms. Finally, practical condition suffered from frequent transition between LOS and OB scattering was examined, two algorithms referred to as MIMM- LKF and I-LKF were proposed to deal with the large localization error when the transition between the LOS and OB scattering occurred. it was also demonstrated that the proposed algorithms could remarkably reduce these localization errors. BiographyShixun WuShixun Wu was born in HuBei, China. He received the B.S. and M.S. degrees in Applied Mathematics in 2006 and 2009, respectively. He received the PH.D. Degree in 2012 at the Department of Electrical and Computer Engineering, Central China Normal University, China. Currently he is a Vice-Professor at College of Information Science and Engineering, Chongqing Jiaotong University. He is also a ViceDean at Department of Communication Engineering. His current research interests include wireless localization, neural network localization, and wireless communication. BiographyMiao ZhangMiao Zhang (S’18, M’20) received his B.Sc. degree in Optical Information Science and Technology from Guizhou University, Guiyang, China, M.Sc. in Communications and Signal Processing from the University of Newcastle upon Tyne, Newcastle upon Tyne, UK, and the PhD from the University of York, York, UK in 2011, 2015 and 2020, respectively. He is currently an Associate Professor at the School of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, China. His research interests are convex optimization techniques, intelligent reflecting surface assisted wireless networks, physical layer security and machine learning techniques for wireless communications. BiographyKanapathippillai CumananKanapathippillai Cumanan (Senior Member, IEEE) received the B.Sc. degree (with first class Hons.) in Electrical and Electronic Engineering from the University of Peradeniya, Sri Lanka, in 2006 and the Ph.D. degree in Signal Processing for Wireless Communications from Loughborough University, Loughborough, U.K., in 2009. He is currently a Senior Lecturer with the School of Physics, Engineering and Technology, University of York, York, U.K. From March 2012 to November 2014, he was a Research Associate with the School of Electrical and Electronic Engineering, Newcastle University, Newcastle upon Tyne, U.K. Prior to this, he was with the School of Electronic, Electrical and System Engineering, Loughborough University, Loughborough, U.K. In 2011, he was an Academic Visitor with the Department of Electrical and Computer Engineering, National University of Singapore, Singapore. From January 2006 to August 2006, he was a Teaching Assistant with the Department of Electrical and Electronic Engineering, University of Peradeniya, Sri Lanka. He has authored or coauthored more than 100 journal articles and conference papers. His research interests include non-orthogonal multiple access (NOMA), cellfree massive MIMO, Open-RAN, WiFi networks, physical layer security, convex optimization techniques, and resource allocation techniques. He is currently an Associate Editor for IEEE JSAC-MACHINE LEARNING IN COMMUNICATIONS AND NETWORKS, IEEE WIRELESS COMMUNICATIONS LETTERS and IEEE OPEN JOURNAL OF COMMUNICATIONS SOCIETY . Dr. Cumanan was the recipient of an Overseas Research Student Award Scheme (ORSAS) from Cardiff University, Wales, U.K., where he was a Research Student between September 2006 to July 2007. BiographyKai XuKai Xu was born in 1970. He received M.S. degree in Control Theory and Control Engineering from Chongqing University in 2006. From 1993 to 2003, he was Senior Engineer in Xichang Satellite Launching Center. Since 2008, he is a Professor at college of Information Science and Engineering, Chongqing Jiaotong University. Prof. Xu is an Expert Commissioner of Chongqing Science and Technology Commission and Chongqing Construction Commission. His current research interests include fuzzy control, adaptive control, and intelligent algorithm. BiographyZhangli LanZhangli Lan was born in 1973. He received the B.S degree in communication from the Electronic Engineering College, Hefei, China, in 1997, the M.S. degree in Computer System Structure from Chongqing University, Chongqing, China, in 2004, and the Ph. D.degree in Computer Software and Theory from Chongqing University, Chongqing, China, 2008. From 2011, he has been a Professor with the School of Information Science and Engineering, Chongqing Jiaotong University, Chongqing, China. His current research interests include digital image processing, pattern recognition, and traffic information processing. References
|