The following disclosure relates generally to emitter/target tracking and, more particularly, to single platform angle-based tracking of stationary or moving, earth or airborne objects.
Single platform sensor systems that only measure angle-based information, e.g., direction cosines, azimuth, and Time-Difference Of Arrival (TDOA), have limited instantaneous observability about the nature of the target being sensed. In particular, there is a limited ability to accurately determine if the target is a stationary object on the Earth's surface, a moving object on the Earth's surface, or is airborne using a single moment in time.
What is needed is a system and method to track emitters to determine their type (surface stationary, surface moving, or airborne), based on general angle information.
An embodiment provides a system for a Radio Frequency (RF) generalized angle-based tracker using only angle-based information from a target emitter source, whereby a type of the target is determined comprising a memory storing instructions which when interpreted by the processor cause the processor to perform the steps of receiving signal data from a source target emitter signal; determining angle-based information for the target emitter source from the received signal; initializing a Stationary Surface Filter (SSF), a Moving Surface Filter (MSF), and a Pseudorange Kalman Filter (PKF) with the angle-based information; scoring the SSF and MSF by the PKF, whereby if the angle-based information is associated by exceeding a likelihood ratio threshold, then update the SSF, the MSF, and the PKF; determining if at least one plausible, nonzero likelihood, Constituent Kalman Filter (CKF) exists for each of the SSF and the MSF; if at least one plausible, nonzero likelihood, CKF exists for the SSF and no CKF exists for the MSF, then classify the target as a surface-level stationary target; if at least one plausible, nonzero likelihood, CKF exists for the MSF and no CKF exists for the SSF, then classify the target as a surface-level moving target; if no plausible, nonzero likelihood, CKF exists for both the SSF and the MSF, then classify the target as an airborne moving target; if the angle-based information is not associated, due to likelihood values of zero, then receive a subsequent signal from the target emitter source and determine angle-based information for the target emitter source from the received signal, and initiate the SSF, MSF, and PKF; whereby the type of the target is determined. In embodiments the angle-based information used to initialize the SSF comprises calculating a direction cosine, as measured from a front lobe source, from the angle-based information; and parameterize a line-of-sight via:
where n is a line of sight, u1 is a single direction cosine measurement, and vn is an nth sampling of a parameterization variable. In other embodiments, the scoring of the SSF comprises extrapolating the CKFs of the SSF when a next measurement uk is received, and selecting a best scoring constituent filter. In subsequent embodiments the updating of the SSF comprises pruning by removing CKFs of the SSF with likelihood ratios below a specified threshold; and renormalizing weightings of remaining CKFs, following normalization during initialization. For additional embodiments the initialization of the MSF comprises initializing a velocity component of a covariance matrix P according to:
where smax is a maximum speed of a surface mover to be tracked, and I3 is a three dimensional identity matrix. In another embodiment, updating of the MSF comprises pruning by removing CKFs with likelihood ratios below a specified threshold. For a following embodiment updating of the MSF comprises pruning by removing drifting CKFs. In subsequent embodiments, the initialization angle-based information is an individual direction-cosine measurement, u1. In additional embodiments determining if at least one plausible CKF exists comprises calculating a CKF likelihood ratio and classifying the CKF as plausible if the likelihood ratio exceeds a threshold of 0.001.
Another embodiment provides a computer readable medium having instructions to perform the steps for a Radio Frequency (RF) generalized angle-based tracker using only angle-based information from a target emitter source, whereby a type of the target is determined comprising: receiving a source target emitter signal; determining angle-based information for the target emitter source from the received signal; initializing a Stationary Surface Filter (SSF), a Moving Surface Filter (MSF), and a Pseudorange Kalman Filter (PKF) with the angle-based information; scoring the SSF and MSF by the PKF, whereby if the angle-based information is associated by exceeding a likelihood ratio threshold, then update the SSF, the MSF, and the PKF; determining if at least one plausible, nonzero likelihood, Constituent Kalman Filter (CKF) exists for each of the SSF and the MSF; if at least one plausible, nonzero likelihood, CKF exists for the SSF and no CKF exists for the MSF, then classify the target as a surface-level stationary target; if at least one plausible, nonzero likelihood, CKF exists for the MSF and no CKF exists for the SSF, then classify the target as a surface-level moving target; if no plausible, nonzero likelihood, CKF exists for both the SSF and the MSF, then classify the target as an airborne moving target; if the angle-based information is not associated, due to likelihood values of zero, then receive a subsequent signal from the target emitter source and determine angle-based information for the target emitter source from the received signal, and initiate the SSF, MSF, and PKF; whereby the type of the target is determined. In included embodiments receiving of a signal from the target emitter source comprises constructing two baseline array vectors in y-z axes of an ownship, making angles of +30° and −30° with respect to the ownship body x-axis. In yet further embodiments the step of receiving a source target emitter signal from the target emitter source comprises maneuvering an ownship with respect to the target emitter source. In related embodiments determining angle-based information for the target emitter source from the received signal comprises no a-priori information. For further embodiments the angle-based information used to initialize the SSF comprises calculating a direction cosine, as measured from a rear lobe source, from the angle-based information; and parameterize a line-of-sight via:
where n is a line of sight, u1 is a single direction cosine measurement, and vn is an nth sampling of a parameterization variable. In ensuing embodiments initializing the MSF comprises setting a maximum speed smax, of a surface mover to be tracked, to less than 31 ms−1. For yet further embodiments, scoring of the SSF comprises selecting a best-scoring CKF of the SSF and using a Mahalanobis distance associated with that constituent filter for ellipsoidal gating. For more embodiments, determining if at least one plausible Constituent Kalman Filter (CKF) exists comprises calculating a CKF likelihood ratio and classifying the CKF as plausible if the likelihood ratio exceeds a threshold of 0.001. In continued embodiments the target is determined to be from an identified emitter type.
A yet further embodiment provides a method of signals tracking performing generalized angle-based tracking, using only angle-based information from a target emitter source, comprising receiving a source target emitter signal; determining angle-based information for the target emitter source from the received signal; initializing a Stationary Surface Filter (SSF), a Moving Surface Filter (MSF), and a Pseudorange Kalman Filter (PKF) with the angle-based information; scoring the SSF and MSF by the PKF, whereby if the angle-based information is associated by exceeding a likelihood ratio threshold, then update the SSF, the MSF, and the PKF; determining if at least one plausible, nonzero likelihood, Constituent Kalman Filter (CKF) exists for each of the SSF and the MSF; if at least one plausible, nonzero likelihood, CKF exists for the SSF and no CKF exists for the MSF, then classify the target as a surface-level stationary target; if at least one plausible, nonzero likelihood, CKF exists for the MSF and no CKF exists for the SSF, then classify the target as a surface-level moving target; if no plausible, nonzero likelihood, CKF exists for both the SSF and the MSF, then classify the target as an airborne moving target; if the angle-based information is not associated, due to likelihood values of zero, then receive a subsequent signal from the target emitter source and determine angle-based information for the target emitter source from the received signal, and initiate the SSF, MSF, and PKF; whereby a type of the target emitter source is determined. For additional embodiments, the signal is an RF signal.
Implementations of the techniques discussed above may include a method or process, a system or apparatus, a kit, or computer software stored on a computer-accessible medium. The details or one or more implementations are set forth in the accompanying drawings and the description below. Other features will be apparent from the description and drawings, and form the claims.
These and other features of the present embodiments will be understood better by reading the following detailed description, taken together with the figures herein described. The accompanying drawings are not intended to be drawn to scale. For purposes of clarity, not every component may be labeled in every drawing.
The features and advantages described herein are not all-inclusive and, in particular, many additional features and advantages will be apparent to one of ordinary skill in the art in view of the drawings, specification, and claims. Moreover, it should be noted that the language used in the specification has been selected principally for readability and instructional purposes, and not to limit in any way the scope of the inventive subject matter. The invention is susceptible of many embodiments. What follows is illustrative, but not exhaustive, of the scope of the invention.
Embodiments provide a system and method that assesses two positive hypotheses for an emitter being located on the Earth's surface (stationary or moving). If the two hypotheses are rejected, then the null hypothesis of the emitter being airborne is accepted, providing a Generalized Angle-Based Tracker (GABT). The GABT combines a Stationary Surface Filter (SSF), a Moving Surface Filter (MSF), and a Pseudorange Kalman filter (PKF) to estimate the nature of the object being tracked. The coordinate system for embodiments is the Earth-Centered Earth-Fixed (ECEF) coordinate system. This coordinate system accounts for the spheroid Earth shape, has no special handling logic at the poles or at the international dateline, allows for straightforward calculations, and is compatible with multiplatform/networked/fusion type solutions.
The Generalized Angle-based Tracker (GABT) uses the three filters mentioned above to perform tracking of the three “types” of emitters: stationary surface, moving surface, and airborne emitters using only angle-based information. For embodiments, angle-based information includes direction cosines, azimuth, and Time-Difference Of Arrival (TDOA) data. Each of these is determined as known in the art. The approach results in an estimate of which “type” given sufficient observability. Each filter, the stationary surface filter (SSF), moving surface filter (MSF), and pseudorange Kalman filter (PKF), is initialized with an angle measurement. The scoring is performed by the most general filter, the PKF. If the measurement is associated, it is used to update all three filters. “Associated” refers to a nonzero value for the likelihood ratio score of an angle-based measurement. The likelihood (or probability density function) is associated with a measurement innovation vector (discussed further later). The SSF (MSF) filter will remain active so long as the measurements are consistent with a stationary (moving) surface emitter, i.e., there is at least one plausible CKF. If either the SSF or MSF have no plausible CKFs left, then the corresponding hypothesis is rejected. The GABT does not have any interaction between the state estimates from the PKF, SSF, and MSF.
GABT embodiments will be explained starting with a review of Kalman filters and an introduction to Gaussian summation for Kalman filter (GSKF). Next is described how the GSKF can be used as a Stationary Surface Filter (SSF) to test the most rigid hypothesis of the target being at a fixed location “near” the surface of the Earth. Here, “near” refers to an approximate elevation measurement for the line-of-sight intersection with the Earth's surface of the direction cosine. Ground elevation comes from the World Geodetic System (WGS84)—the global ellipsoid model reference coordinate system for GPS established in 1984. Calculations from the ground elevation and elevation measurement determine the “height rate”. Embodiments softly enforce this “near” surface constraint using the pseudo-measurement of height-rate. For more detail, see the section on PRUNING OF “DRIFTING” CKFs, and equations 39 and 40. Furthermore, it is shown that this SSF produces an estimate of the target's location (i.e., performs geolocation) and that the errors of that estimate approach the Cramér-Rao lower bound. Continuing, the GSKF is again used, but this time to track targets that are moving on the Earth's surface; a Moving Surface Filter (MSF). This MSF formulation permits the tracking of targets constrained to motion along the Earth's surface, but does not require them to move in a straight line, i.e., the MSF follows surface targets that turn or accelerate. The null hypothesis is supported by a general angle-only state estimator that uses a pseudorange measurement. This pseudorange Kalman filter (PKF) is shown to work for tracking maneuvering airborne targets. The PKF is best supported when measurements from more than one (non-colinear) array are used to measure direction cosines. However, even if only one baseline array is measuring direction cosines, then a formulation with an approximate elevation measurement can be used with good success.
As introduced, this section reviews Kalman filters that are used for tracking emitters. While there are many references that describe in great detail the theory and intricacies of Kalman filtering, here, notation is defined and some key points are highlighted. Embodiments are limited to discrete, rather than continuous, Kalman filters.
A Kalman filter starts with a desired state (or quantity) to be estimated. The N dimensional true state vector is denoted xk, where the subscript k denotes the kth time index. The Kalman filter has an estimate of the state vector denoted by {circumflex over (x)}k. Measurements that are a function of the state vector are observed. The M dimensional true measurement vector is denoted by zk. The observation function that maps the state vector xk to the true measurement vector zk is h (·), i.e.,
z
k
=h(xk) (EQ. 1)
The true measurement is not observed, rather it is corrupted by ever present noise. The unknowable M dimensional noise vector is denoted as vk. The standard Kalman filter formulation assumes that the noise is normally distributed with zero mean and known covariance matrix Rk. Hence,
{circumflex over (z)}
k
=h(xk)+vk, where vk˜(0, Rk) (EQ. 2)
When there exists a matrix Hk such that h(xk)=Hkxk, then the observation function is linear.
The Kalman filter is designed with a model for how the state vector changes from sample k to k+1. Furthermore, the model incorporates an uncertainty, which is frequently referenced as plant noise. The state system model is then given by:
x
k+1=φ(xk)+qk (EQ. 3)
where φ(·) is some known function, and qk is a zero-mean, white Gaussian process noise with a covariance matrix Qk. When there exists a matrix Φk such that φ(xk)=Φkxk, then the state dynamics model is linear. Note that the Kalman filter model implies that both the measurement vector and the true state vector are (independent) Gaussian variables.
An important feature of the Kalman filter is that it combines measurement covariance matrices and the plant noise model to estimate a state covariance matrix, {circumflex over (P)}k. The actual state covariance matrix is given by:
Now specified is the triplet of information necessary to define a Kalman filter, chiefly a state vector estimate {circumflex over (x)} and a covariance matrix estimate {circumflex over (P)} at some time index or, more conveniently, some time stamp t. The triplet ({circumflex over (x)}, {circumflex over (P)}, t) combined with the dynamics and observation models define the Kalman filter.
Once initialized, the Kalman filter can be used to extrapolate the current estimate to a new (future) time, to score how well a measurement fits to the Kalman filter, and to update the Kalman filter with a new measurement.
The extrapolation of the estimated state vector for a linear dynamics model is just:
where the subindex k+1|k is used to indicate an extrapolation from time tk to tk+1 and the subindex k|k is used to indicate that all the information up to and including the time tk have been incorporated. Likewise, the extrapolation of the estimated covariance matrix is given by:
{circumflex over (P)}
k+1|k=Φk+1|k{circumflex over (P)}k|kΦk+1|kT+Qk+1|k· (EQ. 6)
Then given a candidate measurement at time tk−1, {circumflex over (z)}k+1, with measurement covariance matrix Rk+1, one can score how well the Kalman filter “fits” with this measurement. The measurement predicted by the Kalman filter is given by h({circumflex over (x)}k+1|k). The difference between the measurement and this prediction is called the innovation vector:
={circumflex over (z)}k+1−h({circumflex over (x)}k+1|k) (EQ. 7)
Recalling, that the measurement and the state vector are being modeled as Gaussian, then one can define an innovation covariance matrix as:
Ŝ=H{circumflex over (P)}
k+1|k
H
T
+R
k+1 (EQ. 8)
The innovation covariance matrix tells us what the expected variation in the innovation is supposed to be given both the measurement and estimated state vector covariance matrices. In particular, a statistical metric for the fit of the measurement can be defined via:
δ2=TŜ−1 (EQ. 9)
which is also known as the square of the Mahalanobis distance (smaller distance means better fit). This statistical metric is chi squared distributed with M degrees of freedom (assuming exact modeling), which means that an acceptance threshold can be set according to a desired probability for rejecting a measurement. However, this metric is not adequate when multiple Kalman filters are being evaluated as candidates for fitting a given measurement. Using the Mahalanobis distance based metric will result in a tendency to favor Kalman filters that have “large” covariance matrices. For example, consider two Kalman filters, KF1 ({circumflex over (x)}, {circumflex over (P)}, t) and KF2 ({circumflex over (x)}, 2{circumflex over (P)}, t). In this case, the Mahalanobis distance for KF2 will always be less than KF1, but intuitively this is not desired because having the same innovation with a smaller covariance indicates a better prediction and differentiation capability. Using the likelihood of the fit to compare the Kalman filters will address this issue more satisfactorily.
The likelihood (or probability density function) associated with a measurement innovation vector {tilde over (y)} is given by:
If one considers the pathological extension of the example of δ=0, which is true for both KF1 and KF2, we can see that the likelihood of KF1 is larger than the likelihood of KF2, as desired.
The likelihood of each measurement used to update a Kalman filter can be calculated and denoted as lk. Then a cumulative likelihood for the track using measurements 1 through k would be given by:
For numerical precision considerations (and for traditional notation reasons), the likelihood quantities are converted to negative log likelihood values resulting in:
The key limitation of the Kalman filter of interest for the discussion is that it is limited to representing information uncertainty that is well characterized by an ellipse (or ellipsoid). The information about an emitter located on the Earth's surface is represented (approximately) by a hyperbola when using a single angle measurement. Hence, a standard Kalman filter will do a poor job at representing this information. This motivates the introduction of the Gaussian summation of Kalman filters introduced in the subsequent section.
The limited ability of a single Kalman filter to accurately represent state information in some situations can be addressed in multiple ways. Here, an approach that discretizes the information into a set of Constituent Kalman filters that in total accurately represent the state information but individually each only represents a localized amount of information is used. This formulation is an extension of the Kalman filter in the previous section. This approach is called a Gaussian summation Kalman filter or GSKF.
To start, assume a discretization strategy has been defined that uses C Kalman filters. The discretization strategy must also define the relative weighting of each constituent Kalman filter, i.e., Constituent Kalman filter (CKF) c or KFc is defined by the quartet ({circumflex over (x)}c, {circumflex over (P)}c, tc, ωc). For simplicity, it is assumed that each CKF utilizes the same dynamics model and the time of each constituent filter tc is common. A weighted average of the CKFs can be computed to generate a single state vector and covariance matrix for output/interface purposes. The weighted average state vector is given by:
where ωc are the normalized weightings of the constituents, i.e., Σc=1cωc=1 and 0≤ωc≤1. Similarly, the weighted average covariance matrix is given by:
The weighting of the constituents can be determined by the cumulative likelihoods that belong to each CKF, i.e.:
where Lk,c denotes the cumulative likelihood of cth CKF filter up to and including the kth measurement.
The fundamental operations of a Kalman filter, extrapolation, scoring, and updating, are utilized by each CKF. For embodiments, the next section describes how the scoring of candidate measurements can be used to prune low information or inconsistent CKFs.
Now the GSKF approach is applied to the problems of state estimation and data association scoring with direction of arrival measurements for estimating the location of stationary emitters located near the Earth's surface. The GSKF will be used to specify the stationary surface filter (SSF).
Each CKF has a three dimensional state vector, {circumflex over (x)}, that corresponds to a position vector in Earth-centered Earth-fixed (ECEF) coordinates. Naturally, the state transition matrix, Φ, is the three dimensional identity matrix, I3. For the plant noise model, we use a simple constant of Q=σq2I3, where σq is some value (in meters) that represents some finite, but probably small, value for any limitations in estimating the position.
The initialization of the SSF starts with a single direction cosine measurement, u1. The cone defined by this measurement can be parameterized by the variable v, where v2≤1−u12. The parameterization space is uniformly sampled N+1 times, i.e.:
v
n=(1−u12)1/2(−1+n/N) (EQ. 20)
where n=0, 1, . . . , N. This parameterization of v results in a line-of-sight parameterization, which is given by:
For each line-of-sight, n, an intersection with the Earth's surface is determined, which is denoted as pn. For some values of n there is no intersection of the ray with the Earth surface, those samples are discarded and we are now left with C≤N samples. The parameterizations are sorted by the range from the ownship, so that r1≤r2≤ . . . ≤rc, where rc is the (slant) range from the ownship to the intersection sample pc.
We use engineering judgment and associate with each pc a measurement standard deviation of:
σv
Then, for each parameterization, an unscented transformation procedure is used to estimate a position, {circumflex over (p)}c, and covariance matrix, {circumflex over (P)}c, that belong to each respective CKF. As known to one of skill in the art of probability theory, an unscented transform is a mathematical function for estimating the result of applying a given nonlinear transformation to a probability distribution; it is characterized only in terms of a finite set of statistics. Without any reason to prefer one parameterization solution over another, we set the weights of each to be the same, i.e., ωc=1/C, for the initialization of the SSF implementation of a GSKF.
The above initialization procedure assumed that the measurement of the direction cosine was from a source that is in the “front lobe” of the antenna array, i.e., Te1>0, where em denotes a vector of zeros, except in the mth entry where there is a one. This assumption of being in the “front lobe” might not be available in some situations. If it is not, then the above procedure is repeated again for the “back lobe” hypothesis by using the same parameterization for v but using:
When the next measurement uk is received, the CKFs are extrapolated to the measurement time and scored. There are several reasonable choices for scoring, e.g., the mean or weighted average. Embodiments choose the scoring for the SSF to be that of the best scoring constituent filter and use the Mahalanobis distance associated with that constituent filter for ellipsoidal gating.
The updating of the SSF with a measurement proceeds by first examining the updated likelihoods for each CKF. The likelihood of the cth CKF after scoring the newly associated measurement k is denoted as Lk,c. The following likelihood ratio is computed:
where c* is the index of the highest CKF likelihood. Note that 0≤τk,c≤τk,c*=1. CKFs with likelihood ratios below a specified threshold (e.g., 0.001) are removed, leaving C′ CKFs. If C′ is zero, then the SSF has rejected the hypothesis that the collection of measurements associated together belongs to a single stationary emitter. Otherwise, the remaining CKFs have their associated weightings coy renormalized. Each CKF proceeds with the standard Kalman filter update calculations.
It is possible that the emitter is being observed at a very high rate and/or is slowly moving, which would result in the CKF state vector slowly drifting over time (the addition of plant noise allows this to happen). One approach to account for this is to compare the state vector of the CKF at or near initialization (denoted as {circumflex over (x)}0,c) with the current (later) state vector (denoted as {circumflex over (x)}k,c) of the same CKF. The statistical difference between these two estimates should be sufficiently small. A statistical measure of the difference is given by:
δk,c2=1/2 ({circumflex over (x)}0,c−{circumflex over (x)}k,c)T({circumflex over (P)}0,c+{circumflex over (P)}k,c)−1({circumflex over (x)}0,c−{circumflex over (x)}k,c) (EQ. 25)
where {circumflex over (P)}0,c, and {circumflex over (P)}k,c, are the estimated covariance matrices associated with state vectors {circumflex over (x)}0,c and {circumflex over (x)}k,c, respectively. If the measurements follow the stationary surface emitter model, then an approximation for the distribution of the statistical distance metric σk,c2 is a chi-squared distribution with three degrees of freedom, provided that k»0. For this distribution, we expect that σk,c2<16.2 will happen 99.9% of the time. If σk,c2>16.2, then we can discard the CKF and renormalize the weightings of the remaining CKFs.
As measurements are made, depending on the number of CKFs and their relative proximity, it is possible that after the updating procedure, pairs of CKFs are statistically indistinguishable, i.e., CKF redundancy. The difference between CKF c1 and c2 after the kth update can be measured by the statistical difference metric:
δk,c
When δk,c1,c22 is sufficiently small, then the CKFs can be merged, which reduces the number of CKFs being maintained by the SSF. The cost of redundancy is mainly computational, so a relatively small threshold is used so that there is high confidence in the redundancy of two CKFs before merging. An example threshold is 1.0. If a redundancy is found, then the CKF with the highest likelihood is retained and the lower likelihood CKF is pruned or discarded.
In this section, several example scenarios are considered to demonstrate the performance of the SSF described in the previous section. In all of the scenarios, the ownship flies east to west in a straight level flight at 306 ms−1 for about 60 s before pulling a 3 g coordinated level altitude turn for 8 s, followed by a peak 3 g thrust/burn for approximately 7 s. The emitter is observed at a 1 Hz rate and measurements of direction cosine with 1° of standard deviation are generated by one of two arrays on an alternating basis. The array baseline vectors are in the ownship body y-z plane and make angles of +30° and −30° with respect to the body x axis (x axis is generally aligned with the velocity vector).
The graph of
εk=||
The number of CKFs versus time is a strong function of the following:
An important consideration is how well embodiments compare with the optimal estimator. The optimal estimator performance can be estimated via a covariance-based analysis that utilizes truth information for computing the linearization of the observation matrices. This lower bounding covariance matrix is called the Cramér-Rao lower bound (CRLB) for this type of estimation problem, and is denoted as PCRLB.
Performance is now more systematically considered by using Monte Carlo trials. The only variation from trial to trial is the noise added to the direction cosine measurements. 100 Monte Carlo trials are considered for measurements from each emitter. The location estimation error is recorded after each update. In this case, the ideal result is that the SSF has at least one CKF active at the end of the scenario. It is possible that the SSF erroneously discards all CKFs, indicating that the SSF rejects the (correct) hypothesis that all the measurements belong to a single stationary emitter. This is called a misclassification error.
A less restrictive model embodiment permits the emitter to be moving on the Earth surface. A classic example would be naval or ship-based radars. The model permits the emitter to move along the surface of the Earth at speeds that are reasonably achievable for a surface emitter, e.g., less than 31 ms−1. Again, the GSKF is used, but this time a moving surface filter (MSF) is specified. The following discussions address only the differences between the SSF and MSF.
For embodiments, each CKF has a six dimensional state vector, {circumflex over (x)}, that corresponds to a position vector stacked on top of a velocity vector, both in Earth-Centered Earth-Fixed (ECEF) coordinates. The nearly constant velocity motion model is used for a moving emitter. This model specifies the state transition matrix:
and the plant noise covariance matrix:
where T denotes the elapsed time.
The initialization of the position for each CKF in the MSF is identical to the SSF. The velocity components are initialized to zero, and the velocity component of the covariance matrix is initialized to be:
where smax is the maximum speed of a surface mover to be tracked using this filter.
The same scoring logic is used in the MSF as is used in the SSF.
The CKFs are initialized with positions that have a height above the reference WGS84 ellipsoid of zero. (The World Geodetic System (WGS84) is the global ellipsoid model reference coordinate system for GPS established in 1984. It includes a reference ellipsoid, a standard coordinate system, altitude data, and a geoid.) If the object being tracked is a surface mover, then the “height rate” is nearly zero. Embodiments softly enforce this constraint using a pseudo-measurement of “height-rate”.
Since the MSF is tracking moving emitters, the pruning of “drifting” CKF positions calculated for the SSF is not used in the MSF. Rather, in the MSF, CKFs are pruned when the speed estimated by the MSF exceeds (or drifts above) the maximum speed of a surface mover, smax, with a sufficient confidence and when the height of the MSF is no longer consistent with being located on the surface of the Earth. When the speed test:
Ŝ
k−3σs>smax (EQ. 31)
is true, then the CKF with index k is pruned. The speed test uses the following quantities:
When either:
ĥ
k−3σh>htol (EQ. 37)
or:
ĥ
k+3σh<htol (EQ. 38)
are true, then the CKF with index k is pruned. The height test uses an efficient approximation for height, denoted as ĥk, and the following quantities:
The pruning of “redundant” CKFs used in the SSF is also used in the MSF, with the additional constraint that the velocity components are also redundant.
This section considers several example scenarios to demonstrate the performance of the MSF.
The discussion and analysis is now expanded to moving emitters. The ability to geolocate a target using only line of-sight (i.e., angle) measurements from a single platform is not viable without additional (a priori) information and/or ownship maneuvers. To account for an ownship maneuver, a stabilization point of reference or a line-of sight estimate must be available. If the signal is known with (very) high confidence to originate from the surface of the Earth, then a stabilization point is available and the approach of the SSF is a path forward. In the more general case, when the signal is not known to be originating from the surface of the Earth, a line-of-sight estimate can be used. There are two methods for obtaining a line-of-sight estimate. The first is to utilize direction cosine measurements from two nearly collocated baseline arrays. The second uses an approximation of zero for the signal elevation with respect to local ENU/NED coordinates (East, North, Up (ENU), North, East, Down (NED)), which is appropriate for signals at long range.
Both methods for estimating a line-of-sight can result in two valid estimates for the line-of-sight, one corresponding to the “front” lobe and the other to the “back” lobe. This ambiguity over time is resolved using the GSKF formulation. Each line-of-sight solution is assumed equally probable at initialization. For each line-of-sight estimate, , a Kalman filter is defined for tracking the line-of-sight over time. A fixed constant pseudorange measurement, rp, is used and a six state Kalman filter in ECEF coordinates is maintained with updates from angle-of-arrival information. This formulation does not attempt to estimate range information, rather it maintains a state vector that provides a good predictor of the angle-of-arrival information that accounts for ownship maneuvers. The six states are the position and velocity coordinates:
x=[p
x
p
y
p
z
{dot over (p)}
x
{dot over (p)}
y
{dot over (p)}
z]T (EQ. 41)
The initialization of the position coordinates is given by:
{circumflex over (p)}=r
p
ECEF
+p
0 (EQ. 42)
where p0 is the ownship position and ECEF is the estimated line-of-sight, both in ECEF coordinates. The initial covariance matrix for the state vector is block diagonal in position and velocity, i.e.:
The initial position component, Pp, is given by adding the line-of-sight covariance (in ECEF) scaled by the pseudorange with the pseudorange variance:
P
γ
=r
p
2
+σr
In embodiments, information about the angle-of-arrival rates is used when available. For this example assume that this is not the case, and the velocity components are initialized to zero, i.e.:
{dot over ({circumflex over (p)})}=[0 0 0]T (EQ. 45)
use an a priori bound on the velocity covariance matrix diagonal, i.e.:
P
{dot over (p)}=σv2I3 (EQ. 46)
where σv is on the order of 300 ms−1 for a standard airborne platform, and In denotes an n dimensional identity matrix.
After each angle-of-arrival measurement update step, a pseudo measurement of range is also processed. Both the pseudo range measurement and the pseudo measurement variance are fixed values. Hence, the term “Pseudorange Kalman Filter” (PKF). The computations and logic used in scoring, updating, and pruning of low likelihood and redundant CKFs are the same as in the SSF. The pruning of “drifting” CKFs is not appropriate for the PKF.
This section,
The tracking performance of the PKF versus stationary surface emitters is now considered. In the case when two baseline arrays are available, the performance achieved is similar to or better than that achieved against airborne emitters.
The computing system used for a generalized angle-based tracker for performing (or controlling) the operations or functions described hereinabove with respect to the system and/or the method may include a processor, FPGA, I/O devices, a memory system, and a network adaptor. The computing system includes a program module (not shown) for performing (or controlling) the operations or functions described hereinabove with respect to the system and/or the method according to exemplary embodiments. For example, the program module may include routines, programs, objects, components, logic, data structures, or the like, for performing particular tasks or implement particular abstract data types. The processor may execute instructions written in the program module to perform (or control) the operations or functions described hereinabove with respect to the system and/or the method. The program module may be programmed into the integrated circuits of the processor. In an exemplary embodiment, the program module may be stored in the memory system or in a remote computer system storage media.
The computing system may include a variety of computing system readable media. Such media may be any available media that is accessible by the computer system, and it may include both volatile and non-volatile media, removable and non-removable media.
The memory system can include computer system readable media in the form of volatile memory, such as random access memory (RAM) and/or cache memory or others. The computer system may further include other removable/non-removable, volatile/non-volatile computer system storage media. The computer system can communicate with one or more devices using the network adapter. The network adapter may support wired communications based on Internet, LAN, WAN, or the like, or wireless communications based on CDMA, GSM, wideband CDMA, CDMA-2000, TDMA, LTE, wireless LAN, Bluetooth, or the like.
The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention are described herein with reference to a flowchart illustration and/or block diagram of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
The foregoing description of the embodiments has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of this disclosure. It is intended that the scope of the present disclosure be limited not by this detailed description, but rather by the claims appended hereto.
A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made without departing from the scope of the disclosure. Although operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.
Each and every page of this submission, and all contents thereon, however characterized, identified, or numbered, is considered a substantive part of this application for all purposes, irrespective of form or placement within the application. This specification is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of this disclosure. Other and various embodiments will be readily apparent to those skilled in the art, from this description, figures, and the claims that follow. It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto.