Processing math: 60%
DING Ting, ZHAO Yongsheng, ZHAO Yongjun. An Efficient Algebraic Solution for Moving Source Localization from Quadruple Hybrid Measurements[J]. Chinese Journal of Electronics, 2022, 31(2): 255-265. DOI: 10.1049/cje.2020.00.410
Citation: DING Ting, ZHAO Yongsheng, ZHAO Yongjun. An Efficient Algebraic Solution for Moving Source Localization from Quadruple Hybrid Measurements[J]. Chinese Journal of Electronics, 2022, 31(2): 255-265. DOI: 10.1049/cje.2020.00.410

An Efficient Algebraic Solution for Moving Source Localization from Quadruple Hybrid Measurements

Funds: This work was supported by the Henan Province Science and Technology Project (212102210564) and the Open Fund Project of Scientific Research Platform of Zhengzhou Railway Vocational and Technical College (2021KFJJ002)
More Information
  • Author Bio:

    DING Ting: (corresponding author) was born in 1982. She received the Ph.D. degree in information and communication engineering from PLA Strategic Support Force Information Engineering University. She is an Associate Professor at the Henan High-speed Railway Operation and Technological Research Center, Zhengzhou. Her research interests include MIMO radar and communication signal processing. (Email: dingting_ndsc@foxmail.com)

    ZHAO Yongsheng: was born in 1990. He is currently pursuing the Ph.D. degree in the information and communication engineering at PLA Strategic Support Force Information Engineering University. His current research interests include multistatic passive radar, target localization, radar signal processing, estimation theory, and detection theory. (Email: ethanchioa@aliyun.com)

    ZHAO Yongjun: was born in 1964. He received the Ph.D. degree from Beijing Institute of Technology. He is currently a Professor in PLA Strategic Support Force Information Engineering University. His current research interests include radar signal processing and array signal processing. (Email: zhaoyongjuntg@126.com)

  • Received Date: December 10, 2020
  • Accepted Date: August 30, 2021
  • Available Online: November 04, 2021
  • Published Date: March 04, 2022
  • This paper deals with the 3-D moving source localization using time difference of arrival (TDOA), frequency difference of arrival (FDOA), angle of arrival (AOA) and AOA rate measurements, gathered from a set of spatially distributed receivers. The TDOA, FDOA, AOA and AOA rate measurement equations were firstly established according to the space geometric relationship of the source relative to the receivers. Then an efficient closed-form algorithm for source position and velocity estimation from the quadruple hybrid measurements was proposed. The proposed algorithm converts the nonlinear measurement equations into a linear set of equations, which can then be used to estimate the source position and velocity applying weighted least square (WLS) minimization. In contrast to existing two-stage WLS algorithms, the proposed algorithm does not introduce any nuisance parameters and requires merely one-stage, which enables for source localization with the fewest receivers necessary. Theoretical accuracy analysis shows that the proposed algorithm reaches the Cramer-Rao lower bound, and simulation studies corroborate the efficiency and superiority of the proposed algorithm over other algorithms.
  • Source localization utilizing a set of spatially distributed receivers has drawn concerns for several decades due to its numerous applicability in a variety of fields such as radar, mobile communications, emergency services, intelligent transportation, geological prospecting, indoor acoustic localization, etc.[1-3]. Generally speaking, different sorts of measurements including time difference of arrival (TDOA)[4], frequency difference of arrival (FDOA)[4], angle of arrival (AOA)[5], or their combinations, can be used to conduct source localization in a passive and uncooperative way. Each measurement defines a geometrical curve of possible source locations. The intersection of these curves with respect to the measurements produces the source location estimate. Due to the very nonlinear relationship between the mearements and the unknown source location, obtaining the intersection is far from simple.

    Over the previous two decades, there has been a lot of focus on TDOA-based[6-9], AOA-based[10-12] and TDOA-AOA-based[13-15] source position estimation. These algorithms[6-15], however, cannot determines the source velocity at a single time instant. By using TDOA and/or AOA measurements obtained at different time instants, extended Kalman filter (EKF)[16] is a viable method for determining the source's position and velocity. However, EKF’s performance relies on the correctness of the linearization in the measurement equations, and it needs to go through an initial transient period before it gives a credible source position and velocity estimate. To estimate both the position and the velocity of a moving source at a single time instant, some algorithms have been explored based on jointly using TDOA-FDOA measurements[17-21]. And more recently, to locate the moving source with higher accuracy and a smaller number of receivers, Liu et al.[22] offer a hybrid TDOA-FDOA-differential Doppler rate (DDR) localization approach based on the development of a pseudo-linear set of equations using nuisance parameters, from which the source position and velocity is produced using a two-stage weighted least squares (WLS) estimator. Xiong et al.[23] propose a hybrid TDOA-FDOA-AOA localization algorithm, also using the pseudo-linearization technique and two-stage WLS estimator. The aforementioned TDOA-FDOA-based[17-21], TDOA-FDOA-AOA-based[23] and TDOA-FDOA-DDR-based[22] moving source localization algorithms explicitly or implicitly follows the basic framework of TSWLS idea: in the first WLS stage, the nuisance parameters are introduced to convert the measurement equations into a pseudo-linear set of equations, from which the nuisance parameters, as well as the source position and velocity, are calculated; then in the second WLS stage, the relation between the parameters estimated in the previous WLS stage are exploited to improve the initial estimate. However, because of the two-stage processing, the algorithms are susceptible to interstage error propagation and thus to measurement noise levels. Furthermore, because the nuisance parameters, as well as the source position and velocity, must be estimated, more receivers are necessary, increasing the system’s cost and complexity.

    The AOA rate is, along with TDOA, FDOA and AOA measurements, another basic radar measurement. Traditionally, the AOA rate was computed by taking many AOA measurements, which resulted in a higher inaccuracy in the AOA rate measurement. However, recent studies[24, 25] in array signal processing have achieved the direct measurement the AOA of moving targets. In addition, the theoretical accuracy of direct AOA rate measurement has been explored in Refs.[26, 27], indicating that AOA rate measurement can be directly measurend with high accuracy. As a result, AOA can be deemed an accurate measurement set for use in source localization. Combining AOA rate measurement with the three other conventional radar measurements could improve localization accuracy and resilience while reducing the number of receivers necessary. Nevertheless, despite the fine prospects, to our knowledge, there is no explicit algebraic solution in the open literature for estimating source position and velocity from hybrid TDOA, FDOA, AOA, and AOA rate measurements. Motivated by these facts, in this study, we focus on the 3-D moving source localization utilizing TDOA, FDOA, AOA and AOA rate measurements, and explore an efficient closed-form solution for source position and velocity estimation. We begin our study by establishing the TDOA, FDOA, AOA and AOA rate measurement equations. Then the quadruple hybrid nonlinear measurement equations are converted into to a linear set of equations, from which the source position and velocity are produced by applying WLS minimization. Unlike the more often used two-stage WLS estimators, the proposed algorithm only has one-stage, preventing interstage error propagation and thus being less sensitive to measurement noise, and allowing for source localization with the fewest number of receivers. The Cramer-Rao lower bound (CRLB) and error covariance matrix will be deduced to analytically investigate the efficiency of the proposed algorithm. Numerical simulations will be conducted to prove the superiority of the proposed algorithm over existing algorithms.

    This paper consists of six sections. Section II establishes the TDOA, FDOA, AOA and AOA rate measurement equations for moving source localization. Section III presents the deduction of the proposed localization algorithm. Section IV includes the CRLB and error covariance matrix analysis. Section V investigates the performance of the proposed algorithm through numerical simulations, and Section VI discusses conclusions.

    Fig.1 depicts a 3-dimensional scene in which M passive receivers work together to locate an unknown moving source. The receiver positions and velocities denoted by si=[xi,yi,zi]T (i=1,2,,M) and ˙si=[˙xi,˙yi,˙zi]T (i=1,2,,M) respectively, are assumed known. The source position and velocity denoted by u=[x,y,z]T and ˙u=[˙x,˙y,˙z]T respectively, are unknown and to be estimated.

    Figure  1.  Geometry for moving source localization

    By using the aforementioned notations, the range and range rate between the source and receiver i can be expressed as

    roi=usi (1)
    ˙roi=(usi)T(˙u˙si)usi (2)

    where represents the Euclidean norm. By designating receiver 1 as the reference, the TDOA and FDOA (which are usually transformed to the range-difference and range-rate-difference for ease of presentation) with respect to receiver i, denoted by roi1, is given by

    roi1=roiro1 (3)
    ˙roi1=˙roi˙ro1 (4)

    In reality, the measurements are inevitably contaminated by noises and we can construct the measured TDOA and FDOA as

    ri1=roi1+Δri1 (5)
    ˙ri1=˙roi1+Δ˙ri1 (6)

    where Δri1 and Δ˙ri1 denote the TDOA and FDOA measurement noise, respectively. By defining the following vectors:

    r=[r21,r31,,rM1]T,ro=[ro21,ro31,,roM1]T,Δr=[Δr21,Δr31,,ΔrM1]T (7)
    ˙r=[˙r21,˙r31,,˙rM1]T,˙ro=[˙ro21,˙ro31,,˙roM1]T,Δ˙r=[Δ˙r21,Δ˙r31,,Δ˙rM1]T (8)

    we can collect the TDOA and FDOA measurement equations in Eqs.(5) and (6) for i=2,3,,M in vector form as

    r=ro+Δr (9)
    ˙r=˙ro+Δ˙r (10)

    According to the source’s spatial geometric relationship with receiver i, the AOA pair (θoi,φoi), in which θoi and φoi stands for the azimuth angle and elevation angle, can be expressed as

    θoi=arctan(yyixxi) (11)
    φoi=arctan(zzi(xxi)cos(θoi)+(yyi)sin(θoi)) (12)

    The time derivative of Eqs.(11) and (12) gives the azimuth and elevation angle rate equations after some trigonometric manipulations as

    ˙θoi=(xxi)(˙y˙yi)(˙x˙xi)(yyi)(xxi)2sec2(θoi) (13)
    ˙φoi=(˙z˙zi)roi(zzi)˙roi(roi)2cos(φoi) (14)

    Then considering the measurement noises, we can formulate the measured AOA and AOA rate as

    θi=θoi+Δθi (15)
    φi=φoi+Δφi (16)
    ˙θi=˙θoi+Δ˙θi (17)
    ˙φi=˙φoi+Δ˙φi (18)

    where Δθi and Δφi are measurement noises of azimuth and elevation, Δ˙θi and Δ˙φi are measurement noises of azimuth and elevation rate. By letting

    θ=[θ1,θ2,,θM]T,θo=[θo1,θo2,,θoM]T,Δθ=[Δθ1,Δθ2,,ΔθM]T (19)
    φ=[φ1,φ2,,φM]T,φo=[φo1,φo2,,φoM]T,Δφ=[Δφ1,Δφ2,,ΔφM]T (20)
    ˙θ=[˙θ1,˙θ2,,˙θM]T,˙θo=[˙θo1,˙θo2,,˙θoM]T,Δ˙θ=[Δ˙θ1,Δ˙θ2,,Δ˙θM]T (21)
    ˙φ=[˙φ1,˙φ2,,˙φM]T,˙φo=[˙φo1,˙φo2,,˙φoM]T,Δ˙φ=[Δ˙φ1,Δ˙φ2,,Δ˙φM]T (22)

    we can stack the AOA and AOA rate measurements in Eqs.(15–18) for i=1,2,,M as

    θ=θo+Δθ (23)
    φ=φo+Δφ (24)
    ˙θ=˙θo+Δ˙θ (25)
    ˙φ=˙φo+Δ˙φ (26)

    To put the involved TDOA, FDOA, AOA and AOA rate measurements together for easier manipulation, we define the following vectors

    α=[rT,˙rT,θT,φT,˙θT,˙φT]T (27)
    αo=[(ro)T,(˙ro)T,(θo)T,(φo)T,(˙θo)T,(˙φo)T]T (28)
    Δα=[ΔrT,Δ˙rT,ΔθT,ΔφT,Δ˙θT,Δ˙φT]T (29)

    and the total TDOA, FDOA, AOA and AOA measurement equations can be written compactly as

    α=αo+Δα (30)

    where α represents the total measurement vector, αo represents its true value, and Δα represents the corresponding measurement noise vector. Without loss of generality, Δα is modelled as a zero-mean Gaussian vector with covariance matrix

    E(ΔαΔαT)=Q (31)

    Till here, the task of this paper can be succinctly summarized as follows: estimate the source position u and velocity ˙u as accurately as possible, using the noisy TDOA, FDOA, AOA and AOA rate measurements contained in the total measurement vector α.

    Although the task is very clear, it is far from straightforward to identify the source position u and velocity ˙u from measurement vector α since the measurements and source location parameters have a high degree of nonlinearity. This section is devoted to design a closed-form algorithm for the above-mentioned localization problem by adopting parameter transformation and WLS minimization.

    Firstly, to exploit the TDOA measurement equation in Eq.(5), we rearrange it as ri1+ro1=roi+Δri1, square both sides, and retain merely one order error terms, which yields

    2(sis1)Tu+2ri1ro1=sTisisT1s1r2i1+2roiΔri1 (32)

    On the surface, Eq.(32) looks just like a linear equation of source position u, but actually, it is pseudo-linear in terms of source position u and nuisance parameter ro1, because ro1 is nonlinearly related to u through Eq.(1). Generally, the nuisance parameter can be removed by using two-stage minimization. However, such two-stage minimization makes the estimator more sensitive to the measurement noise. For this purpose, we eliminate the nuisance parameter ro1 by jointly using the AOA measurements. To achieve this, define the following vector:

    ρo=[cos(φo1)cos(θo1),cos(φo1)sin(θo1),sin(φo1)]T (33)

    Obviously, we have ro1ρo=us1 according to the localization geometry. Multiplying ro1ρo=us1 with (ρo)T, and using the fact (ρo)Tρo=1, we have

    ro1=(ρo)T(us1) (34)

    Substituting Eq.(34) into Eq.(32), leads to

    2(sis1+ri1ρo)T=sTisisT1s1r2i1+2ri1(ρo)Ts1+2roiΔri1 (35)

    By substituting θoi=θiΔθi and φoi=φiΔφi into Eq.(35), and then expanding with respect to θi and φi through first-order Taylor-series, we arrive at

    2(sis1+ri1ρ)T=sTisisT1s1r2i1+2ri1ρTs1+2roiΔri12ri1bTr,θ,i(us1)Δθ12ri1bTr,φ,i(us1)Δφ1 (36)

    where

    ρ=[cos(φ1)cos(θ1),cos(φ1)sin(θ1),sin(φ1)]T (37)
    br,θ,i=[cos(φ1)sin(θ1),cos(φ1)cos(θ1),0)]T (38)
    br,φ,i=[sin(φ1)cos(θ1),sin(φ1)sin(θ1),cos(φ1)]T (39)

    Collecting Eq.(36) for i=2,3,,M offers a set of linear equations with regard to source position and velocity vector x=[uT,˙uT]T, extracted from the TDOA measurements, as

    Grx=hr+Δhr (40)

    where Gr is a (M1)×6 matrix and hr is a (M1)×1 vector, with their inner elements given by

    [Gr]i1,1:3=2(sis1+ri1ρ)T (41)
    [hr]i1,1=sTisisT1s1r2i1+2ri1ρTs1 (42)

    for i=2,3,,M, and zero otherwise. On the right-hand side of Eq.(40), Δhr is the error vector given by

    Δhr=Br,rΔr+Br,θΔθ+Br,φΔφ (43)

    where, Br,r, Br,θ, Br,φ is a (M1)×(M1), (M1)×M, (M1)×M matrix, respectively, whose inner elements are

    [Br,r]i1,i1=2roi (44)
    [Br,θ]i1,1=2ri1bTr,θ,i(us1) (45)
    [Br,φ]i1,1=2ri1bTr,φ,i(us1) (46)

    for i=2,3,,M, and zero otherwise.

    Taking the time derivative of Eq.(36) yields the following linear equation derived from FDOA measurements

    2(˙si˙s1+ri1˙ρ)Tu+2(sis1+ri1ρ)T˙u=2sTi˙si2sT1˙s12ri1˙ri1+2˙ri1ρTs1+2ri1˙ρTs1+2ri1ρT˙s1+2˙roiΔri1+2roiΔ˙ri12[˙ri1bTr,θ,i(us1)+ri1˙bTr,θ,i(us1)+ri1bTr,θ,i˙(us1)]Δθ12ri1bTr,θ,i(us1)Δ˙θ12[˙ri1bTr,φ,i(us1)+ri1˙bTr,φ,i(us1)+ri1bTr,φ,i˙(us1)]Δφ12ri1bTr,φ,i(us1)Δ˙φ1 (47)

    where

    ˙ρ=[sin(φ1)cos(θ1)˙φ1+cos(φ1)sin(θ1)˙θ1,sin(φ1)sin(θ1)˙φ1+cos(φ1)cos(θ1)˙θ1,cos(φ1)˙φ1]T (48)
    ˙br,θ,i=[sin(φ1)sin(θ1)˙φ1+cos(φ1)cos(θ1)˙θ1,sin(φ1)cos(θ1)˙φ1+cos(φ1)sin(θ1)˙θ1,0]T (49)
    ˙br,φ,i=[cos(φ1)cos(θ1)˙φ1sin(φ1)sin(θ1)˙θ1,cos(φ1)sin(θ1)˙φ1+sin(φ1)cos(θ1)˙θ1,sin(φ1)˙φ1]T (50)

    Collecting Eq.(47) for i=2,3,,M together leads to

    ˙Grx=˙hr+Δ˙hr (51)

    where ˙Gr is a (M1)×6 matrix and ˙hr is a (M1)×1 vector, with their inner elements given by

    [˙Gr]i1,1:6=[2(˙si˙s1+˙ri1ρ+ri1˙ρ)T,2(sis1+ri1ρ)T] (52)
    [˙hr]i1,1=2sTi˙si2sT1˙s12ri1˙ri1+2˙ri1ρTs1+2ri1˙ρTs1+2ri1ρT˙s1 (53)

    for i=2,3,,M, and zero otherwise. On the right-side of Eq.(51), Δ˙hr is the error vector given by

    ˙hr=˙Br,rΔr+Br,rΔ˙r+˙Br,θΔθ+˙Br,φΔφ+Br,θΔ˙θ+Br,φΔ˙φ (54)

    where ˙Br,r, ˙Br,θ, ˙Br,φ are a (M1)×(M1), (M1)×M, (M1)×M matrix, respectively, whose inner elements are

    [˙Br,r]i1,i1=2˙roi (55)
    [˙Br,θ]i1,1=2[˙ri1bTr,θ,i(us1)+ri1˙bTr,θ,i(us1)+ri1bTr,θ,i(˙u˙s1)] (56)
    [˙Br,φ]i1,1=2[˙ri1bTr,φ,i(us1)+ri1˙bTr,φ,i(us1)+ri1bTr,φ,i(˙u˙s1)] (57)

    for i=2,3,,M, and zero otherwise.

    To linearize the AOA measurement equations in Eqs.(15) and (16), we rearrange them by taking tangents from their both sides and then cross-multiplying, as

    sin(θiΔθi)(xxi)cos(θiΔθi)(yyi)=0 (58)
    cos(θiΔθi)sin(φΔφi)(xxi)sin(θiΔθi)sin(φΔφi)(yyi)cos(φΔφi)(zzi)=0 (59)

    Expanding Eqs.(58) and (59) with respect to θi and φi through first-order Taylor-series yields

    gTθ,iu=gTθ,isi+bTθ,θ,i(usi)Δθi (60)
    gTφ,iu=gTφ,isi+bTφ,θ,i(usi)Δθi+bTφ,φ,i(usi)Δφi (61)

    where

    gθ,i=[sin(θi),cos(θi),0]T (62)
    bθ,θ,i=[cos(θi),sin(θi),0]T (63)
    gφ,i=[sin(φi)cos(θi),sin(φi)sin(θi),cos(φi)]T (64)
    bφ,θ,i=[sin(φi)sin(θi),sin(φi)cos(θi),0]T (65)
    bφ,φ,i=[cos(φi)cos(θi),cos(φi)sin(θi),sin(φi)]T (66)

    Stacking Eqs.(60) and (61) for i=1,2,,M, yields the two set of linear equations from azimuth and elevation angle measurements, as follow

    Gθx=hθ+Δhθ (67)
    Gφx=hφ+Δhφ (68)

    where Gθ and Gφ are M×6 matrices, hθ and hφ are M×1 vectors, and their inner elements are

    [Gθ]i,1:3=gTθ,i (69)
    [hθ]i,1=gTθ,isi (70)
    [Gφ]i,1:3=gTφ,i (71)
    [hφ]i,1=gTφ,isi (72)

    for i=1,2,,M, and zero otherwise. In Eqs.(67) and (68), Δhθ and Δhφ are the error vectors given by

    hθ=Bθ,θΔθ (73)
    hφ=Bφ,θΔθ+Bφ,φΔφ (74)

    where Bθ,θ, Bφ,θ, Bφ,φ are M×M matrices with their inner elements are given by

    [Bθ,θ]i,i=bTθ,θ,i(usi) (75)
    [Bφ,θ]i,i=bTφ,θ,i(usi) (76)
    [Bφ,φ]i,i=bTφ,φ,i(usi) (77)

    for i=1,2,,M, and zero otherwise.

    The time derivative of Eqs.(60) and (61) gives the linear equations with respect to the source location parameters and the AOA rate measurements as

    ˙gTθ,iu+gTθ,i˙u=˙gTθ,isi+gTθ,i˙si+[˙bTθ,θ,i(usi)+bTθ,θ,i(˙u˙si)]Δθi+bTθ,θ,i(usi)Δ˙θi (78)
    ˙gTφ,iu+gTφ,i˙u=˙gTφ,isi+gTφ,i˙si+[˙bTθ,θ,i(usi)+bTφ,θ,i(˙u˙si)]Δθi+bTφ,θ,i(usi)Δ˙θi+[˙bTφ,φ,i(usi)+bTφ,φ,i(˙u˙si)]Δφi+bTφ,φ,i(usi)Δ˙φi (79)

    where

    ˙gθ,i=[cos(θi)˙θi,sin(θi)˙θi,0]T (80)
    ˙bθ,θ,i=[sin(θi)˙θi,cos(θi)˙θi,0]T (81)
    ˙gφ,i=[cos(φi)cos(θi)˙φisin(φi)sin(θi)˙θi,cos(φi)sin(θi)˙φi+sin(φi)cos(θi)˙θi,sin(φi)˙φi]T (82)
    ˙bφ,θ,i=[cos(φi)sin(θi)˙φisin(φi)cos(θi)˙θi,cos(φi)cos(θi)˙φisin(φi)sin(θi)˙θi,0]T (83)
    ˙bφ,φ,i=[sin(φi)cos(θi)˙φicos(φi)sin(θi)˙θi,sin(φi)sin(θi)˙φi+cos(φi)cos(θi)˙θi,cos(φi)˙φi]T (84)

    In matrix form by stacking Eqs.(78) and (79) for i=1,2,,M,

    ˙Gθx=˙hθ+Δ˙hθ (85)
    ˙Gφx=˙hφ+Δ˙hφ (86)

    where ˙Gθ and ˙Gφ are M×6 matrices, ˙hθ and ˙hφ are M×1 vectors, and their inner elements are

    [˙Gθ]i,1:6=[˙gTθ,i,gTθ,i] (87)
    [˙hθ]i,1=˙gTθ,isi+gTθ,i˙si (88)
    \big[\dot {{\boldsymbol{ G}}}_{\varphi}\big]_{i,1:6} = \big[\dot{{\boldsymbol{ g}}}_{\varphi,i}^{{\rm{ T}}},{{\boldsymbol{ g}}}_{\varphi,i}^{{\rm{ T}}}\big] (89)
    \big[\dot {{\boldsymbol{ h}}}_{\varphi}\big]_{i,1} = \dot{{\boldsymbol{ g}}}_{\varphi,i}^{{\rm{ T}}}{{\boldsymbol{ s}}}_i+{{\boldsymbol{ g}}}_{\varphi,i}^{{\rm{ T}}}\dot{{\boldsymbol{ s}}}_i (90)

    for i = 1,2,\dots,M , and zero otherwise. The error vectors \Delta \dot {{\boldsymbol{ h}}}_{\theta} and \Delta \dot {{\boldsymbol{ h}}}_{\varphi} are given by

    \Delta \dot {{\boldsymbol{ h}}}_{\theta} = \dot{{\boldsymbol{ B}}}_{\theta,\theta}\Delta {{\boldsymbol{ \theta}}}+{{\boldsymbol{ B}}}_{\theta,\theta}\Delta \dot {{\boldsymbol{ \theta}}} (91)
    \Delta \dot {{\boldsymbol{ h}}}_{\varphi} = \dot{{\boldsymbol{ B}}}_{\varphi,\theta}\Delta {{\boldsymbol{ \theta}}}+{{\boldsymbol{ B}}}_{\varphi,\theta}\Delta \dot {{\boldsymbol{ \theta}}}+\dot{{\boldsymbol{ B}}}_{\varphi,\varphi}\Delta {{\boldsymbol{\varphi}}}+{{\boldsymbol{ B}}}_{\varphi,\varphi}\Delta \dot {{\boldsymbol{\varphi}}} (92)

    where \dot{{\boldsymbol{ B}}}_{\theta,\theta}, \dot{{\boldsymbol{ B}}}_{\varphi,\theta}, \dot{{\boldsymbol{ B}}}_{\varphi,\varphi} are M\times M matrices with their inner elements given as

    \big[\dot {{\boldsymbol{ B}}}_{\theta,\theta}\big]_{i,i} = \dot {{\boldsymbol{ b}}}_{\theta,\theta,i}^{{\rm{ T}}}({{\boldsymbol{u}}}-{{\boldsymbol{ s}}}_i)+{{\boldsymbol{ b}}}_{\theta,\theta,i}^{{\rm{ T}}}(\dot {{\boldsymbol{u}}}-\dot {{\boldsymbol{ s}}}_i) (93)
    \big[\dot {{\boldsymbol{ B}}}_{\varphi,\theta}\big]_{i,i} = \dot {{\boldsymbol{ b}}}_{\varphi,\theta,i}^{{\rm{ T}}}({{\boldsymbol{u}}}-{{\boldsymbol{ s}}}_i)+{{\boldsymbol{ b}}}_{\varphi,\theta,i}^{{\rm{ T}}}(\dot {{\boldsymbol{u}}}-\dot {{\boldsymbol{ s}}}_i) (94)
    \big[\dot {{\boldsymbol{ B}}}_{\varphi,\varphi}\big]_{i,i} = \dot {{\boldsymbol{ b}}}_{\varphi,\varphi,i}^{{\rm{ T}}}({{\boldsymbol{u}}}-{{\boldsymbol{ s}}}_i)+{{\boldsymbol{ b}}}_{\varphi,\varphi,i}^{{\rm{ T}}}(\dot {{\boldsymbol{u}}}-\dot {{\boldsymbol{ s}}}_i) (95)

    Now, stacking Eq.(40), Eq.(51), Eq.(67), Eq.(68), Eq.(85), Eq.(86) in a sequence offers the overall matrix equation from TDOA, FDOA, AOA and AOA rate measurements:

    \dot {{\boldsymbol{ G}}}{{\boldsymbol{ x}}} = \dot {{\boldsymbol{ h}}}+\Delta \dot {{\boldsymbol{ h}}} (96)

    where

    \begin{split} & {{\boldsymbol{ G}}} = \big[{{\boldsymbol{ G}}}_r^{{\rm{ T}}},\dot {{\boldsymbol{ G}}}_r^{{\rm{ T}}},{{\boldsymbol{ G}}}_{\theta}^{{\rm{ T}}},{{\boldsymbol{ G}}}_{\varphi}^{{\rm{ T}}},\dot {{\boldsymbol{ G}}}_{\theta}^{{\rm{ T}}},\dot {{\boldsymbol{ G}}}_{\varphi}^{{\rm{ T}}}\big]^{{\rm{ T}}}\\ & {{\boldsymbol{ h}}} = \big[{{\boldsymbol{ h}}}_r^{{\rm{ T}}},\dot {{\boldsymbol{ h}}}_r^{{\rm{ T}}},{{\boldsymbol{ h}}}_{\theta}^{{\rm{ T}}},{{\boldsymbol{ h}}}_{\varphi}^{{\rm{ T}}},\dot {{\boldsymbol{ h}}}_{\theta}^{{\rm{ T}}},\dot {{\boldsymbol{ h}}}_{\varphi}^{{\rm{ T}}}\big]^{{\rm{ T}}} \end{split} (97)

    The composite error vector \Delta {{\boldsymbol{ h}}} is given as

    \Delta {{\boldsymbol{ h}}} = {{\boldsymbol{ B}}}\Delta {{\boldsymbol{ \alpha}}} (98)

    with

    {{\boldsymbol{ B}}} = \left[ {\begin{array}{*{20}{l}} {{\boldsymbol{ B}}}_{r,r}&\quad&{{\boldsymbol{ B}}}_{r,\theta}&{{\boldsymbol{ B}}}_{r,\varphi}&\quad&\quad\\ \dot{{\boldsymbol{ B}}}_{r,r}&{{\boldsymbol{ B}}}_{r,r}&\dot{{\boldsymbol{ B}}}_{r,\theta}&\dot{{\boldsymbol{ B}}}_{r,\varphi}&{{\boldsymbol{ B}}}_{r,\theta}&{{\boldsymbol{ B}}}_{r,\varphi}\\ \quad&\quad&{{\boldsymbol{ B}}}_{\theta,\theta}&\quad&\quad&\quad\\ \quad&\quad&{{\boldsymbol{ B}}}_{\varphi,\theta}&{{\boldsymbol{ B}}}_{\varphi,\varphi}&\quad&\quad\\ \quad&\quad&\dot {{\boldsymbol{ B}}}_{\theta,\theta}&\quad&{{\boldsymbol{ B}}}_{\theta,\theta}&\quad\\ \quad&\quad&\dot {{\boldsymbol{ B}}}_{\varphi,\theta}&\dot {{\boldsymbol{ B}}}_{\varphi,\varphi}&{{\boldsymbol{ B}}}_{\varphi,\theta}&{{\boldsymbol{ B}}}_{\varphi,\varphi} \end{array}} \right] (99)

    Then, the WLS estimate for source position and velocity vector {{\boldsymbol{ x}}} to Eq.(96), can be achieved as follows

    \hat {{\boldsymbol{ x}}} = ({{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ G}}})^{-1}{{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ h}}} (100)

    in which {{\boldsymbol{ W}}} is a weighting matrix that is symmetric. The optimal weighting matrix {{\boldsymbol{ W}}} for sufficiently modest measurement noises is

    {{\boldsymbol{ W}}} = E(\Delta {{\boldsymbol{ h}}}\Delta {{\boldsymbol{ h}}}^{{\rm{ T}}})^{-1} = ({{\boldsymbol{ B}}}^{{\rm{ T}}}{{\boldsymbol{ Q}}}{{\boldsymbol{ B}}})^{-1} (101)

    It must be emphasized that, as indicated in Eq.(101), the weighting matrix {{\boldsymbol{ W}}} depends on the true source locations, which is definitely unknown before exiting the algorithm implementation. To solve this dilemma, we set {{\boldsymbol{ W}}} = {{\boldsymbol{ Q}}}^{-1} first in Eq.(100) to generate an initial estimate for {{\boldsymbol{ x}}} . This initial estimate is then substituted into Eq.(101) to compute {{\boldsymbol{ W}}} , from which a more accurate estimate for {{\boldsymbol{ x}}} can be acquired.

    We will analyze the efficiency of the proposed algorithm in this section by deducing the CRLB and theoretical covariance matrix for the proposed algorithm, and focusing on their equality under some conditions.

    For the 3-D moving source localization using quadruple hybrid measurements, the observation vector is {{\boldsymbol{ \alpha}}} , and the parameter vector of interest is {{\boldsymbol{ x}}} . Since observation vector {{\boldsymbol{ \alpha}}} is Gaussian distributed with mean {{\boldsymbol{ \alpha}}}^{{\rm{ o}}} and covariance matrix {{\boldsymbol{ Q}}} , the logarithm of probability density function of {{\boldsymbol{ \alpha}}} conditioned on {{\boldsymbol{ x}}} can be written as

    {{\rm{ ln}}}p({{\boldsymbol{ \alpha}}}|{{\boldsymbol{ x}}}) = \kappa-\frac{1}{2}({{\boldsymbol{ \alpha}}}-{{\boldsymbol{ \alpha}}}^{{\rm{ o}}})^{{\rm{ T}}}{{\boldsymbol{ Q}}}^{-1}({{\boldsymbol{ \alpha}}}-{{\boldsymbol{ \alpha}}}^{{\rm{ o}}}) (102)

    where \kappa is a constant.

    The CRLB of {{\boldsymbol{ x}}} can be produced by taking the inverse of the Fisher information matrix as follows:

    \begin{split} {{\rm{ CRLB}}}({{\boldsymbol{ x}}}) =& -E\left[\dfrac{\partial^2 {{\rm{ ln}}}p({{\boldsymbol{ \alpha}}}|{{\boldsymbol{ x}}})}{\partial {{\boldsymbol{ x}}}\partial {{\boldsymbol{ x}}}^{{\rm{ T}}}}\right]^{-1}\\ =& \left[\left(\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {\boldsymbol{ x}}}\right)^{{\rm{ T}}}{{\boldsymbol{ Q}}}^{-1}\left(\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {\boldsymbol{ x}}}\right)\right]^{-1} \end{split} (103)

    and according to the definition of {{\boldsymbol{ \alpha}}}^{{\rm{ o}}} , the inner elements of the partial derivative \frac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {\boldsymbol{ x}}} can be further detailed in Appendix A.

    Subtracting both sides of Eq.(100) by the identical equation {{\boldsymbol{ x}}} = ({{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ G}}})^{-1}{{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ G}}}{{\boldsymbol{ x}}} , leads to the source location estimation error, denoted by \Delta {{\boldsymbol{ x}}} , as follows

    \begin{split} \Delta {{\boldsymbol{ x}}} =& \hat {{\boldsymbol{ x}}}-{{\boldsymbol{ x}}}\\ =& ({{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ G}}})^{-1}{{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}\Delta {{\boldsymbol{ h}}} \end{split} (104)

    Multiplying Eq.(104) by its transpose and taking expectation, leads to the covariance matrix of source location estimate \hat {{\boldsymbol{ x}}} as

    {{\rm{ cov}}}({{\boldsymbol{ x}}}) = ({{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}{{\boldsymbol{ G}}})^{-1} (105)

    Comparing Eq.(105) and Eq.(103) indicates that {{\rm{ cov}}}({{\boldsymbol{ x}}}) and {{\rm{ CRLB}}}({{\boldsymbol{ x}}}) have the same structural form. To testify their equality, by substituting Eq.(101) into Eq.(105), we further rewrite {{\rm{ cov}}}({{\boldsymbol{ x}}}) as

    {{\rm{ cov}}}({{\boldsymbol{ x}}}) = (\widetilde {{\boldsymbol{ G}}}^{{\rm{ T}}}{{\boldsymbol{ W}}}\widetilde {{\boldsymbol{ G}}})^{-1} (106)

    where

    \widetilde {{\boldsymbol{ G}}} = {{\boldsymbol{ B}}}^{-1}{{\boldsymbol{ G}}} (107)

    After some straightforward mathematical manipulations, it can be shown that when the measurement noises are sufficiently small such that the noises in {{\boldsymbol{ G}}} and {{\boldsymbol{ B}}} can be ignored, we will have the following approximation:

    \widetilde {{\boldsymbol{ G}}} \simeq \frac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {\boldsymbol{ x}}} (108)

    which analytically testifies that

    {{\rm{ cov}}}({{\boldsymbol{ x}}})\simeq {{\rm{ CRLB}}}({{\boldsymbol{ x}}}) (109)

    Hence, we can deduce that the error covariance matrix of the proposed algorithm approximates the CRLB given sufficiently low measurement noise conditions.

    We use Monte Carlo simulations in this section to demonstrate the proposed algorithm’s performance and to validate the theoretical advancements. The 3-D localization geometry is simulated, where a network of M = 8 receivers (unless otherwise specified) whose positions and velocities are tabulated in Table 1, is deployed to localize an unknown moving source with position [30000, 10, 0]^{{\rm{ T}}} m and velocity [200, 10, 0]^{{\rm{ T}}} m/s.

    Table  1.  Positions and velocities of the receivers
    Receiver x_i (m) y_i (m) z_i (m) \dot x_i (m/s) \dot y_i (m/s) \dot z_i (m/s)
    Rx1000000
    Rx2200000150040205
    Rx32000020000100020−200
    Rx4−20000200001500−20201
    Rx5−2000002000−20−200
    Rx6−20000−20000250012−200
    Rx70−2000030001300
    Rx820000−2000350020400
     | Show Table
    DownLoad: CSV

    According to (30), the TDOA-FDOA-AOA-AOA rate measurement vector {{\boldsymbol{ \alpha}}} is simulated by adding zero-mean Gaussian random noise vector \Delta {{\boldsymbol{ \alpha}}} to its true value vector {{\boldsymbol{ \alpha}}}^{{\rm{ o}}} . The covariance matrix of noise vector \Delta {{\boldsymbol{ \alpha}}} is set as {{\boldsymbol{ Q}}} = {{\rm{ diag}}}(\sigma_r^2{{\boldsymbol{ I}}}_{M-1},\sigma_{\dot r}^2{{\boldsymbol{ I}}}_{M-1},\sigma_{\theta}^2{{\boldsymbol{ I}}}_{M}, \sigma_{\varphi}^2{{\boldsymbol{ I}}}_{M}, \sigma_{\dot \theta}^2{{\boldsymbol{ I}}}_{M},\sigma_{\dot \varphi}^2{{\boldsymbol{ I}}}_{M}), where \sigma_r , \sigma_{\dot r} , \sigma_{\theta} , \sigma_{\varphi} , \sigma_{\dot \theta} , \sigma_{\dot \varphi} represents the standard deviations of the TDOA, FDOA, AOA and AOA rate measurement noises. Note that the aforementioned standard deviations are inversely related to the square root of signal to noise ratio (SNR) as below:

    \begin{split} &\sigma_r = \dfrac{\gamma_r}{\sqrt{{\rm{ SNR}}}},\sigma_{\dot r} = \dfrac{\gamma_{\dot r}}{\sqrt{{\rm{ SNR}}}},\sigma_{\theta} = \dfrac{\gamma_{\theta}}{\sqrt{{\rm{ SNR}}}},\\ &\sigma_{\varphi} = \dfrac{\gamma_{\varphi}}{\sqrt{{\rm{ SNR}}}},\sigma_{\dot \theta} = \dfrac{\gamma_{\dot \theta}}{\sqrt{{\rm{ SNR}}}},\sigma_{\dot \varphi} = \dfrac{\gamma_{\dot \varphi}}{\sqrt{{\rm{ SNR}}}} \end{split} (110)

    where \gamma_r , \gamma_{\dot r} , \gamma_{\theta} , \gamma_{\varphi} , \gamma_{\dot \theta} , and \gamma_{\dot \varphi} are scaling factors related to systematic parameters including receiver bandwidth, signal bandwidth and so on. Hence, by setting \gamma_r = 5 m, \gamma_{\dot r} = 0.5 m/s, \gamma_{\theta} = \gamma_{\varphi} = 0.1 deg, \gamma_{\dot \theta} = \gamma_{\dot \varphi} = 0.01 deg/s, we can vary the TDOA-FDOA-AOA-AOA rate measurement noise level by changing the SNR values. The root mean square error (RMSE) of the position and velocity estimation, which is calculated as follows

    {{\rm{ RMSE}}}({{\boldsymbol{u}}}) = \sqrt{\dfrac{1}{N}\sum\limits_{n = 1}^{N}\left \| \hat {{\boldsymbol{u}}}_n-{{\boldsymbol{u}}}\right \|^2} (111)
    {{\rm{ RMSE}}}(\dot{{\boldsymbol{u}}}) = \sqrt{\dfrac{1}{N}\sum\limits_{n = 1}^{N}\left \| \hat {\dot {{\boldsymbol{u}}}}_n-\dot {{\boldsymbol{u}}}\right \|^2} (112)

    is used to evaluate the localization performance. N = 5000 is the total number of Monte Carlo simulations, \hat {{\boldsymbol{u}}}_n and \hat {\dot {{\boldsymbol{u}}}}_n denotes the source position and velocity estimate obtained at the nth Monte Carlo simulation. In order to objectively examine the performance of the proposed algorithm, Noroozi’s algorithm presented in Ref.[21] which locates the moving source by employing TDOA-FDOA measurements, and Xiong’s algorithm presented in Ref.[23] which locates the moving source by utilizing TDOA-FDOA-AOA measurements, are chosen as references for comparison.

    We now inspect the localization performance of the algorithms for different measurement noise levels depending on the SNR. To achieve this, we use these noisy TDOA, FDOA, AOA and AOA rate measurements in our simulations and investigate the localization RMSE of the algorithms with respect to SNR changes.

    Fig.2 presents the RMSE performance versus SNR. It shows that the proposed algorithm generally outperforms Noroozi’s algorithm and Xiong’s algorithm over the entire SNR range, both at the RMSE and CRLB level. The reason for this is due to the fact that the proposed algorithm incorporates extra AOA rate measurements apart from TDOA, FDOA and AOA measurements, thereby leading to an increase in the number of equations and an improvement in localization accuracy. Under sufficiently small measurement noise levels ( {{\rm{ SNR}}}\geq-35 dB), the proposed algorithm accomplishes the CRLB. As measurement noise level rises, The proposed algorithm’s RMSE differs from the CRLB at {{\rm{ SNR}}}\leq-35 dB. And the departure from the CRLB at high noise levels, known as thresholding phenomenon, is largely anticipated, since the proposed algorithm neglects the second order and higher order error terms. By contrast, even at high noise levels, the proposed algorithm still presents the smallest RMSEs among the algorithms. With additional AOA measurements, Xiong’s algorithm provides a relatively smaller RMSE compared to Noroozi’s algorithm, both at the RMSE and CRLB level. However, compared with the proposed algorithm, the localization accuracy improvement brought by the use of AOA measurements in Xiong’s algorithm is not sufficiently impressive.

    Figure  2.  Performance comparison versus measurement noise level

    Next, we inspect the localization performance over the receiver-source distance (defined as the distance between the source and reference receiver) using the receivers presented in Table 1. Assuming the source is initially located at position {{\boldsymbol{u}}} = [1000, 10, 0]^{{\rm{ T}}} m, and is moving away from the centre of the receiver network with velocity \dot {{\boldsymbol{u}}} = [300, 10, 0]^{{\rm{ T}}} m/s. The measurement noise level is kept at {{\rm{ SNR}}} = -35 dB. The rest of the simulation parameters are the same as they were in Section V.1.

    The RMSE performance is plotted against the receiver-source distance in Fig.3. In this case, the relative performance is comparable to that seen in Fig.2, once again demonstrating that the proposed algorithm outperforms Noroozi’s algorithm and Xiong’s algorithm. It is also observed from Fig.3 that the algorithms' localization performance declines as the distance between the receiver and the source grows. This result is in line with previous findings about the effect of receiver-source geometry on localization performance. Furthermore, the results indicate the proposed algorithm achieves the CRLB performance over the moderate receiver-source distance region. When the receiver-source distance is approaching zero, the RMSE curves of the three algorithms are slightly above their respective CRLBs. This is because the relative measurement noise becomes very large when the source is close to the receiver network. Another phenomenon worthy of note is that, when the source is far from the receiver network, the proposed algorithm and Xiong’s algorithm slightly depart from their respective CRLBs. A plausible explanation is that, when the receiver-source distance to the array aperture ratio is large, the AOA measurement lines incorporated in these two algorithms become approximately parallel to each other and do not intersect each other.

    Figure  3.  Performance comparison versus receiver-source distance

    Then, we remove the receivers in the order of number, from Rx7 to Rx1, so as to investigate the effect of the number of receivers on the localization performance. The measurement noise level is kept at {{\rm{ SNR}}} = -30 dB. The rest of the simulation parameters are the same as they were in Section V.1.

    The RMSE performance of the algorithms is compared in Fig.4 with the number of receivers ranging from 2 to 8. As expected, we observe that the proposed algorithm exhibits smaller RMSEs compared with Noroozi’s algorithm and Xiong’s algorithm for different numbers of receivers. As the number of receivers grows, the localization RMSEs of the algorithms decline, but the decline rate tends to zero. Besides, the main advantage of the proposed algorithm over existing algorithms presented in Fig.4 is that the proposed algorithm requires the least minimum number of receivers to locate a moving source. More specifically, as shown by the blue dotted CRLB curves, TDOA-FDOA-based localization method requires, notionally at least, 4 receivers to determine the source position and velocity, but Noroozi’s algorithm (marked by blue squares) requires at least 5 receivers since Noroozi’s algorithm has to estimate the source position, velocity, and two introduced nuisance parameters in the first WLS stage; from the black dotted CRLB curves, it can be seen that TDOA-FDOA-AOA-based localization method requires theoretically at least 2 receivers to determine source position and 4 receivers to determine source velocity, but owing to the introduced nuisance parameters, at least 3 receivers are required for source position estimation and 5 receivers for source velocity estimation in Xiong’s algorithm (marked by black cross). By contrast, as can be seen from the (red dotted) CRLB curves and the RMSE curves (marked by red circle), the proposed algorithm requires only at least 2 receivers to estimate the source position and velocity, since the proposed algorithm incorporates extra AOA rate measurements and does not need to introduce any nuisance parameters.

    Figure  4.  Performance comparison versus number of receivers

    In this paper, moving source localization jointly using TDOA, FDOA, AOA and AOA rate measurements gathered from a number of spatially distributed receivers is investigated. The TDOA, FDOA, AOA and AOA rate measurement equations were firstly established according to the source’s spatial geometric relationship with the receivers. Then an efficient closed-form algorithm for 3-D moving source localization utilizing the quadruple hybrid measurements was developed, without the need for introduction of any nuisance parameters. In contrast to existing two-stage WLS estimators, the proposed algorithm, by jointly using the quadruple hybrid measurements, requires merely one-stage, allowing for source localization with the fewest receivers necessary and outperforming existing algorithms significantly. The CRLB for estimating the source position and velocity is derived given small Gaussian measurement noises, and the efficiency of the proposed algorithm is verified by attaining the CRLB performance. These theoretical developments were corroborated by numerical simulations.

    According to the definition of {{\boldsymbol{ \alpha}}}^{{\rm{ o}}} , the inner elements of the partial derivative \frac{\partial{{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial{{\boldsymbol{ x}}}} can be expressed as

    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{i-1,1:3} = \dfrac{({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_i^{{\rm{ o}}})^{{\rm{ T}}}}{r_i^{{\rm{ o}}}}-\dfrac{({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_1^{{\rm{ o}}})^{{\rm{ T}}}}{r_1^{{\rm{ o}}}},i = 2,3,\dots,M\\
    \begin{split} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{M-2+i,1:3} =& \dfrac{(\dot {{\boldsymbol{u}}}^{{\rm{ o}}}-\dot {{\boldsymbol{ s}}}_i^{{\rm{ o}}})^{{\rm{ T}}}r_i^{{\rm{ o}}}-({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_i^{{\rm{ o}}})^{{\rm{ T}}}\dot r_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^2}\\ & -\dfrac{(\dot {{\boldsymbol{u}}}^{{\rm{ o}}}-\dot {{\boldsymbol{ s}}}_1^{{\rm{ o}}})^{{\rm{ T}}}r_1^{{\rm{ o}}}-({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_1^{{\rm{ o}}})^{{\rm{ T}}}\dot r_1^{{\rm{ o}}}}{(r_1^{{\rm{ o}}})^2},\\ &i = 2,3,\dots,M \end{split}
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{M-2+i,4:6} = \dfrac{({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_i^{{\rm{ o}}})^{{\rm{ T}}}}{r_i^{{\rm{ o}}}}-\dfrac{({{\boldsymbol{u}}}^{{\rm{ o}}}-{{\boldsymbol{ s}}}_1^{{\rm{ o}}})^{{\rm{ T}}}}{r_1^{{\rm{ o}}}},i = 2,3,\dots,M
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{2M-2+i,1} = \dfrac{-(y-y_i)}{(d_i^{{\rm{ o}}})^2},i = 1,2,\dots,M\\
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{2M-2+i,2} = \dfrac{(x-x_i)}{(d_i^{{\rm{ o}}})^2},i = 1,2,\dots,M\\
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{3M-2+i,1} = \dfrac{-(x-x_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}},i = 1,2,\dots,M\\
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{3M-2+i,2} = \dfrac{-(y-y_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}},i = 1,2,\dots,M\\
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{3M-2+i,3} = \dfrac{d_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^2},i = 1,2,\dots,M\\
    \begin{split} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{4M-2+i,1} =& \dfrac{(y-y_i)^2(\dot y-\dot y_i)-(x-x_i)^2(\dot y-\dot y_i)}{(d_i^{{\rm{ o}}})^4}\\ &+\dfrac{2(x-x_i)^2(\dot x-\dot x_i)(y-y_i)}{(d_i^{{\rm{ o}}})^4},\\ &i = 1,2,\dots,M \end{split}
    \begin{split} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{4M-2+i,2} =& \dfrac{(x-x_i)^2(\dot x-\dot x_i)-(x-x_i)^2(y-y_i)}{(d_i^{{\rm{ o}}})^4}\\ & +\dfrac{2(x-x_i)^2(x-x_i)(\dot y-\dot y_i)}{(d_i^{{\rm{ o}}})^4},\\ &i = 1,2,\dots,M \end{split}
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{4M-2+i,4} = \dfrac{-(y-y_i)}{(d_i^{{\rm{ o}}})^2},i = 1,2,\dots,M\\
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{4M-2+i,5} = \dfrac{(x-x_i)}{(d_i^{{\rm{ o}}})^2},i = 1,2,\dots,M\\
    \begin{array}{l} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,1} = \dfrac{2(x-x_i)(z-z_i)\dot r_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^3d_i^{{\rm{ o}}}}+ \dfrac{(x-x_i)(z-z_i)\dot r_i^{{\rm{ o}}}}{r_i^{{\rm{ o}}}(d_i^{{\rm{ o}}})^3}\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;-\dfrac{(\dot x-\dot x_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}}- \dfrac{(x-x_i)(\dot z-\dot z_i)}{(d_i^{{\rm{ o}}})^3},\\ \;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;i = 1,2,\dots,M \end{array}
    \begin{split} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,2} =& \dfrac{2(y-y_i)(z-z_i)\dot r_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^3d_i^{{\rm{ o}}}}+ \dfrac{(y-y_i)(z-z_i)\dot r_i^{{\rm{ o}}}}{r_i^{{\rm{ o}}}(d_i^{{\rm{ o}}})^3}\\ &-\dfrac{(\dot y-\dot y_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}}- \dfrac{(y-y_i)(\dot z-\dot z_i)}{(d_i^{{\rm{ o}}})^3},\\ &i = 1,2,\dots,M \end{split}
    \begin{split} \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,3} =& \dfrac{2(z-z_i)^2\dot r_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^3d_i^{{\rm{ o}}}}-\dfrac{\dot r_i^{{\rm{ o}}}}{r_i^{{\rm{ o}}}d_i^{{\rm{ o}}}}\\ & -\dfrac{(z-z_i)(\dot z-\dot z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}},\\ &i = 1,2,\dots,M \end{split}
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,4} = \dfrac{-(x-x_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}},i = 1,2,\dots,M
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,5} = \dfrac{-(y-y_i)(z-z_i)}{(r_i^{{\rm{ o}}})^2d_i^{{\rm{ o}}}},i = 1,2,\dots,M
    \left[\dfrac{\partial {{\boldsymbol{ \alpha}}}^{{\rm{ o}}}}{\partial {{\boldsymbol{ x}}}}\right]_{5M-2+i,4} = \dfrac{d_i^{{\rm{ o}}}}{(r_i^{{\rm{ o}}})^2},i = 1,2,\dots,M

    where d_i^{{\rm{ o}}} = \sqrt{(x-x_i)^2+(y-y_i)^2} .

  • [1]
    D. Vitas, M. Tomic, and M. Burul, “Traffic light detection in autonomous driving systems,” IEEE Consumer Electronics Magazine, vol.9, no.4, pp.90–96, 2020. DOI: 10.1109/MCE.2020.2969156
    [2]
    P. Wan, Q. Huang, G. Lu, et al., “Passive localization of signal source based on UAVs in complex environment,” China Communications, vol.17, no.2, pp.107–116, 2020. DOI: 10.23919/JCC.2020.02.009
    [3]
    P. Xu, G. Dherbomez, E. Hery, et al., “System architecture of a driverless electric car in the grand cooperative driving challenge,” IEEE Intelligent Transportation Systems Mag., vol.10, no.1, pp.47–59, 2018. DOI: 10.1109/MITS.2017.2776135
    [4]
    D. Kim, G. Park, H. Kim, et al., “Computationally efficient TDOA/FDOA estimation for unknown communication signals in electronic warfare systems,” IEEE Transactions on Aerospace and Electronic Systems, vol.54, no.1, pp.77–89, 2018. DOI: 10.1109/TAES.2017.2735118
    [5]
    Q. Huang, J. Feng, and Y. Fang, “Two-dimensional DOA estimation using one-dimensional search for spherical arrays,” Chinese Journal of Electronics, vol.28, no.6, pp.1259–1264, 2019. DOI: 10.1049/cje.2019.08.009
    [6]
    Y. T. Chan and K. C. Ho, “A simple and efficient estimator for hyperbolic location,” IEEE Transactions on Signal Processing, vol.42, no.8, pp.1905–1915, 1994. DOI: 10.1109/78.301830
    [7]
    Y. Zou and H. Liu, “TDOA localization with unknown signal propagation speed and sensor position errors,” IEEE Communications Letters, vol.24, no.5, pp.1024–1027, 2020. DOI: 10.1109/LCOMM.2020.2968434
    [8]
    D. Wang, J. Yin, R. Liu, et al., “Performance analysis and improvement for TDOA source localization in the presence of synchronization clock bias,” Acta Electronica Sinica, vol.46, no.6, pp.1962–1971, 2018. (in Chinese)
    [9]
    Q. Li, B. Chen, and M. Yang, “Improved two-step constrained total least-squares TDOA localization algorithm based on the alternating direction method of multipliers,” IEEE Sensors Journal, vol.20, no.22, pp.13666–13673, 2020. DOI: 10.1109/JSEN.2020.3004235
    [10]
    Y. Wang and K. C. Ho, “An asymptotically efficient estimator in closed-form for 3-D AOA localization using a sensor network,” IEEE Transactions on Wireless Communications, vol.14, no.12, pp.6524–6535, 2015. DOI: 10.1109/TWC.2015.2456057
    [11]
    Y. Wang and K. C. Ho, “Unified near-field and far-field localization for AOA and hybrid AOA-TDOA positionings,” IEEE Transactions on Wireless Communications, vol.17, no.2, pp.1242–1254, 2018. DOI: 10.1109/TWC.2017.2777457
    [12]
    Q. Yan, J. Chen, O. Geoffrey, et al., “Robust AOA based acoustic source localization method with unreliable measurements,” Signal Processing, vol.152, pp.13–21, 2018. DOI: 10.1016/j.sigpro.2018.05.010
    [13]
    Y. Norouzi, and M. Derakhshani, “Joint time difference of arrival/angle of arrival position finding in passive radar,” IET Radar Sonar & Navigation, vol.3, no.2, pp.167–176, 2009. DOI: 10.1049/iet-rsn:20080069
    [14]
    C. Liu, J. Yang, and F. Wang, “Joint TDOA and AOA location algorithm,” Journal of Systems Engineering & Electronics, vol.24, no.2, pp.183–188, 2013.
    [15]
    J. Yin, Q. Wan, S. Yang, et al., “A simple and accurate TDOA-AOA localization method using two stations,” IEEE Signal Processing Letters, vol.23, no.1, pp.144–148, 2016. DOI: 10.1109/LSP.2015.2505138
    [16]
    C. Wann, Y. Yeh, and C. Hsueh, “Hybrid TDOA/AOA indoor positioning and tracking using extended Kalman filters,” IEEE 63rd Vehicular Technology Conference, Melbourne, Vic., Australia, pp.1058−1062, 2006.
    [17]
    K. C. Ho and W. Xu, “An accurate algebraic solution for moving source location using TDOA and FDOA measurements,” IEEE Transactions on Signal Processing, vol.52, no.9, pp.2453–2463, 2004. DOI: 10.1109/TSP.2004.831921
    [18]
    K. C. Ho, X. Lu, and L. Kovavisaruch, “Source localization using TDOA and FDOA measurements in the presence of receiver location errors: Analysis and solution,” IEEE Trans. on Signal Processing, vol.55, no.2, pp.684–696, 2007. DOI: 10.1109/TSP.2006.885744
    [19]
    G. Wang, S. Cai, Y. Li, et al., “A bias-reduced nonlinear WLS method for TDOA/FDOA-based source localization,” IEEE Transactions on Vehicular Technology, vol.65, no.10, pp.8603–8615, 2016. DOI: 10.1109/TVT.2015.2508501
    [20]
    X. Qu, L. Xie, and W. Tan, “Iterative constrained weighted least squares source localization using TDOA and FDOA measurements,” IEEE Transactions on Signal Processing, vol.65, no.15, pp.3990–4003, 2017. DOI: 10.1109/TSP.2017.2703667
    [21]
    A. Noroozi, A. H. Oveis, S. M. Hosseini, et al., “Improved algebraic solution for source localization from TDOA and FDOA measurements,” IEEE Wireless Communications Letters, vol.7, no.3, pp.352–355, 2018. DOI: 10.1109/LWC.2017.2777995
    [22]
    Z. X. Liu, D. X. Hu, Y. S. Zhao, et al., “An algebraic method for moving source localization using TDOA, FDOA, and differential Doppler rate measurements with receiver location errors,” EURASIP Journal on Advances in Signal Processing, vol.2019, no.1, article no.25, 2019. DOI: 10.1186/s13634-019-0621-9
    [23]
    J. Xiong, J. Chen, J. Ning, et al., “Closed-form AOA-TDOA-FDOA solution for moving source location,” Journal of University of Electronic Science and Technology of China, vol.49, no.2, pp.219–227, 2020.
    [24]
    J. Nanzer, “Millimeter-wave interferometric angular velocity detection,” IEEE Transactions on Microwave Theory and Techniques, vol.58, no.12, pp.4128–4136, 2010.
    [25]
    J. Nanzer and K. Zilevu, “Dual interferometric-Doppler measurements of the radial and angular velocity of humans,” IEEE Transactions on Antennas and Propagation, vol.62, no.3, pp.1513–1517, 2014. DOI: 10.1109/TAP.2013.2296325
    [26]
    J. A. Nanzer and M. D. Sharp, “On the estimation of angle rate in radar,” IEEE Transactions on Antennas and Propagation, vol.65, no.3, pp.1339–1348, 2017. DOI: 10.1109/TAP.2016.2645785
    [27]
    M. D. Sharp and J. A. Nanzer, “Accuracy of angle rate measurements using a distributed radar with a correlation receiver,” IEEE Antennas and Wireless Propagation Letters, vol.17, no.2, pp.209–212, 2018. DOI: 10.1109/LAWP.2017.2780241
  • Related Articles

    [1]JIANG Hongzhi, ZHAO Chuang, ZHAO Yongjun. Coherent Integration Algorithm for Frequency-Agile and PRF-Jittering Signals in Passive Localization[J]. Chinese Journal of Electronics, 2021, 30(4): 781-792. DOI: 10.1049/cje.2021.06.001
    [2]WANG Hongbo, YANG Fan, TIAN Kena, TU Xuyan. A Many-Objective Evolutionary Algorithm with Spatial Division and Angle Culling Strategy[J]. Chinese Journal of Electronics, 2021, 30(3): 437-443. DOI: 10.1049/cje.2021.03.006
    [3]LU Debiao, TANG Dezhang, SPIEGEL Dirk. Hazard Rate Estimation for GNSS-Based Train Localization Using Model-Based Approach[J]. Chinese Journal of Electronics, 2020, 29(1): 49-56. DOI: 10.1049/cje.2019.09.006
    [4]ZHANG Yong, HE Peiyu, PAN Fan. Three-Dimension Localization of Wideband Sources Using Sensor Network[J]. Chinese Journal of Electronics, 2017, 26(6): 1302-1307. DOI: 10.1049/cje.2017.07.003
    [5]JIA Zongpu, WEI Xiaojuan, GUO Hairu, PENG Weiping, SONG Cheng. A Privacy Protection Strategy for Source Location in WSN Based on Angle and Dynamical Adjustment of Node Emission Radius[J]. Chinese Journal of Electronics, 2017, 26(5): 1064-1072. DOI: 10.1049/cje.2016.08.022
    [6]WANG Xiumin, GE Tingting, LI Jun, SU Chen, HONG Fangfei. Efficient Multi-rate Encoder of QC-LDPC Codes Based on FPGA for WIMAX Standard[J]. Chinese Journal of Electronics, 2017, 26(2): 250-255. DOI: 10.1049/cje.2017.01.006
    [7]FANG Weiwei, CHEN Yuanzhi, ZHOU Deyang. Metric-Based and Angle-Rotated Tone Reservation Scheme for PAPR Reduction in OFDM Systems[J]. Chinese Journal of Electronics, 2013, 22(4): 803-806.
    [8]WANG Xuesong, LIU Qingfeng, CHENG Yuhu, LI Lijing. Qualitative Analysis of Gene Regulatory Networks Based on Angular Discretization[J]. Chinese Journal of Electronics, 2011, 20(4): 646-650.
    [9]HOU Tao and LIU Jia. Vector Angle Minimum Criteria for Classi¯erSelection in Speaker Veri¯cation Technology[J]. Chinese Journal of Electronics, 2010, 19(1): 81-85.
    [10]CHEN Zhangxin, WAN Qun, WEI Hewen, YANG Wanlin. A Novel Subspace Approach for Hyperbolic Mobile Location[J]. Chinese Journal of Electronics, 2009, 18(3): 569-573.
  • Cited by

    Periodical cited type(5)

    1. Zhao, P., Jiang, L., Tang, T. et al. Fusion of Land-Based and Satellite-Based Localization Using Constrained Weighted Least Squares. Sensors, 2024, 24(8): 2628. DOI:10.3390/s24082628
    2. Li, J., Tang, T., Wu, Z. et al. An iterative method for short-wave source localization based on constrained weighted least squares. Proceedings of SPIE - The International Society for Optical Engineering, 2024. DOI:10.1117/12.3030351
    3. Jiang, L., Tang, T., Wu, Z. et al. A two-stage iterative method for short-wave source localisation. IET Radar, Sonar and Navigation, 2023, 17(12): 1847-1862. DOI:10.1049/rsn2.12472
    4. Jiang, L., Tang, T., Wu, Z. et al. An iterative algorithm for the joint estimation of multiple targets and observation stations using direction of arrival and time difference of arrival measurements despite station position errors. IET Signal Processing, 2023, 17(6): e12229. DOI:10.1049/sil2.12229
    5. Wang, D., Yin, J., Chen, C. et al. Novel frequency of arrival-based emitter localisation methods based on multiple moving observers. IET Signal Processing, 2023, 17(1): e12161. DOI:10.1049/sil2.12161

    Other cited types(0)

Catalog

    Figures(4)  /  Tables(1)

    Article Metrics

    Article views (747) PDF downloads (90) Cited by(5)
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return