Analysis of the Trusted Inertial Terrain-Aided Navigation Measurement Function

  • NAVIGATION: Journal of the Institute of Navigation
  • September 2025,
  • 72
  • (3)
  • navi.707;
  • DOI: https://doi.org/10.33012/navi.707

Abstract

The trusted inertial terrain-aided navigation (TITAN) algorithm leverages an airborne vertical synthetic aperture radar to measure the range to the closest ground points along several prescribed iso-Doppler contours. These TITAN minimum-range, prescribed-Doppler measurements are the result of a constrained nonlinear optimization problem whose optimization function and constraints both depend on the radar position and velocity. Owing to the complexity of this measurement definition, analysis of the TITAN algorithm is lacking in prior work. This publication offers such an analysis, making the following three contributions: (1) an analytical solution to the TITAN constrained optimization measurement problem, (2) a derivation of the TITAN measurement function Jacobian, and (3) a derivation of the Cramér-Rao lower bound on the estimated position and velocity error covariance. These three contributions are verified via Monte Carlo simulations over synthetic terrain, which further reveal two remarkable properties of the TITAN algorithm: (1) the along-track positioning errors tend to be smaller than the cross-track positioning errors, and (2) the cross-track positioning errors are independent of the terrain roughness.

Keywords

1 INTRODUCTION

Terrain-aided navigation (TAN) is a family of techniques that correlate airborne sensor measurements of overflown terrain features against a local map to estimate the position of an aircraft. Radar-based TAN techniques in particular have received a great deal of attention in recent years owing to the mechanical simplicity of radar and its ability to operate at long stand-off distances. Initially developed in the 1950s for cruise missile applications, these methods matured in the following decades and found use in other applications such as commercial aircraft and spacecraft. The primary appeal of TAN systems is their independence from global navigation satellite systems (GNSSs). This independence enables TAN systems to achieve accurate navigation in areas where GNSSs are not available or to bolster GNSSs in case of a fault. However, unlike GNSSs, which have been designed such that receivers produce navigation solutions of a prescribed accuracy, TAN systems are opportunistic. As a consequence, the accuracy of their navigation solutions depends on the geometry of the surrounding terrain. Thus, it is important to understand the fundamental relationships that guide the performance of TAN systems so that their limitations, failure modes, and unique behaviors do not come as a surprise when these systems are fielded.

TAN techniques have been developed for decades and can be broadly categorized into two families of techniques: (1) range-based TAN techniques that leverage radars, lidar, and other range-based sensors and (2) angle-based TAN techniques that leverage camera sensors. This publication is focused on range-based TAN techniques. Developed in the 1950s and 1960s, the terrain contour matching (TERCOM) system is widely recognized as one of the first radar-based TAN systems (Golden, 1980). TERCOM employs a low-flying radar altimeter to measure a series of ground clearance measurements, which are then batch-correlated against a digital terrain elevation model (DEM) to estimate an aircraft’s trajectory. In the 1970s, Sandia National Labs integrated the TERCOM ground clearance measurement into an extended Kalman filter (EKF) in what is now known as the Sandia inertial TAN (SITAN) system (Hostetler, 1978; Hostetler & Beckmann, 1977). While effective in theory, in practice, the TERCOM and SITAN systems suffer from slow and uncertain convergence due to poor observability: it is simply difficult to unambiguously estimate the three-dimensional (3D) position, velocity, and attitude of a system based on a time series of scalar measurements from a single ground clearance sensor with a fixed mounting orientation.

Mitigations to this observability problem focus on improving the estimator or the sensor. Estimator-based mitigations typically invoke nonlinear and multi-modal estimators. For example, TERCOM and SITAN have been extended with unscented transforms (Mok et al., 2011; Turan, 2020), point-mass filters (Bergman & Ljung, 1997), and particle filters (Zhao et al., 2015), among many other techniques. Sensor-based mitigations often suggest replacing the ground clearance sensor with one that produces measurements with greater information content. For example, Carroll and Canciani (2021) suggested steering a ranging laser to a nearby information-maximizing location, thereby enhancing the information in the scalar measurement. Kim et al. (2018) and Park et al. (2017) proposed the use of an interferometric radar altimeter to measure the 3D offset to the nearest point, thereby augmenting the scalar measurement with two other measurements. Johnson et al. (2010) and Setterfield et al. (2021) leveraged a point-cloud-generating lidar, vastly increasing the number of measurements at a given epoch. Lindstrom et al. (2022) and Pogorelsky et al. (2022) proposed the use of a side-looking synthetic aperture radar (SAR) to generate information-dense, optical-like images. Most of these approaches, however, gain the additional navigation information at the cost of significantly increased sensor size, weight, power, or complexity — a cost not easily borne by remote navigation systems. For example, steerable systems require heavy gimbals, interferometric systems require multiple radar transmit and receive channels, and high-resolution side-looking SAR systems require carefully controlled motion compensation systems. Lidars are not prohibitively costly in terms of size, weight, or power, but they cannot sense as far as radar systems and may be impacted by local weather conditions such as rain or fog.

Recently, Haydon and Humphreys (2023) proposed a coarse-resolution vertical SAR system that addresses the navigation drawbacks of TERCOM and SITAN without significantly increasing the required hardware resources. Their solution, entitled trusted inertial terrain-aided navigation (TITAN), pulses a single-channel radar system and coherently recombines the reflected radar returns to form a coarse range–Doppler image of overflown terrain. Then, several closest-point navigation observables along prescribed iso-Doppler contours (minimum-range, prescribed-Doppler [MRPD]) are extracted from range–Doppler images and correlated against a local DEM within a nonlinear Kalman filter. In particular, the TITAN algorithm produces vector measurements to overflown terrain features with a single-channel radar. Haydon and Humphreys (2023) demonstrated this system with post-processed flight data, although their reporting provided little insight into the fundamental behavior of the algorithm. Specifically, a finite-difference cubature transform method was invoked to compute the Jacobian of the TITAN measurement function with respect to (w.r.t.) the radar’s position and velocity, and no analytical expression was provided for this Jacobian. The analytical Jacobian of a measurement function is critical for understanding the fundamental behavior of a TAN algorithm, how it responds to spatially varying terrain, and its lower bound on navigation errors. A numerical finite-difference approach is sufficient for implementation and demonstration but yields no such analytical insights.

This publication addresses the analysis gap left by Haydon and Humphreys (2023) and makes the following contributions. First, an analytical solution to the TITAN MRPD measurement optimization problem is derived from conic theory. Second, the MRPD optimizer is differentiated to compute an analytical expression for the Jacobian of the MRPD measurement function. Third, the Jacobian is used to form the Cramér–Rao lower bound (CRLB) on the estimated position and velocity error covariance. Finally, the stability and accuracy of these three analytical expressions are evaluated via a Monte Carlo simulation that sweeps over synthetic terrain of varying roughness. This sweep further reveals several remarkable properties of the TITAN measurement function that are not obvious from the analytical expressions alone.

The remainder of this publication is structured as follows. Section 2 provides a review of the TITAN algorithm and measurement function. Section 3 solves the MRPD optimization problem under mild assumptions and derives the corresponding Jacobian. Section 4 then computes the expression for the CRLB on the estimated position and velocity error covariance. Finally, Section 5 verifies the three analytical expressions via Monte Carlo simulations over synthetic terrain.

2 REVIEW OF THE TITAN ALGORITHM

A brief review of the TITAN system and measurement function is provided here to highlight the state of existing research and knowledge gaps. The TITAN system employs a nadir-looking vertical SAR to form a range–Doppler image of overflown terrain. After composing the range–Doppler image, the TITAN algorithm extracts several MRPD range measurements. That is, for each measurement epoch, the algorithm prescribes N sets of Doppler values (N Doppler bins) and, for each Doppler bin, selects the range to the closest point whose associated radar Doppler shift is contained within the prescribed Doppler bin. Note that a Doppler bin has some width owing to radar sensor resolution limits. This measurement concept is visualized in Figure 1(a).

FIGURE 1

(a) The TITAN MRPD measurement concept: for each measurement epoch, the radar measures the range to the closest point along several prescribed iso-Doppler contours (Doppler bins). (b) The TITAN five-step measurement prediction and simulation process: (1) the radar’s beam is projected onto a local DEM, (2) a search region around the beam’s footprint is established, (3) the range and Doppler shift to each ground point within the search region are evaluated, (4) the range–Doppler values are filtered by Doppler, and the prescribed Doppler bins are established, and (5) the range to the closest point in each prescribed Doppler bin is evaluated.

Mathematically, the MRPD measurement concept may be formalized in the following manner. Let x:=[prTvrT]T be the navigation state vector, where pr3 and vr3 are the radar position and velocity, respectively, expressed in a local frame. The MRPD vector measurement function is expressed mathematically as follows:

h[x,θ] :=[h1[x,θ1]h2[x,θ2]hN[x,θN]]Thn[x,θn] :=minppGD[x,θn]pppr1

where hn[x, θn] is the scalar measurement function that maps the radar’s state vector to the MRPD range measurement associated with the n-th Doppler bin, pp is a candidate point expressed in , θ:=[θ1Tθ2TθNT]T is a parameter vector that defines the radar’s pointing and the extents of the N prescribed Doppler bins, G is the set of points that lie on the ground, and D[x,θn] is the set of points that lie within the n-th Doppler bin. Note that radar pointing (attitude) is modeled as a fixed parameter and not as a state variable because radar range–Doppler measurements are not, to the first order, sensitive to small attitude errors. A point pp is determined to be within the n-th Doppler bin if its radar Doppler shift Δf ∈ ℝ defined as:

Δf=2fccvrTppprpppr2

is contained within an interval defined by a set of prescribed lower and upper Doppler bin limits associated with the n-th Doppler bin (Δfn ∈ ℝ and Δfn+ ∈ ℝ, respectively):

ΔfnΔf<Δfn+3

Here, fc > 0 is the radar’s center frequency, and c is the speed of light. The ground-projected size of a Doppler bin is variable and depends on the resolution of the SAR, although it is often on the order of several meters (Haydon & Humphreys, 2023).

To integrate this measurement function into an EKF or to perform an analysis requiring first-order partial derivatives (e.g., the CRLB), one must compute the Jacobian of Equation (1) w.r.t. the navigation state vector xl. Several factors complicate the evaluation of this Jacobian. First, the measurement function itself is a constrained optimization problem (the minimum range in several prescribed Doppler bins), and it is not always possible to compute a closed-form expression for the Jacobian of an optimization problem. Moreover, the navigation state vector xl appears in both the optimization function and the constraint D[x,θn], further complicating the Jacobian. Finally, the ground constraint G introduces another layer of complexity. No structure, behavior, or properties that might facilitate convex optimization or search algorithms can be absolutely applied to all terrain everywhere. For example, one cannot always assume that the terrain is planar over wide areas, that its gradients are well defined everywhere, or that the terrain always increases in elevation in a single direction. To summarize, the Jacobian of the TITAN measurement function requires one to understand how a constrained, nonlinear optimization problem over a terrain manifold varies when the optimization and constraints are simultaneously perturbed.

Recognizing the complexity of this computation, Haydon and Humphreys (2023) deferred the derivation of an analytical Jacobian and instead used the cubature transform as a finite-difference method to approximate the Jacobian. Specifically, Haydon and Humphreys (2023) perturbed the position and velocity navigation states 12 times, searched for the corresponding MRPD ground points for each of the 12 perturbations, and used the resulting minimum range values to approximate the Jacobian of Equation (1). This finite-difference approach was sufficient for a technological demonstration of the TITAN algorithm, but it yielded little insight into the fundamental behavior of the algorithm or its potential performance.

Figure 1(b) illustrates the five-step MRPD search process that was invoked by Haydon and Humphreys (2023) when applying the finite-difference approach. After the radar position or velocity has been perturbed, (1) the radar beam is projected onto a local DEM, (2) a search region around the beam’s footprint is established, (3) the range and Doppler shift to every ground point within the search region are evaluated, (4) the range–Doppler values are filtered by Doppler, and the prescribed Doppler bins are established, and (5) the range to the closest point in each prescribed Doppler bin is evaluated. This five-step process is used to both predict and simulate MRPD measurements and is hereafter referred to as the “empirical MRPD search.”

Using the MRPD measurement definition in Equation (1) and the empirical MRPD search process illustrated in Figure 1(b), the following sections will solve the MRPD optimization problem, derive an analytical expression for the Jacobian of the MRPD measurement function, and compute a lower bound on the estimated position and velocity error covariance.

3 SOLUTION TO THE MRPD OPTIMIZATION PROBLEM

The following section derives an analytical solution to the MRPD optimization problem and its associated Jacobians as a function of the radar position and velocity and the terrain structure near each MRPD ground point. The derivation will assume that the MRPD optimization problem has been solved once and that the MRPD ground points have been established by an empirical MRPD search. This empirical search is required for the terrain near each MRPD ground point to be approximated by a plane for subsequent analysis. Without a knowledge of the MRPD ground point locations, it is impossible to know how to approximate the local terrain. Although it may seem contradictory to require a prior empirical solution for the subsequent analytical solution, these analytical expressions will provide insights into the fundamental performance of the TITAN algorithm — insights that cannot be obtained by simply solving the empirical search.

This section is outlined as follows. Section 3.1 solves the MRPD optimization problem and determines a closed-form expression for the range measurements. Section 3.2 explores the limits of this closed-form range expression. Finally, Section 3.3 computes the Jacobians of the closed-form range expression.

3.1 Derivation of the MRPD Model

This derivation is based on the work of Johnstone and Shene (1992) on the intersection of a cone and plane. Two approximations are invoked so that the MRPD optimization problem can be formulated as a cone–plane intersection problem with analytic solutions: (1) each MRPD Doppler bin is approximated by a single Doppler value (Doppler cone approximation), and (2) the terrain near each MRPD ground point is approximated by a plane (planar terrain approximation). Note that there is a separate planar terrain approximation for each individual MRPD ground point. The planar terrain approximation is generally valid over distances on the order of a dozen meters, and the Doppler cone approximation is reasonable provided that the width of a Doppler bin (typically several meters) is small relative to the radar’s altitude and to the extent of validity of the planar terrain approximation. It will be shown that the closed-form solution to the MRPD optimization problem lies at the vertex of a hyperbola formed by the intersection of the Doppler cone and planar terrain and that this closed-form solution may be expressed in terms of the navigation states, radar parameters, and terrain structure around the MRPD ground points.

Unless stated otherwise, all vectors are expressed in a local frame ℓ; thus, the superscript is dropped hereafter for convenience of notation.

Let us assume that the MRPD optimization problem has been solved once, that the MRPD ground points have been located, and that local planar approximations have been formed around each MRPD ground point. Let the Doppler cone for a single Doppler bin be parameterized by its vertex pr ∈ ℝ3 (radar position), a unit vector v^rS2 along the cone’s axis (unit vector of radar velocity), and an angle α ∈ (0, π) from the cone’s axis to the edge of the cone (the Doppler angle approximating the Doppler bin under consideration). Furthermore, let us suppose that the terrain plane near the associated MRPD ground point is parameterized by pg ∈ ℝ3 (the solved MRPD ground point) and a unit vector o^S2 normal to the plane (the terrain normal at the solved MRPD ground point). Let t ∈ ℝ3 be the intersection point between the cone’s axis and the plane (assuming it exists), and let d ∈ ℝ3 be the vector from pr to t parameterized by the scalar t ∈ ℝ as follows:

d=tpr=tv^r4

Following Johnstone and Shene (1992), we use the following definitions:

v^r'={v^rift0v^rotherwise 5

and:

o^={o^ifv^rTo^0o^ otherwise6

so that v^r points from the radar to the intersection point t and the angle θ between v^r and o^ is always positive and acute: θ ∈ (0, π/2). The parameters θ, v^r, and o^ are then related as follows:

cos[θ]=v^rTo^7

The intersection of a plane and an out-of-plane cone forms either a parabola, hyperbola, ellipse, or circle, depending on the angles θ and α. Of these four cases, the hyperbola case is of general interest. The circle and ellipse cases manifest when cos[θ] > sin[α], the parabola case manifests when cos[θ] = sin[α], and the hyperbola case manifests when cos[θ] < sin[α]. The circle and ellipse cases generally occur with small Doppler angles (α ≈ 0 or απ) or when the radar is plummeting toward the ground (θ ≈ 0). The parabola case only occurs under a singular geometric condition with probability zero. If we limit our consideration to cases in which the radar is flying with a moderate pitch angle relative to the ground, the radar is pointed towards the nadir, and the radar beam width is moderate (< 45°), the condition cos[θ] < sin[α] is often satisfied and only the hyperbola case needs be solved. In these cases, the MRPD optimization problem is reduced to minimizing the distance between the cone’s center and a point along the resulting hyperbola. Figure 2 illustrates the geometry for the hyperbola case.

FIGURE 2

Cone-plane intersection geometry for pr = [0, 0, 15]T, v^r=[1,0,0]T,o^=[0,0,1]T, pg = [1, 1, 0]T, and α = 45°. The MRPD point lies at the vertex of the Doppler bin hyperbola in front of the radar. An aliased hyperbola resulting from the two-way definition of the cone lies behind the radar, although it is of no interest here.

Although it is certainly possible for one of the other cases to manifest, such cases are rare when the flight pitch angle is moderate and the radar is pointed towards the nadir. In fact, in the Monte Carlo simulations in the following sections, no ellipse or parabola cases manifested. Still, depending on the situation, the ellipse case may need to be solved; this case is deferred to future work.

There are two minimizers for this hyperbolic distance minimization problem, one at each hyperbola vertex (a corresponding proof is given in Appendix A). Because the hyperbola lies in the ground plane, it is natural to parameterize the hyperbola and its associated components with vectors in the plane. Let the projection of v^r onto the terrain plane be expressed as follows:

m^=o^×(v^r×o^)o^×(v^r×o^)=v^r(v^rTo^)o^v^r(v^rTo^)o^8

and let the following be an orthogonal unit vector in the plane such that {m^,n^, and o^} form a right-handed, orthonormal triad:

n^=o^×v^ro^×v^r9

Then, a point pϕ ∈ ℝ3 on the hyperbola is given by the following:

pϕ=c0±cosh[ϕ]mm^+sinh[ϕ]nn^10

where c0 ∈ ℝ3 is the center of the hyperbola (the point on the plane halfway between the two hyperbola vertices), ϕ ∈ ℝ is the hyperbolic parameter, and ± indicates that there are two sides to the hyperbola — one side is of interest, and the other is alias owing to the two-sided definition of the cone (see Figure 2). The two sides may be distinguished by comparing the angle between pϕpr and v^r against α. The quantities mm^ and nn^ are the semi-major and semi-minor axes of the hyperbola, respectively, where m^ and n^ are the directions and m ∈ ℝ and n ∈ ℝ are the magnitudes.

The two hyperbola vertices are located at ϕ = 0 and are given as follows:

p0=c0±mm^11

From the work of Johnstone and Shene (1992), the center of the hyperbola is given as follows:

c0=pr+d(v^r+sin[α]2(1cos[α+θ]1cos[αθ])m^)12

with the following semi-major axis length:

m=dsin[α]2(1cos[α+θ]+1cos[αθ])13

Substituting Equations (12) and (13) into Equation (11) produces the following expression for the hyperbola vertices:

p0=pr+d(v^rsin[α]cos[αθ]m^)14

The range from the cone’s center to the two vertices is then written as follows:

r0=p0pr=dv^rsin[α]cos[αθ]m^15

This range equation is simplified in two ways. First, the line-plane distance ||d|| is replaced by the following formula:

d=|(pgpr)To^v^rTo^|=|(pgpr)To^cos[θ]|16

Second, v^r is decomposed into {m^,n^,o^} components, noting that v^r and n^ are orthogonal:

v^r=(v^rTm^)m^+(v^rTo^)o^=sin[θ]m^+cos[θ]o^17

Substituting Equations (16) and (17) into Equation (15) and simplifying produces the following expression for the range to the two hyperbola vertices:

r0=|(pgpr)To^| |sec[αθ]|18

To summarize, this analytic expression for the minimum range in a prescribed Doppler bin is a function of the radar position pr, the solved MRPD ground point pg, the terrain normal at the MRPD ground point o^, the prescribed Doppler angle α, and the angle between the terrain normal and velocity vector θ. Of course, the accuracy of this expression depends on whether the solved MRPD ground point pg is a reasonable proxy for the actual point of reflection and whether the the local planar terrain model around pg is an acceptable approximation. Errors arising from these assumptions on pg and o^ are explored in Section 5.

One assumption invoked in this derivation should be addressed: the assumption that the Doppler cone axis intersects the terrain plane. For the case in which no intersection exists (the radar is flying perfectly parallel to the terrain), Johnstone and Shene (1992) provided a separate solution for the resulting hyperbola (Theorem 4.2). Fortunately, the resulting range-to-hyperbola-vertex expression can be recovered from Equation (18) in the limit as θπ/2.

3.2 Limits of the MRPD Equation

Two limits of the analytical MRPD range model in Equation (18) are explored to verify that the model is reasonable. First, in the limit as θπ/2, one can recover the Pythagorean distance expression for an aircraft flying parallel to the ground plane at a ground clearance h > 0 and measuring the distance to a point at an angle α ∈ (0, π) from the horizontal — a reassuring check:

limθπ/2r0=|(pgpr)To^||csc[α]|=hsin[α]19

Second, in the limit as both θπ/2 and α → π/2 (the radar is flying parallel to the ground plane and looking straight down), the minimum range reduces to just the ground clearance h — another reassuring check:

limθ,απ/2r0=|(pgpr)To^|=h20

3.3 Jacobians of the MRPD Equation

It is straightforward to compute the position Jacobian of Equation (18), as only the first term varies with it:

r0pr=sgn[(pgpr)To^]|sec[αθ]|o^21

Here, sgn is the sign function. The velocity Jacobian is more complex, as both α and θ depend on vr. The velocity Jacobian is as follows:

r0vr=|(pgpr)To^||sec[αθ]|tan[αθ](αvrθvr)22

The partial derivative of the Doppler angle α w.r.t. the velocity vector is determined via implicit differentiation of its defining equation:

r˙=vrcos[α]23

Here, r˙ ∈ ℝ is the prescribed range rate — a constant — which is related to the radar Doppler shift in Equation (2) by Δf=2fccr˙. Differentiating Equation (23) and solving for α/vr produces the following:

αvr=cot[α]vrv^r=sgn[t]cot[α]vrv^r24

Similarly, the partial derivative of the angle θ is determined via implicit differentiation of its defining expression in Equation (7):

θvr=sgn[t]csc[θ]vr(I3×3v^rv^rT)o^=sgn[t]csc[θ]vr(o^cos[θ]v^r)25

Substituting Equations (24) and (25) into Equation (22) and simplifying produces the final expression for the velocity Jacobian:

r0vr=sgn[t]|(pgpr)To^||sec[αθ]|tan[αθ]vr((cot[α]cot[θ])v^r±csc[θ]o^)26

Equations (21) and (26) represent the first-order variation of the MRPD measurement function with small perturbations in the radar position and velocity, respectively. These equations elucidate two remarkable properties of the measurement function. First, the direction of the position Jacobian is exclusively determined by the terrain normal at the MRPD ground point o^, whereas the magnitude is exclusively determined by the angles α and θ. Second, the direction of the velocity Jacobian is determined by a superposition of the terrain normal at the MRPD ground point o^ and the velocity unit vector v^, and the magnitude of the Jacobian is determined by the angles α and θ, as well as the radar’s speed vr and approximate ground clearance |(pgpr)To^|. Specifically, the magnitude of the velocity Jacobian varies proportionally with the altitude and inversely with the speed: the MRPD measurements become more sensitive to radar velocity perturbations as the radar’s ground clearance increases, and the measurements become less sensitive to the same perturbations as the radar’s speed increases.

This relationship among altitude, speed, and range measurement sensitivity to velocity errors is succinctly captured in Equation (24), the partial derivative of the Doppler angle w.r.t. radar velocity. This equation represents the first-order variation of the Doppler angle with small perturbations in the radar’s velocity. The Doppler angle is important, as its projection onto the ground defines a Doppler bin and, thus, the possible locations of an MRPD ground point. Specifically, at an altitude h > 0, a velocity perturbation Δv ∈ ℝ3 creates an along-track shift Δx ∈ ℝ3of a Doppler bin by approximately Δxhtan[cot[α]vrv^rTΔv]. This sensitivity of the Doppler angle and Doppler bin location to velocity perturbations will be important in Section 5.

For a “nominal” set of flight conditions θ ∈ [60°, 90°) (less than 30° flight pitch angle relative to the ground) and α ∈ [60°, 120°] (less than 30° Doppler angle from the zero-Doppler angle), the magnitude of the position Jacobian is bounded to the interval [1, 2]. For the same limits, the magnitude of the velocity Jacobian is approximately bounded to the interval [0, 4h/||vr||], where h=|(pgpr)To^| is the approximate ground clearance. In these cases, the velocity Jacobian direction is primarily aligned with the o^ direction as cot[x] ≈ 0 and csc[x] ≈ 1 for x ≈ 90°.

4 CRLB ANALYSIS

This section derives the CRLB of the estimated position and velocity error covariance resulting from a set of MRPD measurements.

Let the state navigation vector x ∈ ℝ6 be composed of the radar position pr ∈ ℝ3 and velocity vr ∈ ℝ3: x:=[prTvrT]T. Suppose that N MRPD measurements captured at a single measurement epoch are modeled as a nonlinear function of the radar’s position/velocity and corrupted by additive, zero-mean Gaussian noise:

z=h[x]+w27

Here, z:=[r0,1r0,2r0,N]T is the MRPD measurement vector, h : ℝ6 → ℝN is the MRPD measurement function, similar to Equation (1) for a particular fixed θ, and w ∈ ℝN is zero-mean Gaussian noise with covariance R ∈ ℝN×N. Furthermore, let us suppose that the measurements are linearized about the radar’s true navigation state x*:=[pr* Tvr* T]T such that the measurement model is reasonably approximated by a linear model of the following form:

zh[x*]h[x]x|x=x*(xx*)+w28

After the residual vector y : = zh[x*], the navigation state error vector δx : =xx*=[δprTδvrT]T, and the linear measurement map H:=h[x]x|x=x* have been defined, the measurement model is approximately a linear function of the navigation error:

y=Hδx+w29

The linear measurement map H is composed of the N individual MRPD position and velocity Jacobian vectors defined in Equations (21) and (26):

H=[r0,1prTr0,1vrTr0,2prTr0,2vrT::r0,NprTr0,NvrT] 30

Once in this form, it is well known that the Fisher information matrix (FIM) J ∈ ℝ6×6 associated with the unknown navigation state error parameter δx is as follows (Bar-Shalom et al., 2004):

J=HTR1H=[J11J12J21J22]31

where J11, J12, J21, and J22 are 3 × 3 block components of J associated with the radar’s position and velocity states.

At this point, it is assumed that the linear measurement map H is full column rank so that the navigation error vector is fully observable and the inverse of J exists. Full observability requires that there be at least N > 6 MRPD measurements and that the N column vectors span the full column space. Such observability conditions would not be met if, for example, the radar were overflying perfectly flat terrain where all of the N terrain normal vectors were aligned, resulting in linear dependence between all position Jacobians. Assuming that this is not the case and that the observability conditions are met, the error covariance P ∈ ℝ6×6 of an unbiased estimator of the navigation error x^[z]:N6 is bounded as follows:

P:=E[(x^[z]x*)(x^[z]x*)T]J132

where the inequality indicates that PJ–1 is positive semidefinite. The CRLB is then defined as the inverse of the FIM, as the error covariance of an unbiased estimator can be no smaller (in a semidefinite sense) than J–1.

Suppose that the measurement noise is independent and that the measurement covariance matrix is modeled as R = σ2IN×N for some modeled noise variance σ2 ∈ ℝ. Then, the block components of the MRPD FIM in Equation (31) are as follows:

J11=1σ2n=1Nsec2[αnθn]o^no^nT33

J12=J21T=1σ2n=1Nsgn[tn]((pg,npr)To^n)sec2[αnθn]tan[αnθn]vr×o^n((cot[αn]cot[θn])v^r±csc[θn]o^n)T 34

J22= 1σ2n=1N((pg,npr)To^n)2sec2[αnθn]tan2[αnθn]vr2×((cot[αn]cot[θn])v^r±csc[θn]o^n)((cot[αn]cot[θn])v^r±csc[θn]o^n)T35

where the subscript n indicates quantities associated with the n-th Doppler bin.

Given true information about αn, θn, and o^n, it is straightforward to evaluate Equations (33)(35), form the FIM, and compute the corresponding CRLB of the estimated position and velocity error covariance matrices. The resulting CRLB, however, is only applicable for the specific radar–terrain geometry under consideration and is not generalizable. Thus, although Equations (33)(35) can be used to evaluate the CRLB at any given measurement epoch, this epoch-specific CRLB does not summarize the general performance of the TITAN algorithm, as αn, θn, and o^n may change from epoch to epoch.

To generalize the FIM and CRLB, one can account for variations in the terrain by modeling it as a random variable and integrating it into the FIM calculation. This approach models the MRPD residual vector as follows:

y=H[O^]δx+w36

where o^1,o^2,,o^N are now random variables, O^:={o^n}n=1N, and H[O^] is a random realization of Equation (30). Because O^ is a random variable, y is no longer distributed as a Gaussian random variable. However, it is conditionally Gaussian:

p[yO^]N[H[O^]δx,R]37

In this expression, the quantity H[O^] is a fixed realization of Equation (30). After invoking iterated expectation and the property that y is conditionally Gaussian, it can be shown that the FIM for the case in which the terrain is modeled as a random variable, denoted as J¯6×6, is as follows:

J¯=E[J[O^]]38

where J[O^] is a random realization of Equation (31) and the expectation is taken over the random variable O^.

The distribution of J[O^] is complicated and difficult to analytically evaluate. This distribution depends on all possible radar–terrain geometries, which are infinite. Furthermore, real terrain is difficult to summarize with statistical models. For these reasons, it is often infeasible to analytically evaluate J¯. Instead, a Monte Carlo method can be invoked to approximate J¯ with a finite number of candidate radar–terrain geometries over swaths of terrain with similar statistics. This approach is taken in the following section.

5 MONTE CARLO MODEL VERIFICATION

The analytical expressions for the MRPD range in Equation (18), the position and velocity Jacobians in Equations (21) and (26), and the FIM in Equations (33)(35) are all based on planar terrain and thin Doppler cone assumptions. That is, these are models for the TITAN radar measurements, and like all models, they may have errors and limitations. This section offers a simulation-based verification of these models and explores the reasonableness and limits of their implicit underlying assumptions.

5.1 Synthetic Terrain Generation

The FIM model in Equations (31) and (33)(35) provides insight into the information extractable from a single MRPD measurement set; however, as explained above, this model does not characterize the general performance of the system. Instead, according to Equation (38), one must average over realizations of Equation (31) to characterize the modeled general performance. This section invokes Monte Carlo simulations to generate realizations of synthetic terrain from which sequences of MRPD measurement sets are extracted. The single-epoch FIMs from Equation (31) associated with these individual MRPD measurement sets are averaged to characterize the general performance of the modeled system. Synthetic terrain is invoked so that individual radar–terrain geometries may be randomized while controlling the overall statistics of the geometry.

Five synthetic terrain maps with different levels of terrain roughness are considered. It is recognized that synthetic terrain cannot replace real terrain for the purposes of quantifying the performance of TAN algorithms. Yet, it is infeasible to evaluate every potential measurement scenario. The five synthetic terrain scenarios enable a controlled verification and validation of the analytical range, Jacobian, and FIM models developed in the previous sections, as well as a characterization of the general behavior of the TITAN algorithm as it responds to terrains of varying roughness under the acknowledged caveat that the evaluated behavior will never perfectly match reality.

There exists little literature on synthesizing terrain for the purposes of evaluating TAN algorithms — certainly no standard exists. Most authors, such as Bergman (1997), do not synthesize terrain and instead evaluate the performance of TAN algorithms over digitized versions of real terrain. Some older TERCOM studies synthesized two-dimensional (2D) Gaussian terrain with a circular autocorrelation function of the form exp[x2+y2/σc], where x ∈ ℝ and y ∈ ℝ are the two horizontal lags and σc > 0 is the correlation length (Cannon, 1974; Cannon Jr, 1978). These authors note that the performance of TERCOM over real and synthetic terrain is “almost equivalent” when the statistics of synthetic and real terrain are similar, partially addressing concerns related to the verification of TAN algorithms with synthetic terrain.

A method similar to that of Cannon (1974) was invoked to generate isotropic random surfaces for the terrain of each of the five maps. Specifically, the terrain was generated by convolving 2D zero-mean Gaussian random noise with a circular 2D Gaussian kernel — a method recommended by Garcia and Stoll (1984) for controlled modeling of rough random surfaces. Following the method of Garcia and Stoll (1984), a square DEM of size M × M with side length L > 0, post spacing Δl > 0, elevation standard deviation σh > 0, and terrain correlation length σc > 0 was generated via the following three steps:

  1. Fill a square patch G ∈ ℝM×M with independent samples taken from a scalar zero-mean Gaussian distribution with standard deviation σh.

  2. Create a 2D kernel K ∈ ℝM×M of the form K[x,y]=2LMπσcexp[12x2+y2(σc/2)2], where x,y[L2,+L2] and 2LMπσc is a scale factor that shapes the statistics of the resulting map.

  3. Convolve the random patch and kernel with a normalized Fourier transform to create the isotropic random surface: S=1[[G][K]], where ⊙ indicates the Hadamard product and ℱ and 1 are the forward and inverse Fourier transforms.

MATLAB code for the synthetic terrain generation is based on that provided by Bergström (2012). The resulting random surface S ∈ RM×M has several convenient properties. First, the terrain elevation values are normally distributed with zero mean and a variance of σh2. Second, the marginal terrain gradients in the row and column directions are normally distributed with zero mean and a variance of 2σh2/σc2. Third, the terrain normal vectors are symmetrically distributed about the vertical. Finally, these statistics do not spatially vary on wide scales over the map.

Five square, 20-km-wide, synthetic DEMs were generated with this method. Each map was generated using 10,000 posts (uniformly spaced sample points), a post spacing of 2 m, a terrain elevation standard deviation of 10 m, and a terrain correlation length of {50, 100, 150, 200, 250} m. The mean elevation of each map was adjusted such all elevation values were positive. Figure 3 depicts two patches of terrain synthesized with 50- and 250-m correlation lengths. Table 1 provides some statistics related to the terrain elevation and slopes over the five maps. Figure 4 plots the distribution of the angles of the terrain normals away from the vertical to evidence their azimuthally symmetric distribution.

FIGURE 3

Synthetic isotropic terrain with an elevation standard deviation of σh = 10 m and a correlation length of σc = 50 m (left) or σc = 250 m (right)

FIGURE 4

Angular distribution of the terrain normals for the 50-m correlation length map The pitch angle of the terrain normals is uncorrelated with the azimuth angle; thus, the terrain normals have no preference in the azimuthal direction.

View this table:
TABLE 1

Statistics of the Synthetic Terrain Maps

The marginal statistics are calculated in the row and column directions of the map and are identical.

The purpose of these terrain maps is to evaluate the range, Jacobian, and CRLB models over a variety of radar–terrain geometries while controlling the statistics of the elements that govern the two expressions. Accordingly, the five terrain correlation lengths were chosen to exercise a variety of θ angles, upon which the analytical expressions depend. As a reference for these five synthetic maps, the median terrain slope on the moon — one proposed application domain of the TITAN algorithm (Haydon & Humphreys, 2023) — is 2°–7°, depending on the specific location on the moon (Rosenburg et al., 2011). Referring to Table 1, this median slope approximately corresponds with the 150-, 200-, and 250-m correlation maps, indicating that these maps might be considered “average” terrain, whereas the 50- and 100-m correlation maps might be considered “extreme” terrain.

5.2 Monte Carlo Setup

The following subsections verify the derived MRPD, Jacobian, and CRLB models using data generated by Monte Carlo simulations. A radar was simulated as flying horizontally at an altitude of 9000 ft (2743 m) with a speed of 80 m/s — a replication of the experimental flight conditions reported by Haydon and Humphreys (2023). The radar was configured with a circular beam width diameter of 25° and a ground-projected Doppler bin width of ≈4 m. The ground-projected radar beam spans ≈1200 m. The Monte Carlo simulation swept over two parameter sets: (1) the terrain correlation lengths σc ∈ {50, 100, 150, 200, 250} m and (2) the number of prescribed Doppler bins N ∈ {6, 8, 10, 15, 20, 25, 30, 40, 50, 60, 70, 80, 90, 100}. The Doppler bins were configured so that the corresponding prescribed Doppler angles were uniformly distributed over [–10°, +10°] from the nadir (e.g., three Doppler bins would correspond with the three Doppler angles α ∈ {100°, 90°, 80°}).

The radar’s horizontal position was randomized 500 times for each combination of map and number of Doppler bins, ensuring that the ground-projected beam widths were always contained within the limits of the map. For each instance, a search was performed to find the MRPD ground points and associated range values. During the searches, the elevation maps were linearly interpolated to a 1-m resolution in order to reduce the impact of the discrete nature of the map on the solved range values. For each MRPD ground point, the local terrain normal was estimated with a least-squares solver using all of the terrain patch points in a 10-m-square neighborhood. Finally, the MRPD search was repeated 12 more times while perturbing the radar position by 2 m and velocity by 10 cm/s, and a finite-difference Jacobian of the measurement function was approximated. The MRPD values, ground points, terrain normals, and Jacobians were all recorded for each combination of map and number of Doppler bins for the following analysis.

5.3 Range Model Verification

Equation (18) provides an analytical expression for the MRPD value under thin Doppler cone and planar terrain assumptions. To verify the validity of this expression and, by proxy, these two assumptions, the analytical range expression was compared against the empirically found minimum range values from the Monte Carlo simulations.

Figure 5 presents the cumulative distribution function (CDF) of the difference between analytical MRPD values and the corresponding empirically found MRPD values for each of the five terrain maps. Over all maps, the minimum difference was –340 m, the maximum difference was 2.92 m, and the median difference was approximately 0.14 m. Overall, the empirically found and analytical MRPD values are very close, although there are some outliers. Excepting the 50-m correlation length case, 99.9% of the range differences are smaller than ≈ 1 m. The remaining 0.1% could be attributed to inexact planar approximations or the 1-m discretization of the terrain maps (errors in pg or o^).

FIGURE 5

Cumulative distribution of the difference between analytical MRPD values and empirical MRPD values

The CDF is split across the five terrain maps to illustrate how the simulated terrain roughness impacts the accuracy of the analytical range equation. The magnitude of the range differences tends to increase with increasing terrain roughness (decreasing terrain correlation length). As the terrain becomes rougher, the elevation gradients are magnified, the terrain normal vectors deviate more significantly from the vertical, and the local curvature of the terrain increases. These three trends degrade the validity of the planar terrain approximation and the subsequent accuracy of Equation (18). It is unsurprising, then, that the range produced by Equation (18) diverges somewhat from the empirically determined range as the terrain roughness increases.

Several other properties of Figure 5 should be noted. First, there is a long negative tail for the range differences, but only a short positive tail. That is, the analytical expression for the MRPD value sometimes produces a smaller range than that produced by the empirical search, but only rarely produces a larger MRPD value. This asymmetry in the tails can be explained by the fact that the planar terrain approximation is formed using an already determined MRPD ground point. Because the analytical MRPD expression uses this point (pg), by definition, it already has an upper bound on the MRPD value equal to the range to this point. The opposite is not true — the analytical expression could always yield a smaller range value. The fact that the analytical expression can produce a longer range despite being furnished an alleged upper bound can be attributed to the difference in Doppler bin models between the analytical and empirical approaches. The analytical Doppler bin constraint models the Doppler cone as an infinitely thin cone centered on a real Doppler bin of some width. As a result of this modeling difference, it is possible for the empirical search to select a point in the Doppler bin that is closer to the radar than any point on the analytical cone, yet not technically along the analytical Doppler cone. Stated otherwise, the domains of the two Doppler bins are not the same; hence, it is possible for the two to arrive at different solutions.

Second, the negative tail of the range difference is long, although these outliers belong almost exclusively to the case with a 50-m terrain correlation length. A total of 494 differences exceeded 10 m in magnitude. Of these, 469 occurred in the case with a 50-m correlation length, 17 occurred in the case with a 100-m correlation length, and 8 occurred in the case with a 150-m correlation length, evidencing a correlation between range differences and terrain roughness.

In summary, the analytical MRPD range expression in Equation (18) closely matches the empirically found MRPD range values in almost all cases explored in a comprehensive simulation study. Rare exceptions occur more often over rough terrain whose median slope exceeds approximately 10°. Caution is recommended when applying Equation (18) in such cases.

5.4 Jacobian Model Verification

Equations (21) and (26) provide analytical expressions for the position and velocity Jacobians of the MRPD measurement function. Again, these expressions are based on thin Doppler cone and planar terrain assumptions. To verify the validity of these expressions and, by proxy, these two assumptions, the analytical Jacobians were compared against their corresponding empirical finite-difference approximations. The analytical Jacobians were calculated with Equations (21) and (26) using a planar terrain approximation around a once-solved MRPD ground point; the finite-difference Jacobians were approximated by repeatedly perturbing the radar position and velocity and searching for the MRPD ground point. Importantly, because the finite difference was computed over the entire search, this approach takes into account the effect of a non-zero-width Doppler bin and any curvature in the terrain.

The analytical and finite-difference position and velocity Jacobians were compared with two metrics designed to capture angle and magnitude differences between their respective vectors. Let vα ∈ ℝ3 and vf ∈ ℝ3 be two candidate analytical and finite-difference Jacobian vectors, respectively, to enable a comparison. The first metric computes the angle Δ θ ∈ [0, +180] in degrees between the two vectors:

Δθ=cos1[vaTvfvavf]39

The second metric computes the percent difference in magnitude Δr > 0 between the two vectors:

Δr=|vavfvf|×10040

In this comparison, the finite-difference Jacobian should be interpreted as the true Jacobian, as the finite difference is applied over the entire search process and takes into account the Doppler bin width and terrain nonlinearities. Of course, the discrete nature of the terrain maps introduces errors in the finite-difference Jacobian; thus, in truth, neither Jacobian is perfectly accurate.

These two metrics were computed for each position and velocity Jacobian associated with each MRPD measurement. Figures 6 and 7 present the CDFs of the position and velocity Jacobian difference metrics, respectively, for each of the five terrain maps. The CDF plots are again split across the five terrain maps to illustrate how the terrain roughness affects the Jacobians. Similar to the range difference CDF plot, there exists a nearly monotonic growth in Jacobian angle and magnitude differences as the terrain correlation length decreases.

FIGURE 6

Cumulative distributions of the position Jacobian angle (left) and magnitude (right) metrics

FIGURE 7

Cumulative distributions of the velocity Jacobian angle (left) and magnitude (right) metrics

Overall, the analytical and finite-difference Jacobians are similar, although there are some remarkable differences. The analytical position Jacobians closely match the finite-difference position Jacobians in almost all cases: fewer than ≈2% of the position Jacobian vectors differ by more than 10° in direction, and fewer than ≈3% differ by more than 10% in magnitude. The maximum angular difference was 45°, and the maximum magnitude difference was 54%. These differences are remarkably small given the thin Doppler cone and planar terrain approximations invoked in the analytical Jacobian expression.

The analytical velocity Jacobians do not match as closely: while only ≈3% of angles differ by more than 10°, almost 1% differ by more than 170° — a complete sign reversal. Moreover, almost ≈30% of the velocity Jacobians differ by more than 10% magnitude, and some differed by more than 106%. This difference in correspondence between the position and velocity Jacobians can be explained by two factors. First, the magnitude comparison metric in Equation (40) exaggerates the magnitude difference of vectors when they are small, owing to a division by near-zero. The magnitudes of the position Jacobians are bounded below by unity, but no such lower bound exists for the magnitude of the velocity Jacobians, allowing their magnitude differences to become exaggerated in some cases. Second, the ground-projected location of a Doppler bin is sensitive to velocity errors, and significant movement of a Doppler bin can violate planar terrain assumptions when terrain is extremely rough. A perturbation in radar position shifts the location of a Doppler bin by an approximate maximum distance equal to the position perturbation. In contrast, a perturbation in radar velocity changes the Doppler angle, thereby shifting the location of a Doppler bin by an amount proportional to the radar’s velocity and altitude. This angular relationship is captured by the α/vr expression in Equation (24). For this Monte Carlo simulation, a 10-cm/s velocity perturbation (the velocity finite-difference step size) can shift the ground-projected location of a Doppler bin by ≈17 m — a 34-m span if both perturbation directions are considered. This represents a significant fraction of the terrain correlation length for the 50- and 100-m correlation length maps and likely violates local planar terrain assumptions.

In summary, the analytical MRPD position Jacobians computed from Equation (21) closely match the finite-difference-approximated Jacobians in almost all scenarios. The analytical MRPD velocity Jacobians computed from Equation (26), however, do not match as closely to their finite-difference counterparts and can incur significant angle and magnitude errors when terrain is extremely rough. Caution is recommended when applying Equation (26) in cases where the median terrain slope exceeds approximately 10°.

5.5 Position CRLB Model Verification

Equations (31) and (33)(35) provide analytical expressions for the FIM of the MRPD measurement function. These expressions yield some insights into the behavior of the TITAN algorithm’s CRLB, yet other properties are hidden. For example, the position block FIM expression in Equation (33) indicates that the primary positioning performance of the algorithm is related to the outer product of the terrain normals at the MRPD ground points and, thus, the variance of these normals. One might assume, then, that the statistics of the terrain normals at the MRPD ground points are equal to the statistics of the terrain normals of the map and that the map statistics could be substituted into Equation (33). However, this is not the case. Indeed, it will be shown that the MRPD process shapes the statistics of the terrain normals at the MRPD ground points. This behavior is not obvious from Equations (31) and (33)(35) and is explored via Monte Carlo simulations.

The CRLB bounds the expected error covariance of any unbiased estimator. A metric that is closely related to the error covariance is the dilution of precision (DOP). The DOP captures the performance of an estimator along prescribed directions independent of the system measurement noise. Let J¯N6×6 be the FIM given by Equation (38) associated with N scalar MRPD measurements captured at a single measurement epoch. Let us assume that the measurement noise is identical and independent (R = σ2IN×N). The lower bound on the error covariance PN is as follows:

PN:=J¯N1 =σ2E[H[O^]TH[O^]]1=σ2[Cf03×303×3Cf][σAT2·····σCT2·····σVT2·················][Cf03×303×3Cf]T41

where H[O^] is a random realization of Equation (30). CfSO(3) is an orthonormal frame transformation matrix that transforms a vector expressed in the flight frame f (along-track, cross-track, vertical) to a vector expressed in the local navigation frame in which the FIM is calculated ℓ (e.g., north, east, down). · are placeholders for terms unimportant to the current discussion, and σAT, σCT, σVT > 0 are the along-track, cross-track, and vertical DOP values, respectively. These DOP values may be interpreted as the expected along-track, cross-track, and vertical positioning error per unit of range measurement noise.

The expectation in Equation (41) was approximated with a simple average over the 500 Monte Carlo iterations for each terrain map. Figure 8 presents the resulting along-track, cross-track, and vertical DOP values versus the number of Doppler bins for each of the five terrain maps. In each case, the DOP values were extracted from PN, which was calculated in two ways: (1) by inverting the analytical FIM produced via Equations (31) and (33)(35) and (2) by inverting an evaluation of Equation (31) using Jacobians approximated by a finite-difference approach. Both methods are included to compare the analytical expression with all of its implicit assumptions against an empirical value that accounts for nonlinearities in terrain and non-zero Doppler bin widths. Over all five terrain maps and over all Doppler bins, the analytical and finite-difference-approximated DOP values show strong agreement. This strong agreement indicates that the differences in Jacobian angles and magnitudes shown in the previous section amount to little average difference in fundamental navigation performance.

FIGURE 8

Cross-track, along-track, and vertical DOP as a function of the number of Doppler bins across the five terrain maps

Before continuing, readers should take note of the assumptions implicit in and potential limitations of Figure 8. The DOP values depicted in this figure were calculated by averaging instance-specific FIMs for an aircraft flying at an altitude of 9000 ft at a velocity of 80 m/s with a nadir-pointed radar and evaluated over synthetic isotropic terrain. A change in any of these simulation parameters would affect the α, θ, o^, pr, and vr variables, which control the resulting DOP values. Furthermore, while prior work has concluded that the performance of the TERCOM algorithm with synthetic terrain closely matches the performance of the algorithm with real terrain when the terrain statistics are similar (Cannon, 1974; Cannon Jr, 1978), such a claim has not been verified for the TITAN algorithm. Verification of this claim is deferred to future work, as it exceeds the scope of this publication. Consequently, readers are cautioned against direct interpretation of the DOP results in Figure 8 and are instead directed to consider the trends in the DOP.

The DOP trends in Figure 8 reveal several remarkable properties of the TITAN algorithm’s CRLB that are perhaps not obvious from Equations (31) and (33)(35). First, the vertical DOP is always smaller than the along-track DOP, which is always smaller than the cross-track DOP. It is not surprising that the vertical DOP is the smallest, as terrain normals are usually distributed around the vertical. What is surprising, however, is that the along-track DOP is smaller than the cross-track DOP. The FIM expressions indicate no such preference in direction. In fact, the synthetic terrain guarantees that the population statistics of the terrain normals have no preference for direction — Figure 4 indicates that the terrain normals are approximately circularly distributed about the vertical. One may conclude that the MRPD measurement process shapes the statistics of the terrain normals at the MRPD ground points such that there is a greater angular variance in the terrain normals at the MRPD ground points in the along-track direction than in the cross-track direction. Second, whereas the along-track DOP values decrease with increasing terrain roughness, the cross-track DOP values remain nearly stationary across the five terrain maps. This result is also surprising, as one would expect that increasing terrain roughness would increase the variance of the terrain normals in the cross-track direction at the MRPD ground points, thus decreasing the cross-track DOP. Instead, Figure 8 indicates that this cross-track variance is independent of the population variance of the terrain normals.

Both of these remarkable properties can be explained by the same process. Recall that the MRPD measurement function is a constrained optimization problem. In fact, the analytical expression models the MRPD measurement function as an equality-constrained optimization problem. A necessary condition of equality-constrained optimization problems is that the contours of the optimization function and constraints must be tangent at the minimizer — a consequence revealed by Lagrange multipliers. With this property in mind, suppose that the MRPD optimization problem were broken down into two independent optimization problems: (1) a distance minimization problem in the along-track direction subject to terrain and Doppler constraints and (2) a distance minimization problem in the cross-track direction subject only to terrain constraints. This decomposition is motivated by the observation that the Doppler constraint effectively constrains only the location of MRPD ground points in the along-track direction. Of course, the 3D distance minimization problem subject to 3D Doppler and terrain constraints cannot be exactly decomposed into two 2D problems, but let us accept the decomposition as an explanatory mental model, if not a rigorous mathematical model.

Figure 9 illustrates the two decomposed 2D optimization problems. The rear-view case illustrates the cross-track optimization problem wherein the distance minimization problem is subject only to the terrain constraint; the profile-view case illustrates the along-track optimization problem wherein the distance minimization problem is subject to both the terrain and Doppler constraints. In the rear-view case, with only the terrain constraint, the Lagrange multiplier conditions require that the constant-range circle be tangent to the terrain at the minimum-range point. It follows that the cross-track look vector from the radar’s position to the MRPD ground point must be equal and opposite to the cross-track terrain normal vector. Because the MRPD measurement function minimizes distance, the cross-track look vectors (and, therefore, the terrain normal vectors) will tend toward the vertical because distances to the ground tend to increase with look vectors further from the nadir. To summarize, the cross-track terrain normal vectors are locked to the cross-track MRPD look vectors, which are concentrated near the nadir.

FIGURE 9

Illustration of the model decomposition of the 3D optimization problem into two 2D optimization problems. The cross-track optimization problem is only subject to terrain constraints, whereas the along-track optimization problem is subject to both terrain and Doppler constraints. This difference in constraints results in different terrain normal vectors at the MRPD ground points.

In the profile-view case, both the terrain and Doppler constraints are present. That is, in the along-track direction, the 2D optimization problem is subject to two constraints. In instances where the number of constraints is equal to the dimensionality of the problem (and provided a unique solution exists), no optimization is possible, as the constraints alone determine the location of the minimizer. Accordingly, no constraints are placed on the Jacobians of the constraint functions (terrain normal vectors). For the MRPD optimization problem, this means that the along-track terrain normal vectors at the MRPD ground points can be arbitrarily oriented. Figure 9 depicts the arbitrary nature of these terrain normals — some terrain normals at MRPD ground points are aligned with the MRPD look vector whereas others are nearly orthogonal. To summarize, no constraints are placed on the along-track terrain normal vectors; thus, they are allowed to vary with the population statistics of the terrain.

Supposing that the optimization problem decomposition is reasonable, these two observations — (1) an enforced relationship between cross-track look vectors and cross-track terrain normals and (2) no such relationship in the along-track direction — explain the two remarkable properties of DOP trends shown in Figure 8. First, in instances where the terrain normals vary more than the look vectors, the cross-track DOP is expected to be larger than the along-track DOP, as the variance of the terrain normals in the cross-track direction is attenuated down to the look vector variance, whereas no such attenuation occurs for the along-track normals. This difference in terrain normal variance explains the difference in observed along-track and cross-track DOP values within each terrain map case. Second, because all five synthetic terrain maps were constructed with the same standard deviation for terrain elevation (σh), the synthesized terrain is, on average, no closer to the radar in any particular case. As a result, the horizontal distribution of the nearest points in the cross-track direction — and, thus, the cross-track look vectors — is similar across all cases. Because the cross-track terrain normals are locked to the cross-track look vectors, this result implies that the distribution of the cross-track terrain normals is also invariant across the five terrain maps, explaining the observed independence between the cross-track DOP and terrain roughness.

These conclusions are, of course, conditioned on the validity of the 2D decomposition of the 3D optimization problem, which must be evidenced. Let o^=[xo^yo^zo^]T be the terrain normal vector at the MRPD ground point, and let r^=[xpypzp]T be the look vector from the radar to the MRPD ground point. Suppose that the radar is flying in the x direction, that the terrain normal is pointed up toward the radar, and that the look vector is pointed down toward the terrain. We define the along-track and cross-track angles of the terrain normals as follows:

ΨAT=tan1[xo^zo^]42

ΨCT=tan1[yo^zo^]43

Similarly, we define the along-track and cross-track angles of the MRPD look vectors as follows:

ΦAT=tan1[xr^zr^]44

ΦCT=tan1[yr^zr^]45

If the 2D decomposition model is reasonable, then it follows that the cross-track angles of the terrain normals and look vectors will be nearly equal, whereas the along-track angles of the terrain normals and look vectors will be uncorrelated. Figure 10 displays the distribution of the difference in angles between the terrain normals and look vectors over all of the Monte Carlo simulations. The cross-track angles are strongly concentrated — fewer than 5% of the angles differ by more than 1°. In contrast, the along-track angles have a wide distribution — more than 90% of the angles differ by more than 1°. This alignment of cross-track angles and lack of alignment of the along-track angles support the conclusions drawn from the modeled 2D decomposition of the optimization problem and indicate that the model is reasonable.

FIGURE 10

Distribution of the difference in marginal along-track and cross-track angles between the terrain normals at the MRPD ground points and the look vectors to the MRPD ground points. The small difference in angles in the cross-track direction indicates strong alignment between the normal vectors and look vectors in the cross-track direction.

The findings from the CRLB verification can be summarized as follows:

  1. There is excellent agreement between the empirical finite-difference position CRLB and the position CRLB derived from the FIM expressions in Equations (31) and (38).

  2. The vertical DOP is smaller than the along-track DOP, which is smaller than the cross-track DOP.

  3. The difference in cross-track and along-track DOP values is related to the fact that the Doppler constraint effectively acts only in the along-track direction.

  4. The cross-track DOP is related to the variance of the radar look vectors, whereas the along-track DOP is related to the variance of the terrain normals.

6 CONCLUSIONS

An analytical solution to the TITAN MRPD optimization problem was derived under thin Doppler cone and planar terrain constraints. The solution was differentiated, and the position and velocity Jacobians of the measurement function were calculated. The CRLB for the estimated error covariance of a set of single-epoch MRPD measurements was then determined with the Jacobian expressions. The validity of all three of these analytical expressions was evidenced by Monte Carlo simulations, which revealed two remarkable properties of the TITAN algorithm: (1) along-track positioning errors are typically smaller than the cross-track errors, and (2) cross-track positioning errors are correlated with the radar look vector, not the terrain roughness.

HOW TO CITE THIS ARTICLE

Haydon, T., Huang, A., & Humphreys, T. E. (2025). Analysis of the trusted inertial terrain-aided navigation measurement function. NAVIGATION, 72(3). https://doi.org/10.33012/navi.707

DISCLAIMERS

This article has been authored by employees of National Technology & Engineering Solutions of Sandia, LLC under Contract No. DE-NA0003525 with the United States Department of Energy (DOE). The employee owns all rights, titles, and interests in and to the article and is solely responsible for its contents. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this article or allow others to do so, for United States Government purposes. The DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (https://www.energy.gov/downloads/doe-public-access-plan).

This paper describes objective technical results and analysis. Any subjective views or opinions that might be expressed in the paper do not necessarily represent the views of the United States DOE or the United States Government.

ACKNOWLEDGMENTS

The authors would like to thank Ted Kim for his scrutinous review of the MRPD measurement function, Mike Walker for helping formalize the MRPD measurement definition, and the many unnamed peers who helped review and improve this manuscript.

APPENDIX

A I PROOF THAT THE HYPERBOLIC VERTEX CONSTITUTES THE MINIMUM-RANGE POINT

Claim: The two minimum-range points from the vertex of a 3D cone to the hyperbola formed by the intersection of the cone with a plane occur at the two vertices of the hyperbola.

Setup: Suppose that a hyperbola is formed by the intersection of a cone parameterized by vertex pr ∈ ℝ3, axis v^rS2, and angle α ∈ (0, π) with a plane parameterized by point pg ∈ ℝ3 and normal vector o^S2. We then take the following expression:

pϕ=c0±cosh[ϕ]mm^+sinh[ϕ]nn^46

for the hyperbola, parameterized by the angle ϕ ∈ ℝ with center c0 ∈ ℝ3, semi-major axis m^S2, semi-major axis length m ∈ ℝ, semi-minor axis n^S2, and semi-minor axis length n ∈ ℝ. Furthermore, suppose that the hyperbola center is an affine function of the cone vertex, as in the work by Johnstone and Shene (1992):

c0=pr+d(cos[θ]o^+sin[θ]m^+γm^)47

for some vector d ∈ ℝ3 ≠ 0. The scalars γ, m, and n are defined in the work by Johnstone and Shene (1992) as follows:

γ=sin[α]2(1cos[α+θ]1cos[αθ])48

f=dcos[θ]2(1cos[α+θ]1cos[αθ])49

m=dsin[α]2(1cos[α+θ]+1cos[αθ])50

n=f2m251

Finally, suppose that {m^,n^,o^} are defined such that they form an orthonormal triad and such that the angle θ between o^ and v^r is always positive and acute: θ ∈ (0, π/2). Because the intersection of the cone and the plane forms a hyperbola, it is necessary that cos[θ] < sin[α] (Johnstone & Shene, 1992).

Proof: Let rϕ ∈ ℝ3 be the vector from the cone vertex to the hyperbola, defined as follows:

rϕ=pϕpr=d(cos[θ]o^+sin[θ]m^+γm^)±cosh[ϕ]mm^+sinh[ϕ]nn^52

The minimizer for a distance function is the same as the minimizer for a half squared distance function. The half squared distance between the cone vertex and the hyperbola is as follows:

rϕ2=12rϕTrϕ53

and its derivative w.r.t. ϕ is given as the following:

rϕ2ϕ=rϕTrϕϕ=±d(sin[θ]+γ)sinh[ϕ]m+(m2+n2)cosh[ϕ]sinh[ϕ]54

This derivative is zero at ϕ = 0 because sinh[0] = 0. Thus, the range function is stationary at the two hyperbola vertices. The second derivative must be positive for these points to be minimizers. Differentiating again w.r.t. ϕ produces the following:

2rϕ2ϕ2=±d(sin[θ]+γ)cosh[ϕ]m+(m2+n2)(cosh[ϕ]2+sinh[ϕ]2)55

which, when evaluated at ϕ = 0, yields the following:

2rϕ2ϕ2|ϕ=0=±d(sin[θ]+γ)m+(m2+n2)56

This quantity is always positive if the following holds:

m2+n2>d(sin[θ]+γ)m57

Substituting the definitions from Equations (48)(51) produces the following inequality:

d2sin[α]2sin[θ]2cos[θ]2cos[αθ]2cos[α+θ]2>d2|cos[α]cos[θ]3sin[α]sin[θ]cos[αθ]2cos[α+θ]2|58

Simplifying under the assumption that ||d|| ≠ 0, cos[α ± θ] ≠ 0, sin[α] ≠ 0, sin[θ] ≠ 0, and cos[θ] ≠ 0, which are all disallowed by the problem and domain definitions, produces the following inequality:

sin[α]sin[θ]>|cos[α]cos[θ]|59

This inequality is true for the domain of interest θ ∈ (0, π/2), α ∈ (0, π), and cos[θ] < sin[α]. Thus, the two vertices of the hyperbola minimize the distance between the hyperbola and the cone vertex.

This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.

REFERENCES

  1. Bar-Shalom, Y., Li, X. R., & Kirubarajan, T. (2004). Estimation with applications to tracking and navigation: Theory algorithms and software. John Wiley & Sons. https://doi.org/10.1002/0471221279
  2. Bergman, N. (1997). Bayesian inference in terrain navigation [Doctoral dissertation, Linköping University].
  3. Bergman, N., & Ljung, L. (1997). Point-mass filter and Cramer-Rao bound for terrain-aided navigation. Proc. of the 36th IEEE Conference on Decision and Control, 1, 565570. https://doi.org/10.1109/CDC.1997.650690
  4. Bergström, D. (2012). Rough surface generation & analysis [Accessed: 2025-03-02]. http://www.mysimlabs.com/surface_generation.html
  5. Cannon, M. (1974). TERCOM performance: Analysis and simulation (tech. rep. No. AMRL-TR-73-130). US Aerospace Medical Research Laboratory. https://apps.dtic.mil/sti/citations/AD0783804
  6. Cannon Jr, M. W. (1978). Terrain contour matching (TERCOM): Sensitivity to heading and ground-speed errors (tech. rep. No. AMRL-TR-77-84). US Aerospace Medical Research Laboratory. https://apps.dtic.mil/sti/citations/tr/ADA056127
  7. Carroll, J. D., & Canciani, A. J. (2021). Terrain-referenced navigation using a steerable-laser measurement sensor. NAVIGATION, 68(1), 115134. https://doi.org/10.1002/navi.406
  8. Garcia, N., & Stoll, E. (1984). Monte Carlo calculation for electromagnetic-wave scattering from random rough surfaces. Physical Review Letters, 52(20), 1798. https://doi.org/10.1103/PhysRevLett.52.1798
  9. Golden, J. P. (1980). Terrain contour matching (TERCOM): A cruise missile guidance aid. Proceedings of SPIE 0238, Image Processing for Missile Guidance, 238, 1018. https://doi.org/10.1117/12.959127
  10. Haydon, T., & Humphreys, T. E. (2023). Trusted inertial terrain-aided navigation (TITAN). Proc. of the 36th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS+ 2023), Denver, CO, 20882108. https://doi.org/10.33012/2023.19409
  11. Hostetler, L. (1978). Optimal terrain-aided navigation systems. Guidance and Control Conference, 2030. https://doi.org/10.2514/6.1978-1243
  12. Hostetler, L. D., & Beckmann, R. C. (1977). The Sandia inertial terrain-aided navigation system (tech. rep. No. SAND77-0521). Sandia National Labs.
  13. Johnson, A. E., Keim, J. A., & Ivanov, T. (2010). Analysis of flash lidar field test data for safe lunar landing. Proc. of the 2010 IEEE Aerospace Conference, Big Sky, MT, 111. https://doi.org/10.1109/AERO.2010.5447025
  14. Johnstone, J. K., & Shene, C.-K. (1992). Computing the intersection of a plane and a natural quadric. Computers & Graphics, 16(2), 179186. https://doi.org/10.1016/0097-8493(92)90045-W
  15. Kim, Y., Park, J., & Bang, H. (2018). Terrain-referenced navigation using an interferometric radar altimeter. NAVIGATION, 65(2), 157167. https://doi.org/10.1002/navi.233
  16. Lindstrom, C., Christensen, R., Gunther, J., & Jenkins, S. (2022). GPS-denied navigation aided by synthetic aperture radar using the range-Doppler algorithm. NAVIGATION, 69(3). https://doi.org/10.33012/navi.533
  17. Mok, S., Choi, M., & Bang, H. (2011). Performance comparison of nonlinear estimation techniques in terrain referenced navigation. Proc. of the 2011 11th International Conference on Control, Automation and Systems, Gyeonggi-do, South Korea, 12441249. https://ieeexplore.ieee.org/document/6106118
  18. Park, J., Kim, Y., & Bang, H. (2017). A new measurement model of interferometric radar altimeter for terrain referenced navigation using particle filter. Proc. of the 2017 European Navigation Conference (ENC), Lausanne, Switzerland, 5764. https://doi.org/10.1109/EURONAV.2017.7954173
  19. Pogorelsky, B. S., Zanetti, R., Chen, J., & Jenkins, S. (2022). Synthetic-aperture-radar–based spacecraft terrain relative navigation. Journal of Spacecraft and Rockets, 59(5), 14121424. https://doi.org/10.2514/1.A35067
  20. Rosenburg, M. A., Aharonson, O., Head, J. W., Kreslavsky, M. A., Mazarico, E., Neumann, G. A., Smith, D. E., Torrence, M. H., & Zuber, M. T. (2011). Global surface slopes and roughness of the Moon from the lunar orbiter laser altimeter. Journal of Geophysical Research: Planets, 116(E2). https://doi.org/10.1029/2010JE003716
  21. Setterfield, T. P., Hewitt, R. A., Chen, P.-T., Espinoza, A. T., Trawny, N., & Katake, A. (2021). LiDAR-inertial based navigation and mapping for precision landing. Proc. of the 2021 IEEE Aerospace Conference (50100), Big Sky, MT, 119. https://doi.org/10.1109/AERO50100.2021.9438153
  22. Turan, B. (2020). Comparison of nonlinear filtering methods for terrain referenced aircraft navigation. Proc. of the 2020 IEEE/ION Position, Location and Navigation Symposium (PLANS), Portland, OR, 144149. https://doi.org/10.1109/PLANS46316.2020.9109984
  23. Zhao, L., Gao, N., Huang, B., Wang, Q., & Zhou, J. (2015). A novel terrain-aided navigation algorithm combined with the TERCOM algorithm and particle filter. IEEE Sensors Journal, 15(2), 11241131. https://doi.org/10.1109/JSEN.2014.2360916
Loading
Loading
Loading
Loading