 Research
 Open Access
Novel maximum likelihood approach for passive detection and localisation of multiple emitters
 Marcel Hernandez^{1}Email author
https://doi.org/10.1186/s1363401704730
© The Author(s) 2017
 Received: 3 September 2016
 Accepted: 3 May 2017
 Published: 25 May 2017
Abstract
In this paper, a novel target acquisition and localisation algorithm (TALA) is introduced that offers a capability for detecting and localising multiple targets using the intermittent “signalsofopportunity” (e.g. acoustic impulses or radio frequency transmissions) they generate. The TALA is a batch estimator that addresses the complex multisensor/multitarget data association problem in order to estimate the locations of an unknown number of targets. The TALA is unique in that it does not require measurements to be of a specific type, and can be implemented for systems composed of either homogeneous or heterogeneous sensors. The performance of the TALA is demonstrated in simulated scenarios with a network of 20 sensors and up to 10 targets. The sensors generate angleofarrival (AOA), timeofarrival (TOA), or hybrid AOA/TOA measurements. It is shown that the TALA is able to successfully detect 83–99% of the targets, with a negligible number of false targets declared. Furthermore, the localisation errors of the TALA are typically within 10% of the errors generated by a “genie” algorithm that is given the correct measurementtotarget associations. The TALA also performs well in comparison with an optimistic CramérRao lower bound, with typical differences in performance of 10–20%, and differences in performance of 40–50% in the most difficult scenarios considered. The computational expense of the TALA is also controllable, which allows the TALA to maintain computational feasibility even in the most challenging scenarios considered. This allows the approach to be implemented in timecritical scenarios, such as in the localisation of artillery firing events. It is concluded that the TALA provides a powerful situational awareness aid for passive surveillance operations.
Keywords
 Passive detection and localisation
 Multisensor/multitarget data association
 Maximum likelihood estimation
 GaussNewton gradient descent
 CramérRao lower bound
 Timeofarrival measurements
1 Introduction
Recently, there has been great interest in the detection, localisation and tracking of noncooperative targets using passive sensors that exploit the “signalsofopportunity” generated by such targets (e.g. see [1] and references therein). Typical applications include detection and localisation of weapon firing events [2, 3] and localisation in wireless communication systems [4, 5], nonlineofsight (e.g. urban) environments [6], and in search/rescue operations [7].
Passive surveillance has the advantage of covertness, and passive sensors are typically smaller, cheaper, and lower power than their active counterparts. This allows passive sensors to be utilised in scenarios that would preclude the deployment of active sensors (e.g. such as in remote operations). Passive measurement exploitation has a long history, beginning with angleofarrival (AOA) emitter localisation [8]. Other commonly used passive measurements include timeofarrival (TOA), time difference of arrival (TDOA), frequency of arrival (FOA), and combinations thereof (e.g. again, see [1] and references therein).
Due to the intermittent nature of target signals in passive surveillance operations (e.g. artillery firings may occur in short bursts only every few days), recursive estimation techniques (e.g. such as the extended Kalman filter [9]) may be ineffective, because the interval between signals is too large to allow persistent target tracking. Therefore, it is common to perform batch estimation in order to detect and localise target emitters, exploiting all measurements generated by the sensors within a time window, e.g. [2, 4, 5, 10–13]. The time window must be sufficiently large to account for target signal propagation delays between the sensors.
Previous work on passive emitter geolocation has largely concentrated on the case of a single target, thereby avoiding the problem of associating measurements to targets. For example, maximum likelihood (ML) approaches have been developed for single target localisation using either TOA measurements [14], range measurements generated by a multistatic passive radar [15], or TDOA measurements [16]. Target localisation using hybrid measurements has also been performed, with least squares (e.g. [4, 5]) and ML (e.g. [11, 12]) approaches developed in order to localise a single emitter using hybrid AOA/TDOA measurements.
Todate, only a small number of papers have considered the problem of localising multiple emitters [2, 10, 13, 17–20]. Some of these papers have addressed simplified scenarios with either perfect measurements [17, 18] or a known number of emitters [13]. The remaining papers have developed techniques specifically for a TOA measurement model [2, 10, 19, 20], and these approaches cannot be easily modified to deal with other measurement models (e.g. hybrid AOA/TOA measurements). Furthermore, as noted in [10], there remains a requirement to generalise existing approaches in order that they can exploit measurements generated by a network of heterogeneous sensors.
The target acquisition and localisation algorithm (TALA) introduced herein addresses the complex multisensor/multitarget data association problem, in order to detect and localise an unknown number of target signals/events (e.g. such as acoustic impulses generated by artillery firings or intermittent radio frequency transmissions). The TALA is a batch estimator, and its novelty lies in the mechanism by which it circumnavigates the need to perform global multisensor/multitarget data association, e.g. as necessary in [20], thereby allowing the TALA to maintain computational feasibility, even for largescale problems. Furthermore, unlike existing approaches (e.g. [2, 10, 19, 20]), the TALA does not require measurements to be of a specific type (i.e. TOA measurements) and can be implemented for systems composed of either homogeneous or heterogeneous sensors.
Specifically, the TALA initially performs nearest neighbour data association (e.g. see [21]) on a measurementbymeasurement basis, allowing each measurement to be associated with multiple hypothesised target locations. The algorithm formulates a set of potential target location hypotheses, and then performs GaussNewton (GN) gradient descent (e.g. [24]) to provide maximum likelihood estimates of these locations, before a final downselection step, ensures that each measurement is associated with no greater than one estimate.
This mechanism for handling the complex multisensor/multitarget association problem, based on manipulating multiple competing hypotheses, removes the need to perform global data association (which can be a computationally prohibitive combinatorial optimisation, e.g. see [22]), and is analogous to the trackoriented multiple hypothesis tracking (TOMHT) methodology introduced in [22]. However, unlike the TOMHT, the TALA is a nonrecursive (i.e. “oneshot”) approach, rather than the update of an existing target set.
The remainder of this paper is organised as follows. In Section 2, the TALA is described. In Section 3, details are provided of the two measures of optimal estimation performance that are used to baseline the performance of the TALA. The first measure is the CramérRao lower bound [23], and the second is a “genie” TALA that is given the correct measurementtotarget associations. In Section 4, simulation results are presented for scenarios in which all sensors provide hybrid AOA/TOA measurements, and scenarios in which 50% of the sensors provide only AOA measurements, with the remaining sensors providing only TOA measurements. A discussion is presented in Section 5 with conclusions following in Section 7. Section 6 provides details of recommendations for future work. Finally, Appendix A provides details of the methodology for determining initial candidate target locations using the AOA and distance difference of arrival (DDOA) measurements available in the simulations.
2 Target acquisition and localisation algorithm
2.1 Overview
The TALA is a batch estimation algorithm that utilises all measurements generated within a time window by an array of sensors, in order to detect and localise an unknown number of target events (i.e. intermittent signals, such as acoustic impulses or radio frequency transmissions). Initially, the TALA generates “candidate” target locations, and then performs “soft” nearest neighbour data association (e.g. [21]), allowing each measurement to be associated with more than one candidate location. This approach removes the need to perform global multisensor/multitarget data association, e.g. as necessary in [20], thereby maintaining computational feasibility, even for large scale problems.
Using the measurements associated with each candidate location, ML estimation is then performed in order to localise each potential target. The ML estimation problem cannot be solved analytically, and an iterative GN approach (e.g. [24]) is used to solve an equivalent nonlinear least squares problem. The GN approach performs iterative gradient descent, and in order to combat potential divergence, line search and randomisation are used to ensure that each iteration increases the value of the likelihood. It is noted that alternative techniques, such as the NewtonRaphson (NR) approach (e.g. [25]) or the LevenbergMarquardt algorithm [26, 27], could also be used to perform the gradient descent and may offer similar performance.
2.2 Summary of the main steps
 1.Step 1: Determine initial candidate locations

If possible (generally only in twodimensional emitter geolocation), determine the intersection between measurements generated by each pair of sensors.

More generally, determine a candidate location that minimises a Mahalanobisbased distance metric using measurements generated by each pair of sensors.

These points form the initial candidate (target) location set.

In cases for which performing measurement intersection or Mahalanobis distance minimisation is problematic/impossible, initial candidate locations should be randomly sampled within the surveillance region.

 2.Step 2: Associate measurements and determine likelihood for each candidate location

Determine the measurement from each sensor that has the greatest individual likelihood (or equivalently the smallest Mahalanobis distance) for each candidate location.

This measurement is associated with the location provided that the individual likelihood is greater than a prespecified threshold value.

Each measurement is allowed to be associated with more than one candidate location.

The overall likelihood of each candidate location is calculated using all of the associated measurements.

 3.Step 3: Candidate location deletion

The number of candidate locations can be large.

To reduce the computational expense of the algorithm, at this stage, some of the candidate locations are deleted.

A candidate location is deleted if it either has too few measurements associated with it or if it shares identical associations with another candidate target location that has a greater overall likelihood.

Optionally, the candidate location is deleted if it shares any associations with another candidate target location that has a greater overall likelihood.

 4.Step 4: Maximum likelihood estimation

Using the candidate locations retained from Step 3, plus the measurements associated with each location, determine ML estimates via an iterative GN approach.

Optionally, measurement reassociation may be performed on each iteration of the GN algorithm.

 5.Step 5: Final downselection/outputs

Perform downselection to ensure that each measurement is associated with only one ML estimate.

2.3 Step 1: Determine initial candidate locations
where \(\boldsymbol {f}(\boldsymbol {X};i)\triangleq \left (f_{1}(\boldsymbol {X};i) \ \ldots \ f_{d_{i}}(\boldsymbol {X};i)\right)'\). Each measurement error \(\boldsymbol {e}(i)\sim {\mathcal N}(0, \boldsymbol {\Sigma }_{i})\), with Σ _{ i } denoting the error covariance of each targetgenerated measurement at sensor i.
 1.
If the focal problem is concerned with the geolocation of targets within a twodimensional region (e.g. the geolocation of groundbased targets within a geographically flat region), initial candidate locations can be determined as the intersection of each pair of measurements (if such an intersecting point exists). In later simulations, the intersections between pairs of AOA measurements and pairs of DDOA measurements are used to generate initial candidate locations.
 2.For more complex applications in which measurement intersection cannot be performed (e.g. threedimensional target geolocation, in which case the measurements are extremely unlikely to intersect because of the presence of measurement errors), for each pair of measurements \(\boldsymbol {\hat z}\triangleq \left (\boldsymbol {z}(i_{1},.)' \ \boldsymbol {z}(i_{2},.)'\right)'\), for i _{1}≠i _{2}; a candidate location X _{ c } can be determined by minimising the Mahalanobis distance between \(\boldsymbol {\hat z}\) and \(\boldsymbol {\hat f}(\boldsymbol {X})\triangleq \left (\boldsymbol {f}(\boldsymbol {X};i_{1})' \ \boldsymbol {f}(\boldsymbol {X};i_{2})'\right)'\), i.e.$$\begin{array}{@{}rcl@{}} \boldsymbol{X}_{c} & = & \mathop{\text{arg min}}\limits_{\boldsymbol{X}\in \mathbb{R}^{3}} \left[ \boldsymbol{\epsilon(\boldsymbol{X})}' \boldsymbol{\hat \Sigma}^{1} \boldsymbol{\epsilon(\boldsymbol{X})} \right] \end{array} $$(2)
where \(\boldsymbol {\epsilon }(\boldsymbol {X})\triangleq (\boldsymbol {\hat z}\boldsymbol {\hat f}(\boldsymbol {X}))\); and \(\boldsymbol {\hat \Sigma }\) is the error covariance of the measurement \(\boldsymbol {\hat z}\).
It may be necessary to limit the number of candidate locations by not considering all combinations of sensor measurements in determining the intersections (in twodimensional applications) or minimising (2) (in threedimensional applications). Moreover, in threedimensional geolocation applications, the optimisation in Eq. (2) may not be straightforward, and it may be more efficient to randomly select candidate locations within the surveillance region.
2.4 Step 2: Associate measurements and determine likelihood for each candidate location
 1.
The index a(X;i)∈{1,…,n(i)} of the measurement that is associated is the one with the largest individual likelihood, i.e. nearest neighbour data association is performed (e.g. see [21]).
 2.
If every measurement generated by a sensor has an individual likelihood that is less than 100 ξ % of the maximum value l _{ i }(max), then no measurement from that sensor is associated with the location. The threshold ξ∈[0,1] is prespecified. It is noted that this approach is equivalent to gating the measurement Mahalanobis distance with a threshold \(g= \sqrt {2\ln \xi }\).
It is noted that a(X;i)=−1 denotes that no measurement from sensor i is associated with the location X.
More importantly, in this case, the ensemble of measurements that satisfy Eq. (3), for i=1,…, N, also maximises the overall measurement likelihood.
There is no practical reason why the nearest neighbour data association approach cannot be used if the measurements from different sensors are correlated. However, it should be noted that the resulting measurement set is not guaranteed to be close to optimal in maximising the overall measurement likelihood. In such cases, performing measurement reassociation during gradient descent (see Section 2.6.3) may be helpful in correctly resolving the complex multisensor/multitarget data association problem.
An exemplar likelihood map is shown in Fig. 1. It is noted that this map is shown for illustration only. The reader is reminded that the TALA calculates the likelihood only at the initial candidate locations and at the locations determined on subsequent iterations of the gradient descent algorithm.
2.5 Step 3: Candidate location deletion
 1.
Deletion criterion 1: The candidate location does not have at least μ P _{ d } N measurements associated with it (i.e. it is not consistent enough with the data). This value is set by noting that the average number of measurements generated by each target is P _{ d } N for a system with N sensors, and with a probability P _{ d } that each target is detected by each sensor. In simulations, a value of μ=0.5 was shown to produce excellent results.
 2.
Deletion criterion 2: The candidate location has exactly the same measurements associated with it as another candidate location that has greater overall likelihood.
 3.Deletion criterion 3 (optional): The candidate location has one or more measurements associated with it that are also associated with another candidate location that has greater overall likelihood. The procedure for implementing this deletion criterion is as follows:
 (a)
The overall likelihood is calculated for each candidate location, using the procedure described on Step 2 of the algorithm.
 (b)
The candidate location with the greatest overall likelihood is accepted as a potential target location.
 (c)
Recursively, consider the candidate location with next greatest likelihood. If this candidate location does not share any associations with any of the previously accepted candidate locations it is also accepted as a potential target location, otherwise it is deleted.
 (a)
Deletion criterion 3 has the advantage of significantly reducing the number of candidate locations that need to be manipulated, and this can significantly reduce the computational expense of the algorithm. The disadvantage is that by deleting candidate locations at this early stage, the TALA has a reduced probability of detecting all target events. This criterion therefore compromises estimator performance for increased computational speed.
In Fig. 2 b, the results of the intersection deletion step are shown for the exemplar scenario. It is noted that deletion criterion 3 is not used in this example.
2.6 Step 4: Maximum likelihood estimation
2.6.1 Background — standard GaussNewton approach
with Z, f(X), and Σ given in Eqs. (9), (10), and (13) respectively.
where \(\nabla _{\boldsymbol {X}_{k}}\phantom {\dot {i}\!}\) is the firstorder partial derivative operator with respect to \(\boldsymbol {X}_{k}\in \mathbb {R}^{3}\).
If the iterative scheme given in Eq. (18) converges, it will do so to a stationary point, thereby providing a ML estimate. However, convergence is not guaranteed and is highly dependent on the proximity of the initial estimate X _{0} to the stationary value.
2.6.2 Implementation — GaussNewton approach with an adaptive step size

Λ _{ k } is the increment from the set {α δ _{ k }/m: α=−m,…,−1,1,…,m} that results in the greatest increase in the overall measurement likelihood; where δ _{ k } is the full Newton step (19) and m is a prespecified positive integer;

Λ _{ k } is a step in a randomly generated direction (i.e. drawn from a Uniform distribution on [−π,π]) of magnitude δ _{ M } (nominally, δ _{ M } = 200 metres). This random step is accepted if it increases the overall measurement likelihood.
 1.
A total of 20 random steps have been attempted.
 2.
The magnitude of each component of the gradient of the normalised sumofsquared errors (GNSSE) is smaller than a prespecified value (nominally 10^{−3}). Only in this case is successful convergence to a ML estimate deemed to have been achieved.
This “line search” adaptation of the GN approach is similar to the line search approach detailed in Section 9.7 in [25]. In Fig. 2 c, ML estimates calculated using the GN approach are shown for the exemplar scenario.
2.6.3 Reassociation during gradient descent
In scenarios in which the measurement errors are large, each initial candidate location (e.g. generated from the intersection of a pair of measurements) may be distant from the ML estimate. In such cases, the measurements associated with the initial candidate location may not be the nearest to each of the subsequent iterates, X _{ k }, k=1,2,…, of the GN algorithm.
Motivated by this, in cases in which the measurements are inaccurate, reassociation can be performed after each iteration of the GN approach. That is, having determined iterate X _{ k }, reassociation is performed, and the measurements associated with location X _{ k } are used to determine the next increment δ _{ k }, and next iterate X _{ k+1}.
Performing reassociation can significantly improve performance when measurement errors are large. However, this is at the cost of (i) increasing the computational expense of the algorithm and (ii) making the algorithm less likely to converge to a ML estimate, hence reducing the number of target events located.
2.7 Step 5: Final downselection/outputs
Having determined the ML estimates on Step 4, downselection is performed in order to ensure that each measurement is associated with no greater than one ML estimate. The procedure for performing this downselection is exactly the same as given in the optional deletion criterion 3 on Step 3. It is noted that if the optional criterion is performed on Step 3, and provided that reassociation is not performed during the gradient descent on Step 4, then this downselection has already been performed.
A final downselection step also deletes estimates that lie within the sensor perimeter. Such estimates are rare, but can occur because of incorrect associations, or convergence to the wrong point of intersection of the associated measurements.
The matrix Σ is again given by Eq. (13); and the matrix F(.) is given by Eq. (20). In Fig. 2 d, the final outputs of the target localisation algorithm are shown for the exemplar scenario.
3 Measures of optimal estimation performance
3.1 CramérRao lower bound
where J(X) is the Fisher information matrix (FIM) and \({\mathbb E}_{\boldsymbol {Z}\boldsymbol {X}}\) denotes mathematical expectation with respect to the measurement vector Z, given X. The CRLB provides a bound on the performance of any unbiased target localisation algorithm.
where n _{ s } is the number of measurement sequence realisations considered, and \(\boldsymbol {\tilde {J}}_{r}(\boldsymbol {X})\) is the conditional FIM for measurement sequence realisation r. This is referred to the “enumeration” bound [29] and has been shown to be the least optimistic formulation of the CRLB [30] for the case P _{ d }<1.
where CRLB_{ ii } denotes the ith diagonal entry of the CRLB (this provides a MSE bound for the estimation of the ith coordinate of the target event).
In the simulations that follow, for each target location X, a single measurement sequence realisation is considered (i.e. n _{ s }=1). The overall CRLB is then calculated by averaging the value of the CRLB for each of the target locations, with its associated measurement sequence realisation, used in the simulations.
It is noted that this CRLB formulation can still be optimistic because the bound is calculated independently for each target event. The formulation therefore does not take into account the difficulty of associating measurements between targets, in multiple event scenarios. Formally, this difficulty is quantified via an information reduction matrix, which is extremely complex and can only be calculated via Monte Carlo integration. For full details of the approach, the reader is referred to [31].
In later simulations, there is also the potential for spurious false alarm (i.e. “ghost”) measurements to occur. It is therefore noted that the CRLB formation utilised herein does not take into account the impact of these false measurements. The reader is referred to [32] for details of how to adjust the CRLB in the presence of false alarms.
3.2 “Genie” TALA with the measurementtotarget associations given
In light of the potential optimism of the CRLB formulation presented in the previous section, a second performance measure is provided in order to help quantify the optimality of the TALA. This second performance measure is a “genie”based algorithm, in the spirit of [10], that is given the correct measurementtotarget associations.
 1.
The GN approach (given on Step 4 of the TALA) is used in an attempt to determine a ML estimate, using the measurements generated by the target.
 2.
The GN approach is initialised using the intersection of two of the targetgenerated measurements, if such an intersection exists. Otherwise, an initial location is randomly generated, as in step 3 below.
 3.
If the GN approach fails to converge to a ML estimate, an initial candidate location is randomly generated within the surveillance region, and the GN approach is rerun. A maximum of 20 randomly generated initial locations are attempted.
This performance measure is referred to as the “genie” TALA (gTALA). Clearly, the gTALA is likely to provide a bound on the optimal performance of the TALA because it avoids the potentially complex problem of associating measurements to targets. However, a performance bound is not guaranteed.
4 Simulations
4.1 Scenarios considered
 1.
Scenario 1: Target events occur at different times, with the time instance of each event sampled from a uniform distribution on [0, 100] seconds. Each sensor provides hybrid AOA/TOA measurements.
 2.
Scenario 2: Target events occur simultaneously. Again, each sensor provides hybrid AOA/TOA measurements.
 3.
Scenario 3: Target events occur simultaneously. Fifty percent of the sensors provide only AOA measurements, with the remaining sensors providing only TOA measurements.
Parameter values used in the simulations
Parameter  Value 

Number of sensors (N)  20 
Locations of sensors  Grid formation with separations of 50 m (see Fig. 1) 
Probability of detection of each target (P _{ d })  0.8, 0.9, or 1.0 
Average false alarms per sensor  2.2 
AOA measurement error standard deviation (σ _{ θ })  1 ^{ o } 
DDOA measurement error standard deviation \((\sqrt {2}c \sigma _{t})\)  10 m 
Signal propagation speed, c  343.2 m/s (i.e. the speed of sound in air) 
Number of target events  Up to 10 
Target event locations  Uniformly sampled in the surveillance region [3 km, 7 km] × [2 km, 2 km], but excluding events from occurring within 500 m of the sensor array (again, see Fig. 3) 
Target event times  Either the same or each sampled from a uniform [0, 100] seconds distribution 
4.2 Measurement generation
4.2.1 AOA and TOA measurements
where (x _{ S },y _{ S }) are the Cartesian coordinates of the sensor.
4.2.2 DDOA measurement generation
Importantly, Eq. (31) is independent of t _{ k }. The exploitation of TDOA measurements has been an area of great interest for over three decades [33]. Each TDOA measurement provides a hyperbola of potential target locations, and the intersection of two such hyperbola enables the target location to be estimated (e.g. see [34]).
In order to determine a unique set of DDOAs, in which no measurement is a linear combination of any of the other measurements, the DDOAs are calculated between a reference sensor (denoted throughout by the index “R”) and each of the other sensors. It is noted that the DDOA measurements generated by different sensors are correlated, because they utilise the same TOA measurement generated by the reference sensor. Indeed, it can easily be shown that \({\mathrm Cov}\left [ \tau (R,i), \tau (R,j)\right ]= c^{2}\sigma _{t}^{2}\) for i≠j; and \({\mathrm Cov}\left [ \tau (R,i), \tau (R,i)\right ]= 2c^{2}\sigma _{t}^{2}\) for i=1,…,N.
The reference sensor is chosen to be the sensor at which the greatest number of measurements are generated. This ensures that the largest possible set of potential DDOA measurements is created. This is particularly important if there are missed detections, because in such cases a poor choice of reference sensor (i.e. choosing one at which very few measurements are generated) could severely restrict the number of DDOA measurement combinations evaluated, which might negatively impact on the ability of the TALA to subsequently detect and localise the target events.
where \(\sigma _{\tau } \triangleq \sqrt {2}c\sigma _{t}\) is the DDOA measurement error standard deviation; and γ≥0 is a prespecified multiplier. If γ≫1, DDOA measurements that do not satisfy Eq. (34) are likely to have been calculated from TOA measurements generated by different targets, although Eq. (34) can also be violated if TOA measurement errors are abnormally large.
4.3 TALA implementation
 1.
In scenarios 1–2, the TALA is implemented using the coupled AOA/DDOA measurement pairs, with the reference sensor providing only AOA measurements.
 2.
It is noted that the DDOA measurements determined for different sensors are correlated, because they exploit the same TOA measurement set generated by the reference sensor. The correlation between between the DDOA measurements at different sensors is \(c^{2}\sigma _{t}^{2}\). As a result, the matrix manipulations within the TALA cannot exploit the redundancy created had the measurement error covariance matrix Σ been (block) diagonal.
 3.
In scenarios 1 and 3, initial candidate locations are generated as the intersection of each pair of AOA measurements and the intersection of each pair of DDOA measurements. Calculating the AOA intersections is straightforward. However, calculating the DDOA intersections is more problematic, and an iterative NR approach is used. Full details are given in Appendix A.
 4.Scenario 2 is the most computationally complex because, respectively, the number of DDOA combinations that satisfy Eq. (34) is greater than in scenario 1, and the dimensionality of the concatenated measurement vector is greater than in scenario 3. As a result, for scenario 2:

Only the AOA intersections are used to generate initial candidate locations.

The correlations between the DDOA measurements are ignored (which simplifies the matrix manipulations within the TALA, e.g. see endnote 5).

 5.
In all three scenarios, in order to reduce the computational complexity of the TALA, the initial candidate locations are determined only from the intersections of measurements generated by five of the sensors.
 6.
In all three scenarios, deletion criterion 3 is used on Step 3. Therefore, the intersection deletion step only allows each AOA measurement to be exploited by one candidate location. As a result, in scenarios 1–2, the intersection deletion step must account for the fact that some AOA/DDOA measurement pairs share a common AOA measurement.
 7.
Only in scenario 3 is measurement reassociation performed during the GN gradient descent.
Summary of TALA settings
TALA component  Details 

AOA/DDOA intersections (Step 1)  Based on measurements at only five sensors, only DDOAs satisfying Eq. (34) are used, with γ=2 
NR approach to determine DDOA intersections (Step 1)  10 attempts allowed: attempt #1 initialises with the corresponding AOA intersection, subsequent attempts use random starting locations 
Measurement association (Step 2)  Gate threshold, ξ=10^{−3} (scenarios 12) gate threshold, ξ=10^{−2} (scenarios 3) 
Intersection downselection (Step 3)  Only consider intersections for which the total number of associated measurements is no smaller than N P _{ d }/2 
GN approach for ML estimation (Step 4)  Determine overall likelihood for step sizes of ±20%, ±40%, ±60%, ±80%, and ±100% of the Newton step (i.e. m=5) 
If no step increases the overall likelihood, consider a step of magnitude 200 m (i.e. =δ _{ M }) in a random direction  
Stop iterating if the procedure above has attempted a total of 20 random steps, or each component of the GNSSE F(X _{ k })^{′} Σ ^{−1}×[Z−f(X _{ k })] has a magnitude smaller than 10^{−3}  
Reassociation is only performed during gradient descent in scenario 3 
4.4 Performance evaluation
In determining the MSE values, a global nearest neighbour approach is used to pair the estimates with the true target event locations. An estimate is declared to be a successful detection if the absolute distance error of the estimate is less than 10 times the CRLB location RMSE for that event, otherwise the estimate is declared to be a false event.
Summary of the TALA geolocation performance for scenario 1
TALA (0% exclusions)  TALA (1% exclusions)  Events  P _{ d }  

%E  #FE  RMSE  % ↑ gTALA  % ↑ CRLB  RMSE  % ↑ gTALA  % ↑ CRLB  
98.10  0.00  216.98  2.80  7.72  195.97  2.36  0.78  1  1.0 
98.40  0.00  238.12  2.72  14.92  206.67  2.76  1.72  2  1.0 
97.77  0.00  232.70  3.01  13.87  197.37  3.31  1.54  3  1.0 
98.13  0.00  239.33  6.25  18.18  214.38  5.95  7.97  4  1.0 
98.06  0.00  227.99  5.50  12.77  200.64  4.65  1.25  5  1.0 
97.95  0.00  226.04  5.20  10.06  198.73  4.53  1.34  6  1.0 
98.17  0.00  231.29  5.48  13.60  203.29  5.17  1.83  7  1.0 
97.99  0.00  234.62  3.84  14.51  201.89  4.46  0.46  8  1.0 
98.12  0.00  231.39  6.28  13.25  202.37  5.91  0.97  9  1.0 
98.14  0.01  230.68  5.62  13.69  198.47  5.60  0.19  10  1.0 
96.80  0.00  256.88  7.90  19.27  220.50  7.01  4.92  1  0.9 
97.20  0.00  247.17  4.10  12.19  220.18  6.73  2.10  2  0.9 
97.23  0.00  248.38  5.54  14.06  215.66  5.39  1.35  3  0.9 
96.53  0.00  255.22  4.76  18.13  222.20  4.94  5.06  4  0.9 
96.84  0.00  263.92  9.34  22.73  222.88  6.10  5.89  5  0.9 
97.28  0.00  255.65  6.46  16.71  222.66  6.85  3.83  6  0.9 
96.80  0.00  261.96  6.25  20.74  223.58  6.88  5.28  7  0.9 
96.78  0.01  256.22  8.48  17.31  223.52  8.00  4.59  8  0.9 
97.14  0.00  247.81  5.32  13.90  221.65  5.83  4.09  9  0.9 
96.91  0.01  250.97  7.88  16.14  217.35  7.57  2.86  10  0.9 
94.30  0.00  251.86  6.68  9.02  231.15  7.78  2.70  1  0.8 
94.65  0.00  278.05  6.17  17.02  236.68  5.41  1.91  2  0.8 
94.97  0.00  278.78  5.58  18.50  241.75  7.93  5.44  3  0.8 
94.90  0.00  281.74  8.78  21.92  240.55  6.93  6.52  4  0.8 
95.14  0.01  279.13  6.49  20.70  240.08  6.44  6.26  5  0.8 
95.22  0.01  273.00  4.20  16.35  234.65  5.16  2.24  6  0.8 
94.76  0.01  291.93  10.05  25.12  239.95  7.45  5.25  7  0.8 
94.46  0.01  281.12  6.25  19.67  236.85  7.05  3.26  8  0.8 
93.99  0.01  285.59  7.74  22.04  236.52  6.47  3.60  9  0.8 
93.47  0.02  280.47  7.25  20.47  237.02  7.32  4.36  10  0.8 
TALA average computational time, and the average number of candidate locations at the end of each step of the TALA, for scenario 1
TALA  Average number of candidate positions  Events  P _{ d }  

run time  Step 1  Step 3  Step 3  Step 3  Step 4  Step 5  
(s)  (crit 1)  (crit 2)  (crit 3)  
0.01  20.01  8.63  4.35  0.98  0.98  0.98  1  1.0 
0.04  50.19  18.31  9.07  1.97  1.97  1.97  2  1.0 
0.05  90.41  28.47  14.16  2.94  2.94  2.93  3  1.0 
0.11  146.74  39.78  19.62  3.94  3.94  3.93  4  1.0 
0.19  217.19  53.06  25.81  4.92  4.92  4.90  5  1.0 
0.29  295.72  67.31  32.21  5.90  5.90  5.88  6  1.0 
0.41  392.83  79.28  38.40  6.90  6.90  6.87  7  1.0 
0.61  489.83  95.09  45.99  7.87  7.87  7.84  8  1.0 
0.77  613.30  109.80  52.78  8.87  8.87  8.84  9  1.0 
1.03  747.38  127.43  61.14  9.85  9.85  9.82  10  1.0 
0.02  17.09  7.04  3.53  0.97  0.97  0.97  1  0.9 
0.02  41.22  14.80  7.50  1.95  1.95  1.94  2  0.9 
0.07  76.86  23.16  11.84  2.92  2.92  2.92  3  0.9 
0.13  120.39  32.24  16.36  3.88  3.88  3.86  4  0.9 
0.18  177.15  42.50  21.23  4.87  4.87  4.84  5  0.9 
0.23  242.85  54.03  26.81  5.86  5.86  5.84  6  0.9 
0.35  319.59  63.91  31.86  6.81  6.81  6.78  7  0.9 
0.47  393.38  76.07  37.77  7.78  7.78  7.75  8  0.9 
0.60  494.43  88.45  43.77  8.77  8.77  8.75  9  0.9 
0.86  606.16  102.99  50.96  9.74  9.74  9.70  10  0.9 
0.02  15.21  5.65  2.96  0.95  0.95  0.94  1  0.8 
0.03  34.04  11.86  6.13  1.90  1.90  1.90  2  0.8 
0.04  60.84  18.28  9.58  2.86  2.86  2.85  3  0.8 
0.10  98.99  25.73  13.55  3.81  3.81  3.80  4  0.8 
0.16  144.13  34.58  18.10  4.78  4.78  4.76  5  0.8 
0.22  195.82  44.28  22.70  5.74  5.74  5.72  6  0.8 
0.29  254.63  51.31  26.48  6.68  6.68  6.64  7  0.8 
0.40  320.04  61.82  31.65  7.61  7.61  7.57  8  0.8 
0.50  393.89  71.18  36.43  8.50  8.50  8.47  9  0.8 
0.67  470.19  81.29  41.61  9.39  9.39  9.36  10  0.8 
Summary of the TALA geolocation performance for scenario 2
TALA (0% exclusions)  TALA (1% exclusions)  Events  P _{ d }  

%E  #FE  RMSE  % ↑ gTALA  % ↑ CRLB  RMSE  % ↑ gTALA  % ↑ CRLB  
98.20  0.00  221.55  4.97  9.99  199.36  4.13  0.93  1  1.0 
98.40  0.00  240.13  3.59  15.89  208.14  3.49  2.44  2  1.0 
97.67  0.00  235.85  4.40  15.41  198.36  3.83  1.05  3  1.0 
98.02  0.00  240.26  6.67  18.65  214.88  6.20  8.23  4  1.0 
97.72  0.00  227.59  5.31  12.57  203.19  5.98  2.54  5  1.0 
97.73  0.00  230.52  7.29  12.24  202.06  6.28  0.32  6  1.0 
97.86  0.00  233.17  6.34  14.53  204.34  5.71  2.35  7  1.0 
97.75  0.00  236.42  4.63  15.39  203.31  5.19  1.17  8  1.0 
97.83  0.00  235.20  8.03  15.11  204.10  6.82  1.83  9  1.0 
97.76  0.00  235.39  7.78  16.02  202.92  7.96  2.04  10  1.0 
96.60  0.00  261.04  9.65  21.20  222.55  8.01  5.89  1  0.9 
97.20  0.00  248.90  4.82  12.97  221.57  7.40  2.75  2  0.9 
97.00  0.00  250.68  6.52  15.11  219.06  7.06  2.95  3  0.9 
96.60  0.00  260.54  6.95  20.60  227.29  7.34  7.47  4  0.9 
96.50  0.01  262.33  8.68  21.99  225.08  7.15  6.94  5  0.9 
97.08  0.00  259.16  7.92  18.31  224.81  7.88  4.84  6  0.9 
96.49  0.00  264.01  7.08  21.68  226.14  8.10  6.49  7  0.9 
96.38  0.01  262.57  11.17  20.22  227.18  9.76  6.30  8  0.9 
96.66  0.01  253.79  7.86  16.65  226.42  8.10  6.33  9  0.9 
96.25  0.01  257.98  10.90  19.39  221.94  9.84  5.04  10  0.9 
94.30  0.00  251.48  6.52  8.85  232.14  8.24  3.14  1  0.8 
94.45  0.01  284.93  8.80  19.91  238.50  6.22  2.69  2  0.8 
95.00  0.00  285.47  8.11  21.34  246.61  10.10  7.56  3  0.8 
94.55  0.00  287.55  11.02  24.43  244.97  8.90  8.48  4  0.8 
94.74  0.01  289.19  10.32  25.05  239.86  6.35  6.17  5  0.8 
94.87  0.01  277.23  5.81  18.15  238.06  6.69  3.72  6  0.8 
94.34  0.01  290.23  9.41  24.39  243.57  9.08  6.84  7  0.8 
94.03  0.02  290.22  9.69  23.54  241.85  9.31  5.43  8  0.8 
93.38  0.02  288.33  8.77  23.21  240.69  8.35  5.42  9  0.8 
92.60  0.02  289.14  10.56  24.19  240.79  9.03  6.02  10  0.8 
TALA average computational time, and the average number of candidate locations at the end of each step of the TALA, for scenario 2
TALA  Average number of candidate positions  Events  P _{ d }  

run time  Step 1  Step 3  Step 3  Step 3  Step 4  Step 5  
(s)  (crit 1)  (crit 2)  (crit 3)  
0.01  20.60  8.14  4.00  0.98  0.98  0.98  1  1.0 
0.01  53.16  17.36  8.36  1.97  1.97  1.97  2  1.0 
0.02  95.94  27.17  13.19  2.94  2.94  2.93  3  1.0 
0.07  157.20  38.03  18.28  3.94  3.94  3.92  4  1.0 
0.14  224.86  50.44  23.96  4.91  4.91  4.89  5  1.0 
0.23  303.82  63.97  29.81  5.89  5.89  5.87  6  1.0 
0.42  397.65  75.00  35.38  6.88  6.88  6.85  7  1.0 
0.63  494.44  90.18  42.58  7.85  7.85  7.82  8  1.0 
0.98  602.77  103.05  48.20  8.84  8.84  8.81  9  1.0 
1.53  731.13  119.31  55.76  9.81  9.81  9.78  10  1.0 
0.00  17.70  6.64  3.24  0.97  0.97  0.97  1  0.9 
0.01  44.37  14.07  6.96  1.95  1.95  1.94  2  0.9 
0.02  82.47  22.38  11.20  2.92  2.92  2.91  3  0.9 
0.05  129.90  31.09  15.43  3.88  3.88  3.87  4  0.9 
0.11  186.77  41.34  20.24  4.85  4.85  4.83  5  0.9 
0.20  253.62  52.50  25.55  5.85  5.85  5.83  6  0.9 
0.34  330.56  62.03  30.28  6.79  6.79  6.76  7  0.9 
0.49  406.79  74.07  36.12  7.75  7.75  7.72  8  0.9 
0.73  500.82  85.82  41.60  8.72  8.72  8.70  9  0.9 
1.08  603.86  99.32  48.15  9.68  9.68  9.64  10  0.9 
0.00  15.82  5.38  2.77  0.95  0.95  0.94  1  0.8 
0.01  37.45  11.43  5.76  1.90  1.90  1.89  2  0.8 
0.01  68.19  17.84  9.18  2.87  2.87  2.85  3  0.8 
0.02  110.12  25.08  13.02  3.80  3.80  3.79  4  0.8 
0.09  158.49  33.88  17.42  4.76  4.76  4.74  5  0.8 
0.16  213.10  43.44  21.94  5.72  5.72  5.70  6  0.8 
0.24  273.47  50.27  25.60  6.65  6.65  6.61  7  0.8 
0.39  340.90  60.32  30.59  7.58  7.58  7.54  8  0.8 
0.52  415.07  69.45  35.09  8.45  8.45  8.42  9  0.8 
0.76  495.93  79.54  40.03  9.31  9.31  9.28  10  0.8 
Summary of the TALA geolocation performance for scenario 3
TALA (0% exclusions)  TALA (1% exclusions)  Events  P _{ d }  

%E  #FE  RMSE  % ↑ gTALA  % ↑ CRLB  RMSE  % ↑ gTALA  % ↑ CRLB  
98.80  0.00  322.48  1.35  13.32  288.98  2.88  3.74  1  1.0 
97.95  0.00  345.15  0.13  17.89  297.41  2.14  3.58  2  1.0 
97.07  0.01  361.52  5.67  25.05  290.89  3.33  2.52  3  1.0 
95.23  0.01  366.09  10.33  27.86  307.61  6.49  9.54  4  1.0 
94.52  0.01  379.98  9.55  32.95  310.85  9.98  10.97  5  1.0 
93.05  0.01  387.99  13.53  33.68  317.57  12.24  11.60  6  1.0 
93.01  0.02  390.64  10.55  35.78  313.90  10.25  11.27  7  1.0 
91.60  0.02  386.88  13.69  33.54  309.56  10.31  8.95  8  1.0 
91.17  0.03  406.21  16.30  40.65  325.19  11.81  14.79  9  1.0 
89.81  0.03  376.56  13.63  31.32  315.84  13.47  12.36  10  1.0 
98.10  0.00  386.89  6.51  24.38  320.99  6.38  6.05  1  0.9 
96.10  0.01  401.60  3.73  26.66  330.65  5.99  6.90  2  0.9 
95.63  0.01  394.15  1.23  25.29  327.46  3.16  7.42  3  0.9 
93.13  0.02  399.20  6.69  28.96  326.57  8.49  8.00  4  0.9 
92.18  0.01  421.33  6.91  36.20  339.06  6.76  12.38  5  0.9 
89.65  0.03  423.84  13.28  34.23  341.83  10.26  11.17  6  0.9 
90.30  0.03  446.99  17.38  43.35  350.90  12.17  15.52  7  0.9 
88.42  0.03  431.47  13.49  37.18  345.19  12.75  12.70  8  0.9 
87.40  0.04  453.87  19.29  44.99  360.63  15.51  18.17  9  0.9 
86.34  0.04  456.16  16.64  46.35  353.35  17.47  16.77  10  0.9 
94.00  0.01  421.12  5.11  23.97  359.77  4.31  10.18  1  0.8 
94.15  0.02  464.01  6.32  33.56  366.50  6.98  9.12  2  0.8 
91.73  0.02  473.74  11.72  36.06  377.14  9.41  12.75  3  0.8 
90.22  0.03  492.75  14.66  45.12  381.17  13.08  15.81  4  0.8 
88.86  0.04  504.91  12.79  47.65  392.40  13.57  18.91  5  0.8 
86.60  0.05  479.99  5.59  38.64  385.92  9.54  15.16  6  0.8 
86.80  0.06  486.42  20.15  41.21  382.79  15.62  15.09  7  0.8 
85.00  0.05  522.25  15.20  50.37  397.93  14.58  18.81  8  0.8 
83.92  0.07  506.22  11.31  47.08  401.54  17.14  20.90  9  0.8 
83.08  0.08  524.07  15.39  52.56  404.82  19.72  22.49  10  0.8 
where T _{ E } is the total number of events across the 1000 simulations, and N _{ FE } is the total number of false events declared across the 1000 simulations.
4.5 Simulation results
TALA average computational time, and the average number of candidate locations at the end of each step of the TALA, for scenario 3
TALA  Average number of candidate positions  Events  P _{ d }  

run time  Step 1  Step 3  Step 3  Step 3  Step 4  Step 5  
(s)  (crit 1)  (crit 2)  (crit 3)  
0.01  55.53  10.05  5.04  1.01  1.01  0.99  1  1.0 
0.01  97.69  22.35  11.86  2.01  1.99  1.96  2  1.0 
0.04  149.39  35.80  20.03  3.00  2.98  2.92  3  1.0 
0.03  215.67  53.84  31.83  3.94  3.92  3.82  4  1.0 
0.08  284.31  76.63  47.35  4.91  4.88  4.74  5  1.0 
0.12  368.60  102.52  65.49  5.83  5.79  5.59  6  1.0 
0.17  463.94  130.97  86.62  6.77  6.72  6.53  7  1.0 
0.24  563.94  171.32  116.61  7.69  7.63  7.35  8  1.0 
0.33  674.47  213.64  149.62  8.62  8.55  8.24  9  1.0 
0.43  803.40  267.18  191.98  9.48  9.40  9.01  10  1.0 
0.01  52.12  8.24  4.18  1.02  1.01  0.98  1  0.9 
0.02  89.31  17.86  9.72  1.99  1.96  1.93  2  0.9 
0.02  134.80  28.85  16.10  2.96  2.93  2.88  3  0.9 
0.04  187.96  42.65  25.40  3.88  3.83  3.74  4  0.9 
0.04  247.24  60.20  37.14  4.81  4.75  4.62  5  0.9 
0.13  318.68  79.85  51.03  5.67  5.58  5.40  6  0.9 
0.17  396.73  102.12  67.94  6.61  6.53  6.35  7  0.9 
0.24  476.01  129.76  88.87  7.46  7.38  7.11  8  0.9 
0.31  571.35  163.07  114.19  8.30  8.20  7.91  9  0.9 
0.41  674.19  204.32  147.04  9.18  9.07  8.67  10  0.9 
0.01  50.18  8.90  5.22  1.21  1.18  0.95  1  0.8 
0.01  81.14  19.47  11.79  2.18  2.14  1.90  2  0.8 
0.01  116.63  31.50  20.02  3.11  3.04  2.77  3  0.8 
0.03  162.80  48.00  31.80  4.05  3.97  3.64  4  0.8 
0.05  214.78  71.33  48.32  4.94  4.85  4.48  5  0.8 
0.11  272.45  95.83  66.88  5.82  5.70  5.25  6  0.8 
0.17  330.48  122.64  87.85  6.74  6.59  6.13  7  0.8 
0.20  401.28  160.11  116.92  7.60  7.45  6.85  8  0.8 
0.27  477.67  201.82  149.49  8.40  8.26  7.63  9  0.8 
0.36  564.86  250.12  188.52  9.28  9.11  8.38  10  0.8 
Firstly, in Fig. 4 and Table 3, the estimation accuracy of the TALA is shown for scenario 1. Estimation performance is similar to both the gTALA performance and the optimistic CRLB. Indeed, the RMSEs of the TALA and gTALA typically differ by less than 10%, indicating that the TALA is extremely good and making the correct associations of measurements to target events. In fact, the TALA makes the correct measurementtotarget association over 93% of the time in this scenario. Furthermore, the RMSE of the TALA is typically within 10–20% of the CRLB. When outliers are removed from the analysis, differences in performance are even smaller, with the TALA RMSE typically around 5% greater than both the gTALA RMSE and the CRLB. The TALA is able to identify and geolocate 93–98% of the target events (see column 1 in Table 3). Moreover, the average number of false events declared (i.e. estimates that are too geographically distant from a true target event to be considered to be detection/localisation of an event) is negligible (see column 2 in Table 3).
Table 4 shows the average computational time of the TALA for scenario 1. It is observed that for single events, the TALA provides almost instantaneous estimates. As the number of target events increases, the algorithm runtime increases exponentially, primarily because the number of AOA and DDOA intersections that have to be computed and manipulated increases exponentially (see column 2). Nevertheless, the algorithm is still able to provide estimates of the geolocations of up to 10 target events in around 1 s.
 1.
The geolocation performance of the TALA again compares well with the gTALA and the CRLB (see Fig. 5 and Table 5), with a degradation in geolocation performance of just a few percent compared to scenario 1.
 2.
The TALA again detects 93–98% of the target events (see column 1 of Table 5).
 3.
The average number of false events declared is again negligible (see column 2 of Table 5).
 4.
The additional complexity of the data association problem has been negated by the changes to the TALA. As a result, in the most complex cases (i.e. with 10 target events), the TALA runtime remains less than 2 s (see Table 6).
In Fig. 6 and Tables 7 and 8, the performance of the TALA is shown for scenario 3. This is the most difficult scenario, because in addition to target events occurring simultaneously, each sensor provides only AOA or TOA measurements, and not hybrid AOA/TOA measurements. This makes measurement association more problematic. For this reason, measurement reassociation is performed on each iteration of the gradient descent algorithm, following the procedure described in Section 2.6.3. However, the reduced size of the concatenated measurement vector, as a result of the reduction in the dimensionality of each measurement, does not necessitate the computational adjustments to the TALA that were required for scenario 2.
In scenario 3, the geolocation performance of the TALA again compares well with the gTALA and the CRLB (see Fig. 6 and Table 7), although indicative of the more difficult scenario, percentage differences in performance are greater than previously. To elaborate, the RMSEs of the TALA and gTALA typically differ by 10–20%, with the RMSE of the TALA typically 20–50% greater than the CRLB. When outliers are removed from the analysis, differences in performance are significantly reduced, with the TALA RMSE typically within 20% of both the gTALA RMSE and the CRLB. The TALA detects 83–99% of the target events (see column 1 of Table 7), whilst the average number of false events remains extremely low (see column 2 of Table 7). The reduced computational complexity of the algorithm, as a result of the reduction in the dimensionality of each concatenated measurement vector, enables the TALA to generate estimates in the most complex scenarios in less than 0.5 s (see Table 8).
In all three scenarios, the performance of the TALA was sensitive to the gate threshold ξ. Setting the value of ξ too high can increase the proportion of incorrect associations. This is particularly true in scenarios for which P _{ d }<1, in which case there is an increased likelihood that a false measurement will be associated with a candidate location whenever a sensor fails to make a target detection. Conversely, setting the value of ξ too low can result in targetgenerated measurements failing to be gated. Via extensive experimentation in all three scenarios, threshold values in the range 10^{−3} – 10^{−2} were shown to result in near optimal performance. This is equivalent to gating the measurement Mahalanobis distance with a threshold g in the range 3.0–3.7.
The performance of the TALA was also assessed for both closely spaced and well separated emitters, and the results are similar to those presented herein, with only a few percent difference in the resulting RMSE, %E, and #FE values. Additionally, a NewtonRaphson (NR) approach (e.g. [25]) was implemented in order to perform the gradient descent within the TALA. The NR approach had similar performance to the GN approach, with the exception that the computational expense of the NR algorithm was greater, as a result of the requirement to calculate secondorder derivative terms.
5 Discussion
There is a tradeoff between the runtime and the performance of the TALA. Adjustments that reduce the runtime, such as reducing the initial number of candidate locations (e.g. by not considering all measurement intersections), ignoring the correlations between DDOA measurements (e.g. to simplify the matrix manipulations in the gradient descent), and more quickly reducing the number of candidate locations (e.g. by performing downselection on Step 3), can each reduce the proportion of emitters detected, although performance degradation is not significant. Furthermore, performing measurement reassociation during gradient descent can improve the TALA performance, particularly if measurement errors are large or the sensors provide only limited information (e.g. AOA measurements only), rather than hybrid measurements. However, measurement reassociation also increases the computational expense of the TALA.
Deciding when it is necessary to make computational simplifications can be performed “onthefly”, based on the number of measurements generated within the time window under consideration. A larger number of measurements may indicate a large number of emitters and/or signals that are closely spaced in time, which may then necessitate computational savings. Of course, the algorithmic complexity that can be afforded depends on the timecriticality of the application, specifically whether the commander requires the processing to be performed almost instantaneously (e.g. in order to immediately perform a retaliatory strike), or whether a longer processing time can be tolerated (e.g. when conducting postevent analysis).
6 Future work
 1.
To remind the reader, the TALA implementation herein requires that three heuristic parameters be set, these being (i): ξ∈[0,1] in Eq. (3), (ii): μ∈[0,1] used in deletion criterion 1 on Step 3, and (iii): γ>0 in Eq. (34). The performance of the TALA is also dependent on the measurement errors (i.e. σ _{ θ } and σ _{ t } in the focal simulations). It would be interesting to analyse the performance of the TALA as a function of these parameters, in order to determine optimal values for the heuristic parameters as a function of the measurement errors. Such an analysis may offer valuable insight into how to optimise the performance of the TALA across a broad range of operational scenarios.
 2.
The performance of the TALA was compared to both the CRLB [23] and the performance of a “genie” TALA that exploited the true measurementtotarget associations. It would be interesting to compare the performance of the TALA to that of existing methods developed for specific applications, most notably the approaches of [2, 10, 19, 20] developed for multitarget localisation using TOA measurements and the approaches of [4, 5, 11, 12]) developed in order to localise a single emitter using hybrid AOA/TDOA measurements.
 3.
The TALA implementation introduced herein implicitly assumes that the measurement error standard deviations are known. Extensive field testing of a prototype system may enable accurate error statistics to be determined, making this a valid assumption. In cases for which field testing is not practicable, or in extended operating conditions, measurement error standard deviations may not be accurately known. In such cases, careful setting of the standard deviations within the TALA is required. Setting values too small (i.e. being overally optimistic as to the accuracy of each measurement) may inhibit data association, resulting in valid measurements being discarded. Conversely, setting values too high may fail to fully exploit accurate measurements. Analysis of this tradeoff is left for future work.
7 Conclusions
In this paper, a novel target acquisition and localisation algorithm (TALA) has been introduced that offers a capability for detecting and localising an unknown number of targets using the intermittent “signalsofopportunity” they generate (e.g. “events” such as acoustic impulses or radio frequency transmissions). The TALA is a batch estimator, and its novelty lies in the mechanism by which it circumnavigates the need to perform global multisensor/multitarget data association (e.g. as necessary in [20]), which can be a computationally prohibitive combinatorial optimisation (e.g. see [22]). As a result, the TALA is able to maintain computational feasibility, even for large scale problems. Specifically, the TALA maintains a set of hypothesised target locations, and performs nearest neighbour data association on a measurementbymeasurement basis, allowing each measurement to be associated with more than one hypothesised target location. The algorithm then determines maximum likelihood estimates of potential target locations, before a final downselection step ensures that each measurement is associated with no greater than one estimate.
The performance of the TALA is demonstrated for simulated scenarios with a network of 20 sensors and up to 10 targets. The sensors generate angleofarrival (AOA), timeofarrival (TOA), or hybrid AOA/TOA measurements. Both simultaneous and nonsimultaneous target events are considered, though clearly simultaneous events are more challenging, as the problem of resolving the association of measurements to events has greater ambiguity.
For nonsimultaneous events, and with homogeneous sensors providing hybrid AOA/TOA measurements, the target localisation errors of the TALA are typically within 10–20% of an optimistic CramérRao lower bound (CRLB) that ignores the multitarget data association problem. A better comparison shows that the localisation errors of the TALA are typically within 10% of the errors generated by a “genie” algorithm that is given the correct measurementtotarget associations. Percentage differences in performance are reduced when a small percentage (i.e. 1%) of outliers are removed from the comparisons, with the TALA RMSE typically then around 5% greater than both the gTALA RMSE and the CRLB. For simultaneous events, again with sensors providing hybrid AOA/TOA measurements, there is only a few percent degradation in geolocation performance compared to the case of nonsimultaneous events. In both cases, the TALA successfully detect 93–98% of the targets, with virtually no false targets declared.
In the most difficult scenarios considered, with simultaneous events, and heterogeneous sensors providing either AOA or TOA measurements, the TALA continues to perform well in comparison to the gTALA and the optimistic CRLB. To elaborate, in this case, the RMSEs of the TALA and gTALA typically differ by 10–20%, with the RMSE of the TALA typically 20–50% greater the CRLB. Again, when outliers are removed from the analysis, differences in performance are reduced significantly, with the TALA RMSE typically within 20% of the CRLB. The TALA detects 83–99% of the target events, whilst the average number of false events remains extremely low.
The computational expense of the TALA is shown to remain manageable as the number of targets increases. This allows the approach to be implemented in challenging timecritical scenarios, such as in the localisation of artillery firing events, for which there may be only a small window of opportunity in which to perform a retaliatory strike. It is concluded that the TALA provides a powerful situational awareness aid for passive surveillance operations.
8 Endnotes
^{1} This is a common assumption in target state estimation problems (e.g. see [22]). For scenarios in which this assumption is violated, there are two options; either (i) a Gaussian approximation can be made or (ii) the likelihood functions and ML estimation approach within the TALA be modified in order to correctly account for the change in the measurement model.
^{2} The maximum value of the individual likelihood is \(l_{i}(\max) = \text {det}(\boldsymbol {\Sigma }_{i})^{1/2}/(2\pi)^{d_{i}/2}\).
^{3} Via experimentation, likelihood threshold values ξ in the range 10^{−3} – 10^{−2} were shown to generate excellent results.
^{4} The GNSSE is the \({\mathbb R}^{3}\) vector: F(X _{ k })^{′} Σ ^{−1}[Z−f(X _{ k })]. At the ML estimate, the GNSSE has a value of 0.
where \(\boldsymbol {F}_{i}(\boldsymbol {X}_{k})'\triangleq \nabla _{\boldsymbol {X}_{k}}\boldsymbol {f}(\boldsymbol {X}_{k};i)'\). The complexity of the calculation of (41) is of order \({\mathcal O}(N_{a})\). However, the calculation of F(X _{ k })^{′} Σ ^{−1}[Z−f(X _{ k })] using the full Hessian matrix F(X _{ k }) (given in Eq. (20)) and the full measurement error covariance matrix Σ (given in Eq. (13)) has complexity \({\mathcal O}(N_{a}^{3})\).
9 Appendix A: Determining the AOA and DDOA measurement intersections
9.1 AOA intersections
It is noted that Eqs. (42) – (43) will always output a value provided that the AOA measurements are not parallel (i.e. provided that θ(1)≠θ(2) and θ(1)≠(θ(2)±π)). This is true even if the AOA measurements diverge, in which case the coordinates provided by Eqs. (42) – (43) will be in the opposite direction to at least one of the two measurements. Therefore, the point (x _{ I },y _{ I }) is only accepted as a valid intersection if \(\theta (i) = \tan ^{1}\left ((y_{I}y_{S_{i}})/(x_{I}x_{S_{i}})\right)\) for i=1,2.
9.2 DDOA intersections
A maximum of 100 iterations of the NR approach are performed, and convergence to the DDOA intersection is assumed to have occurred if, on any iteration, the x and y coordinate location increments each have a magnitude smaller than 10^{−7}. However, the NR approach is not guaranteed to converge to the intersection, and when divergence occurs, further attempts are made to determine the DDOA intersection by reinitialising the NR approach at a location randomly generated within the surveillance region. In the simulations presented herein, up to nine attempts are made using randomly generated initial locations.
Declarations
Competing interests
The author declares that he/she has no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 R Kaune, D Mušicki, W Koch, in Sensor Fusion and its Applications, ed. by C Thomas. On Passive Emitter Tracking in Sensor Networks (INTECHRijeka, 2010), pp. 293–318.Google Scholar
 G Simon, M Maróti, Á Lédeczi, G Balogh, B Kusy, A Nádas, G Pap, J Sallai, K Frampton, in Proceedings of the ACM 2nd International Conference on Embedded Networked Sensor Systems. Sensor NetworkBased Countersniper System (ACMNew York, 2004), pp. 1–12.View ArticleGoogle Scholar
 S Harman, V Calloway, N Wallace, A Hume, D Beale, in Proceedings of the IEEE Aerospace Conference, vol. 3. Sensor Network Performance Modeling for Weapon Locating (IEEEBig Sky, 2004).Google Scholar
 L Cong, W Zhuang, Hybrid TDOA/AOA mobile user location for wideband CDMA cellular systems. IEEE Trans.Wirel. Commun. 1(3), 439–447 (2002).View ArticleGoogle Scholar
 KW Cheung, MC So, WK Ma, YT Chan, in EURASIP Journal on Applied Signal Processing. A constrained least squares approach to mobile positioning: algorithms and optimality (Hindawi Publishing CorporationNew York, 2006), pp. 1–23.Google Scholar
 D Mennitt, M Johns, Multiplearray passive acoustic source localization in urban environments. J. Acoust. Soc. Am.127(5), 2932–2942 (2010).View ArticleGoogle Scholar
 K Pine, ME Evans, K Sammut, F He, in Proceedings of the 5th Asian Control Conference, vol. 2. Radio direction finding for maritime search and rescue (IEEEMelbourne, 2004), pp. 723–730.Google Scholar
 R Stansfield, Statistical Theory of DF Fixing. J. IEE IIIA Radiocommunication. 94(15), 762–770 (1947).MathSciNetGoogle Scholar
 Y BarShalom, X Li, T Kirubarajan, Estimation with Applications to Tracking and Navigation (John Wiley and Sons Inc., New York, 2001).View ArticleGoogle Scholar
 S Venkateswaran, U Madhow, Localizing multiple events using times of arrival: a parallelized, hierarchical approach to the association problem. IEEE Trans. Signal Proc. 60(10), 5464–5477 (2012).MathSciNetView ArticleGoogle Scholar
 A Urruela, A PagesZamora, J Riba, in IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), vol. 4. Divideandconquer based closedform position estimation for AOA and TDOA measurements (IEEEToulouse, 2006).Google Scholar
 AN Bishop, B Fidan, K Doǧançay, BDO Anderson, PN Pathirana, in Signal Processing, vol. 88. Exploiting geometry for improved hybrid AOA/TDOA based localization (ElsevierAmsterdam, 2008), pp. 1775–1791.Google Scholar
 X Sheng, YH Hu, Maximum likelihood multiplesource localization using acoustic energy measurements with wireless sensor networks. IEEE Trans. Signal Proc. 53(1), 44–53 (2005).MathSciNetView ArticleGoogle Scholar
 BK Chalise, YD Zhang, MG Amin, B Himed, Target localization in a multi static passive radar system through convex optimization. Sig. Proc. 102:, 207–215 (2014).View ArticleGoogle Scholar
 M Alam, K Jamil, in IEEE Radar Conference. Maximum likelihood (ML) based localization algorithm for multistatic passive radar using rangeonly measurements (IEEEJohannesburg, 2015), pp. 180–184.Google Scholar
 K Yang, G Wang, ZQ Luo, Efficient convex relaxation methods for robust target localization by a sensor network using time differences of arrivals. IEEE Trans. Sig. Proc.57(7), 2775–2784 (2009).MathSciNetView ArticleGoogle Scholar
 HWL Naus, CV van Wijk, Simultaneous localisation of multiple emitters. IEE Proc. Radar Sonar Navig. 151(2), 65–70 (2004).View ArticleGoogle Scholar
 AN Bishop, PN Pathirana, Localization of emitters via the intersection of bearing lines: a ghost elimination approach. IEEE Trans. Veh. Technol. 56(5), 3106–3110 (2007).View ArticleGoogle Scholar
 Y Lee, TS Wada, BH Juang, in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 10). Multiple acoustic source localization based on multiple hypotheses testing using particle approach (IEEEDallas, 2010), pp. 2722–2725.Google Scholar
 H Shen, Z Ding, S Dasgupta, C Zhao, Multiple source localization in wireless sensor networks based on time of arrival measurement. IEEE Trans. Sig. Proc.62(8), 1938–1949 (2014).MathSciNetView ArticleGoogle Scholar
 S Blackman, R Popoli, Design and Analysis of Modern Tracking Systems (Artech House, Norwood, Massachusets, 1999).MATHGoogle Scholar
 Y BarShalom (ed.), MultitargetMultisensor Tracking: Advanced Applications (Artech House, Norwood, Massachusets, 1990).Google Scholar
 H Van Trees, Detection, Estimation, and Modulation Theory (John Wiley and Sons Inc., New York, 1968).MATHGoogle Scholar
 A Björck, Numerical Methods for Least Squares Problems (Society for Industrial and Applied Mathematics, Philadelphia, 1996).View ArticleMATHGoogle Scholar
 WH Press, SA Teukolsky, WT Vetterling, BP Flannery, Numerical Recipes in C, The Art of Scientific Computing, 2nd edn (Cambridge University Press, New York, 1992).MATHGoogle Scholar
 K Levenberg, A method for the solution of certain nonlinear problems in least squares. Q. Appl. Math.2:, 164–168 (1944).MathSciNetView ArticleMATHGoogle Scholar
 DW Marquardt, An algorithm for leastsquares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 1(2), 431–441 (1963).MathSciNetView ArticleMATHGoogle Scholar
 JE Cavanaugh, RH Shumway, On computing the expected Fisher information matrix for statespace model parameters. Stat. Probab. Lett. 26(4), 347–355 (1996).MathSciNetView ArticleMATHGoogle Scholar
 A Farina, B Ristic, L Timmoneri, CramérRao bound for nonlinear filtering with P _{ d }<1 and its application to target tracking. IEEE Trans. Sig. Proc. 50(8), 1916–1924 (2002).View ArticleGoogle Scholar
 ML Hernandez, B Ristic, A Farina, L Timmoneri, A comparison of two CramérRao bounds for nonlinear filtering with P _{ d }<1. IEEE Trans. Sig. Proc. 52(9), 2361–2370 (2004).View ArticleGoogle Scholar
 R Tharmarasa, T Kirubarajan, ML Hernandez, A Sinha, PCRLB Based Multisensor array management for multitarget tracking. IEEE Trans. Aerosp. Electron. Syst. 43(2), 539–555 (2007).View ArticleGoogle Scholar
 ML Hernandez, A Farina, B Ristic, PCRLB for tracking in cluttered environments: measurement sequence conditioning approach. IEEE Trans. Aerosp. Electron. Syst. 42(2), 680–704 (2006).View ArticleGoogle Scholar
 Special issue on time delay estimation. IEEE Acoust. Speech Signal Process. Newsl. 49(1), 12–12 (1980). IEEE Journals & Magazines.Google Scholar
 R Kaune, in Proceedings of the 15th International Conference on Information Fusion. accuracy studies for TDOA and TOA localization. (Singapore, 2012), pp. 408–415.Google Scholar