Abstract:
A method of estimating the navigational state of a system entails acquiring observation data produced by noisy measurement sensors and providing a probabilistic inference system to combine the observation data with prediction values of the system state space model to estimate the navigational state of the system. The probabilistic inference system is implemented to include a realization of a Gaussian approximate random variable propagation technique performing deterministic sampling without analytic derivative calculations. This technique achieves for the navigational state of the system an estimation accuracy that is greater than that achievable with an extended Kalman filter-based probabilistic inference system.

Description:
RELATED APPLICATION  
       [0001]     This application claims benefit of U.S. Patent Application No. 60/559,708, filed Apr. 5, 2004. 
     
    
     FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT  
       [0002]     This invention was made with United States government support pursuant to Grant No. N00014-02-C-0248 from the Office of Naval Research, and Grant No. F33615-98-C-3516 from the Defense Advance Research Projects Agency. The United States has certain rights to this invention. 
     
    
     COPYRIGHT NOTICE  
       [0003]     © 2005 Oregon Health and Sciences University. A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever. 37 CFR § 1.71 (d).  
       TECHNICAL FIELD  
       [0004]     This application relates to estimating the navigational state of a system and, in particular, to applying a sigma-point Kalman filter (SPKF) based probabilistic inference framework to effect nonlinear estimation and sensor fusion in loosely coupled or tightly coupled integrated navigation systems.  
       BACKGROUND OF THE INVENTION  
       [0005]     A core objective in the design of integrated navigation systems is optimal fusing of noisy observations from global positioning systems (GPS), inertial measurement units (IMU), and other sensors. Current navigation systems use the extended Kalman filter (EKF) as the standard technique for integrating sensor data. In an inertial navigation system (INS), the EKF combines gyroscope and accelerometer data from an IMU with a kinematics or dynamic model of a vehicle. Other sensors such as a barometric altimeter or magnetic compass may also be integrated. Supplied GPS position and velocity measurements are then integrated with the INS using the same EKF. Position, attitude, velocities, and sensor biases are all estimated. In addition, the GPS receiver may employ its own EKF to solve position and velocity estimates and timing from satellite pseudo-range, phase, and Doppler data. Alternatively, in a tightly coupled approach, a single EKF may be used to combine raw satellite signals with the IMU and other sensor measurements to make an optimal estimation. Unfortunately, the EKF is based on a suboptimal implementation of the recursive Bayesian estimation framework applied to Gaussian random variables. The EKF achieves only first order accuracy in the calculation of the posterior mean and covariance of the transformed random variables. This can seriously affect the accuracy or even lead to divergence of the system.  
         [0006]     The basic framework for the EKF entails estimation of the state of a discrete-time nonlinear dynamic system 
 
 x   k+1   =F ( x   k   ,v   k ) 
 
 y   k   =H ( x   k   ,n   k ), 
 
 where x k  represents the unobserved state of the system and y k  is the only observed signal. The process noise v k  drives the dynamic system, and the observation noise is given by n k . Additivity of the noise sources is not assumed. The system dynamic model F and H are assumed known. In state estimation, the EKF is the standard method of choice to achieve a recursive approximate maximum-likelihood estimation of the state x k . Given the noisy observation y k , the recursive estimation for x k  can be expressed in the form 
 
 {circumflex over (x)}   k =(optimal prediction of  x   k )+κ k   [y   k −(optimal prediction of  y   k )]
 
 This recursion provides the optimal minimum mean-squared error estimate for x k , assuming the prior estimate of {circumflex over (x)} k−1 , and current observation y k  are Gaussian random variables (GRVs). Linearity of the model need not be assumed. The optimal terms in this recursion are given by 
 
 {circumflex over (x)}{overscore (   k )}= E[F ( {circumflex over (x)}   k−1   ,v   k−1 )] κ k   =P   x     k     y     k     P   {tilde over (y)}     k     {tilde over (y)}     y     −1    ŷ{overscore (   k )}= E[H ( {circumflex over (x)}   k   ,n   k )], 
 
 where the optimal prediction of x k  is written as {circumflex over (x)}{overscore ( k )} and corresponds to the expectation of a nonlinear function of the random variables {circumflex over (x)}{overscore ( k )} and v k−1  (similar interpretation for the optimal prediction ŷ{overscore ( k )}). The optimal gain term κ k  is expressed as a function of posterior covariance matrices (with {tilde over (y)} k =y k −ŷ k ). These terms also require taking expectations of a nonlinear function of the prior state estimates. The Kalman filter calculates these quantities exactly in the linear case and can be viewed as an efficient method for analytically propagating GRV through linear system dynamics. For nonlinear models, however, the EKF approximates the optimal terms as: 
 
 {circumflex over (x)}{overscore (   k )}≈ F[{circumflex over (x)}   k−1   ,{overscore (v)} ) κ k   ≈{circumflex over (P)}   x     k     y     k     {circumflex over (P)}   {tilde over (y)}     k     {tilde over (y)}     y     −1    ŷ{overscore (   k )}≈ H ( {circumflex over (x)}{overscore (   k )} ,{overscore (n)}   k )], 
 
 where predictions are approximated as simply the function of the prior mean value for estimates (no expectation taken). The noise means are denoted by {overscore (n)}=E[n] and {overscore (v)}=E[v] and are usually assumed to be equal to zero. The covariances are determined by linearizing the dynamic equations (x k+1 ≈Ax k +Bv k , y k ≈Cx k +Dn k ) and then determining the posterior covariance matrices analytically for the linear system. In other words, in the EKF, the state distribution is approximated by a GRV, which is then propagated analytically through the “first-order” linearization of the nonlinear system. As such, the EKF can be viewed as providing “first-order” approximations to the optimal terms. (While “second-order” versions of the EKF exist, their increased implementation and computational complexity tend to prohibit their use.) These approximations can, however, introduce large errors in the true posterior mean and covariance of the transformed (Gaussian) random variable, which may lead to sub-optimal performance and sometimes divergence of the filter. 
 
         [0007]     Julier, S., Uhlmann, J., and Durrant-Whyte, H., “A New Approach for Filtering Nonlinear Systems,” in  Proceedings of the American Control Conference  (1995), derived a novel, more accurate, and theoretically better grounded alternative to the EKF called the unscented Kalman filter (UKF) for state estimation within the application domain of nonlinear control. The UKF addresses the approximation issues of the EKF. The state distribution is again represented by a GRV but is now specified using a minimal set of carefully chosen sample points, called sigma points. These sigma points completely capture the true mean and covariance of the GRV, and when propagated through the true nonlinear system, capture the posterior mean and covariance accurately to the third order (Taylor series expansion) for any nonlinearity. The UKF can be explained by considering propagating a random variable x (dimension L) through a nonlinear function, y=g(x), and assuming x has mean {overscore (x)} and covariance P x . To calculate the statistics of y, a matrix χ of 2L+1 sigma vectors χ i  (with corresponding weights W i ) is formed, according to the following: 
 
χ 0 ={overscore (x)}  W   0   (m)=λ(   L+λ)   −1  
 
χ i ={overscore (x)}({square root}{square root over (( L+λ ) P   x )}) i  i=1, . . . , L  W   0   (c)=λ(   L+λ ) −1 +(1−α 2 +β) 
 
χ i ={overscore (x)}({square root}{square root over (( L+λ ) P   x )}) i−L  i=L+1, . . . , 2L  W   i   (m)=   W   i   (c)= 0.5( L+λ ) −1  i=1, . . . , 2L 
 
 where λ=α 2 (L+κ)−L is a scaling parameter. α determines the spread of the sigma points around {overscore (x)} and is usually set to a small positive value (e.g. 1≦α≦1e−3). κ is a secondary, scaling parameter that is usually set to 0, and β is used to incorporate prior knowledge of the distribution of x (for Gaussian distributions, β=2 is optimal). The optimal value of β is a function of the kurtosis of the prior random variable. ({square root}{square root over (L+λ)P x )}) i  is the ith row of the matrix square root. These sigma vectors are propagated through the nonlinear function 
 
γ i   =g (χ i ) i=0, . . . , 2L, 
 
 and the mean and covariance of y are approximated using a weighted sample mean and covariance of the posterior sigma points  
               y   _     ≈       ∑     i   =   0       2   ⁢   L       ⁢       W   i     (   m   )       ⁢     Υ   i                                           P   y     ≈       ∑     i   =   0       2   ⁢   L       ⁢         W   i     (   c   )       ⁡     (       Υ   i     -     y   _       )       ⁢         (       Υ   i     -     y   _       )     T     .                   
 
         [0008]     This specific implementation of the general sigma-point approach for calculating posterior statistics, is called the unscented transformation (UT) [Julier 1995]. The sigma-point approach differs substantially from general “sampling” methods (e.g., Monte-Carlo methods and grid-based filters), which require orders of magnitude more sample points in an attempt to propagate an accurate (possibly non-Gaussian) distribution of the state. The deceptively simple approach results in approximations that are accurate to the third order for Gaussian inputs for all non-linearities. For non-Gaussian inputs, approximations are accurate to at least the second-order, with the accuracy of third and higher order moments determined by the choice of α and β. A simple example is shown in  FIG. 1  for a two-dimensional system. The left-hand plots show the true mean and covariance propagation using Monte-Carlo sampling; the middle plots show the results using a linearization approach as would be done in the EKF; and the right-hand plots show the performance of the sigma-point approach (only 5 sigma points required for L=2). The superior performance of the sigma-point approach is clear.  
         [0009]     The sigma-point Kalman filter (SPKF) is a better alternative to the EKF for Gaussian approximate probabilistic inference in general nonlinear dynamic state-space models. SPKF is a family of Kalman filters using derivativeless deterministic sampling for Gaussian approximate nonlinear estimation. The sigma-point approach is the underlying unifying technique that is common to SPKFs and is a method of calculating the statistics of a random variable that undergoes a nonlinear transformation. These calculations form the core of the optimal Kalman time and measurement equations, which are simply the original (optimal) recursive Bayesian estimation integral equations recast under a Gaussian assumption.  
         [0010]     The sigma-point approach for approximating the statistics of a random variable that undergoes a nonlinear transformation is summarized by the following three steps: 
        1. A set of weighted sigma-points is deterministically calculated using the mean and square-root decomposition of the covariance matrix of the prior random variable. As a minimal requirement, the sigma-point set completely captures the first and second order moments of the prior random variable. Higher order moments can be captured, if so desired, at the cost of using more sigma-points.     2. The sigma-points are then propagated through the true nonlinear function using functional evaluations alone, i.e., no analytical derivatives are used, to generate a posterior sigma-point set.     3. The posterior statistics are calculated (approximated) using tractable functions of the propagated sigma-points and weights. 
 
 When the UT implementation of the sigma-point approach is used, the resulting filter is the UKF. The UKF is one specific implementation of SPKF. 
       
 
         [0014]     The superior performance of the sigma-point approach would make desirable an application of SPKF to nonlinear estimation and sensor fusion in the operation of vehicle navigation systems.  
       SUMMARY OF THE INVENTION  
       [0015]     An object of the invention is to provide a method of estimating the navigational state of a system with an accuracy that is greater than that achievable with an extended Kalman filter-based probabilistic inference system.  
         [0016]     The present invention is a method of estimating the navigational state of a system. The navigational state is characterized by random variables of a state space model that specifies a time evolution of the system and its relationship to sensor observations. The method entails acquiring observation data produced by measurement sensors that provide noisy information about the navigational state of the system and providing a probabilistic inference system to combine the observation data with prediction values of the system state space model to estimate the navigational state of the system. The probabilistic inference system is implemented to include a realization of a Gaussian approximate random variable propagation technique performing deterministic sampling without analytic derivative calculations. This technique achieves for the navigational state of the system an estimation accuracy that is greater than that achievable with an extended Kalman filter-based probabilistic inference system.  
         [0017]     In a preferred embodiment, the measurement sensors include an inertial measurement unit (IMU) that operates to estimate a set of navigational state components. The navigational state component set includes angular velocity and attitude information relating to an object in motion and bias and scale factor information associated with the IMU. The random variable propagation technique of the probabilistic inference system used to estimate the navigational state of the system includes using mean values and square root decomposition of a covariance matrix of a prior random variable to deterministically calculate a set of sigma-points and an associated set of weight values. The calculated set of weighted sigma-points is propagated through a nonlinear state space model to produce a posterior set of weighted sigma-points used to calculate posterior statistics. The calculation of posterior statistics entails the use of closed form functions of the propagated sigma-points and weight values. The calculated posterior statistics give an approximately optimal update of the navigational state and its covariance by combining the prediction values of the system state space model and the sensor observations.  
         [0018]     A preferred embodiment implements a SPKF based latency delayed sensor fusion technique for situations in which the observation data provide noisy information about the navigational state of the system at a time that lags a current time because of sensor latency. The method entails maintaining a cross correlation between a navigational state of the system at a current time and the navigational state to which the latency lagged observation data correspond and uses the cross correlation to optimally combine latency lagged observation data with the prediction values of the system state space model.  
         [0019]     Additional aspects and advantages of this invention will be apparent from the following detailed description of preferred embodiments, which proceeds with reference to the accompanying drawings. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0020]      FIG. 1  shows the accuracy of a scaled unscented transformation for mean and covariance propagation of a Gaussian random variable through an arbitrary nonlinear function.  
         [0021]      FIG. 2  is a pictorial block diagram of an unmanned aerial vehicle (UAV) guidance, navigation, and control (GNC) system in which a preferred embodiment of the invention is implemented.  
         [0022]      FIG. 3  is a schematic representation of sensor inherent latency manifested within a Kalman filter based estimation framework.  
         [0023]      FIG. 4  is a process flow diagram showing the calculation of the cross-covariance using the sigma-point approach for sensor latency compensation.  
         [0024]      FIG. 5  is a graphical rendering of the helicopter flight trajectory used for state estimation experiments.  
         [0025]      FIG. 6  is a set of graphical plots showing the error performance of the helicopter flown in simulation along the trajectory of  FIG. 5 .  
         [0026]      FIG. 7  shows for EKF and SPKF the desired flight trajectory, true realized trajectory, and estimated flight trajectory of a high speed nose-in turn performed by the helicopter flown in simulation.  
         [0027]      FIG. 8  shows a comparison of RMSE performance versus increase in IMU additive noise.  
         [0028]      FIG. 9  shows the comparative relationship of the estimated three-dimensional positions for SPKF- and EKF-based systems on actual test flight telemetry.  
         [0029]      FIG. 10  shows a two-dimensional (top down) projection of the estimation results presented in  FIG. 9 .  
         [0030]      FIGS. 11, 11B , and  11 C show the effect of GPS outages on, respectively, the separate north, east, and down components of the estimated three-dimensional positions presented in  FIG. 9 .  
         [0031]      FIG. 12  is a schematic diagram presented as a graphical aid in explanation of the Gaussian Mixture Sigma-Point Particle Filter (GMSPPF) algorithm. 
     
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS  
       [0032]     A preferred embodiment of the method of estimating the navigational state of a system is carried out in application of the SPKF to a loosely coupled implementation of guidance and navigation system (GNS) for unmanned aerial vehicle autonomy (UAV), specifically an autonomous small-scale helicopter. The core component of such a UAV is a high-performance digital computer based guidance, navigation, and control (GNC) system as shown schematically in  FIG. 2 . The main subsystems of the GNC system are a control system (CS) and a guidance and navigation system (GNS). The GNS takes noisy avionics sensor measurements (e.g., GPS, IMU, and altimeter) as inputs, and then fuses them in a probabilistic sense with predictions from a vehicle dynamics model to calculate optimal vehicle navigation state solutions. The term “fuse” refers to the Kalman optimal combination of the prior state estimate with the new information contained in the sensor measurement. This is achieved through the Kalman measurement-update step. These state estimates, together with desired flight trajectories, are then applied to the control system, which computes some form of optimal control law to drive the flight surface actuators of the vehicle. This GNS is considered a loosely coupled GPS/INS (inertial navigation system) integration because the processing internal to the GPS is done independently of other sensor measurements. A computer readable memory storing instructions for configuring a signal processing system is preferably used to perform the method. The computer readable memory can include magnetic media (such as floppy disk or a hard drive), optical media (such as a CD or a DVD) or electronic media (such as rewritable or non-rewritable memory).  
         [0033]     The current state-of-the-art probabilistic inference systems used for such UAV guidance and navigation systems are usually EKF based. The experimental platform, which was developed by the Aerial Robotics Group at the MIT Laboratory for Information and Decision Systems, was built around an EKF based GNS implementation. Real-world experimental verification of the operation of the SPKF entailed replacement of the EKF in the UAV-GNC system by a SPKF and comparison of its performance to an existing EKF base-line system, with specific focus on: 1) improved six-degrees-of-freedom (6DOF) state estimation accuracy, 2) SPKF based compensation for GPS latency, 3) evaluation of improved control envelope resulting from use of a better state estimator, and 4) robustness to IMU degradation. The vehicle dynamic process model and the avionics sensor models for use inside the SPKF based state estimator are described below.  
         [0034]     Vehicle State-Space Process Model: Because of its high computational complexity, a high-fidelity nonlinear dynamic model of UAV movement is not ideally suited for use within the navigation filter loop. (The Experimental Results section presented below describes use of a high-fidelity (70 parameters, 43 states) nonlinear dynamic model of UAV movement for UAV simulators and control system design.) For this reason, applicants opted for the standard IMU driven kinematic process model formulation that comprises an INS mechanization component and a IMU sensor error model component. Because low cost MEMS-based IMUs such as the one used in the avionics system have large bias and scale factor errors, these components are included into the state vector to be estimated.  
         [0035]     The estimated values of these error components are then used to correct the raw IMU acceleration and gyroscope-rate measurements before they are used inside the INS mechanization equations of the process model. The  16  dimensional state vector of this model is given by 
 
 x=[p   T   v   T   e   T   a   b   T   ω   b   T ], 
 
 where p=[xyz] T  and v=[v x v y v z ] T  are the respective position and velocity vectors of the vehicle in the navigation frame, e=[e 0 e 1 e 2 e 3 ] T  is the unity norm vehicle attitude quaternion, a b =[a x     b   a y     b   a z     b   ] T  is the vector of IMU acceleration biases, and ω b =[p b q b r b ] T  is the IMU gyroscope rate bias vector. Although a separate scale factor can be included in addition to the bias term in the state vector, applicants&#39; experiments demonstrated that it is sufficient to model the combined effect of the bias and scale error terms as a single time-varying bias term. 
 
         [0036]     The continuous time kinematic navigation equations (INS mechanization equations and error model) operating on this state vector and driven by the error corrected IMU measurements are given below:  
               p   .     =   v           (   1   )                 v   .     =         C   b   n     ⁡     (       a   _     -     a       r   ~     imu         )       +         [         0       0       1         ]     T     ⁢           ⁢   g               (   2   )                 e   .     =       -     1   2       ⁢       Ω   ~       ω   _       ⁢   e             (   3   )                   a   .     b     =     w     a     b   k                 (   4   )                   ω   .     b     =       w     ω     b   k         .             (   5   )             
 
 C b   n  is the direction cosine matrix (DCM) transforming vectors from the body frame to the navigation frame. The DCM is a nonlinear function of the current attitude quaternion and is given by  
         C   b   n     =         (     C   n   b     )     T     =       2   ⁢           [           0.5   -     e   2   2     -     e   3   2                 e   1     ⁢     e   2       -       e   0     ⁢     e   3                   e   1     ⁢     e   3       +       e   0     ⁢     e   2                       e   1     ⁢     e   2       +       e   0     ⁢     e   3               0.5   -     e   1   2     -     e   3   2                 e   2     ⁢     e   3       -       e   0     ⁢     e   1                       e   1     ⁢     e   3       -       e   0     ⁢     e   2                   e   2     ⁢     e   3       +       e   0     ⁢     e   1               0.5   -     e   1   2     -     e   2   2             ]     .           
 
 The term g is the gravitational acceleration component, and {overscore (a)} and {overscore (ω)} are the bias and noise corrected IMU accelerometer and gyroscope rate measurements, i.e., 
 
 {overscore (a)}={overscore (a)}−a   b   −n   a  
 
{overscore (ω)}={overscore (ω)}−ω b   −C   n   b ω c   −n   ω . 
 
         [0037]     In the above equations, {overscore (a)} and {overscore (ω)} are the raw measurements coming from the IMU, n a  and n ω  are the IMU acceleration and gyroscope-rate measurement noise terms, and ω c  is the rotational rate of the earth as measured in the navigation frame (Coriolis effect). In general, ω c  is a function of the location of the navigational frame relative to the earth frame and hence is time-varying as the navigation frame moves relative to the earth frame. However, for their purposes (aggressive autonomous UAV flight within a very small airspace volume), applicants assumed that the navigation frame does not change relative to the earth frame, resulting in a constant ω c  for a given origin location (lat/long) of the navigation frame. {tilde over (Ω)} {tilde over (ω)}  is a 4×4 skew-symmetric matrix composed of the error corrected IMU gyro-rate measurements, i.e.,  
           Ω   ~       ω   _       =       [         0                 ⁢       ω   _     p                     ⁢       ω   _     q                     ⁢       ω   _     r                 -       ω   _     p           0         -       ω   _     r                     ⁢       ω   _     q                 -       ω   _     q                     ⁢       ω   _     r           0         -       ω   _     p                 -       ω   _     r             -       ω   _     q                     ⁢       ω   _     p           0         ]     .         
 
 In Eq. (2), a {tilde over (r)}     imu    is the IMU-lever-arm coupling component resulting from locating the IMU not at the center of gravity of the vehicle. This component can be ignored if the navigation filter computes the state estimate at the IMU location. This IMU centric navigation solution can then simply be transformed to the center of gravity location after the fact as needed by the vehicle control system. 
 
         [0038]     The final components of the process model, Eqs. (4) and (5), model the time-varying nature of the IMU sensor bias error terms. Usually, sensor errors in an INS are modeled as a zero-mean, stationary, first-order Gauss-Markov process. Since the biases and scale factors of low cost MEMS-based IMU sensors exhibit non-zero mean and non-stationary behavior, the errors are modeled as a random walk to improve the tracking of these time-varying errors by the navigation filter. This does require, however, that the effect of these errors be observable through the specific choice of measurement model.  
         [0039]     The position and velocity discrete-time updates are calculated by the following simple first-order Euler update 
 
 p   k+1   =p   k   +{dot over (p)}   k   ·dt  
 
 v   k+1   =v   k   +{dot over (v)}   k   ·dt,  
 
 where {dot over (p)} k  and {dot over (v)} k  are calculated using Eqs. (1) and (2) and dt is the integration time-step of the system (in this system the integration time-step was dictated by the IMU rate, i.e., dt=10 ms). The quaternion propagation equation can be expressed in discrete form with an analytical calculation of the exponent of the skew-symmetric matrix given by Stevens, B. and Lewis, F.,  Aircraft Control and Simulation , New York, N.Y.: Wiley, 1992. The discrete-time update can be written as  
               e     k   +   1       =       exp   (       -     1   2       ⁢       Ω   ~     ·   d     ⁢           ⁢   t     )     ⁢           ⁢       e   k     .               (   6   )             
 
 Further denoting 
 
Δφ={overscore (ω)} p   ·dt  
 
 Δθ={overscore (ω)} q   ·dt  
 
Δω={overscore (ω)} r   ·dt,  
 
 as effective rotations around the (body frame) roll, pitch, and yaw axes undergone by the vehicle during the time period dt, assuming that the angular rates {overscore (ω)} p, {overscore (ω)}   q , and {overscore (ω)} r  remained constant during that interval, one can introduce the 4×4 skew-symmetric matrix  
         Φ   Δ     =           Ω   ~     ·   d     ⁢           ⁢   t     =       [         0         Δ   ⁢           ⁢   ϕ           Δ   ⁢           ⁢   θ           Δ   ⁢           ⁢   ψ                 -   Δ     ⁢           ⁢   ϕ         0           -   Δ     ⁢           ⁢   ψ           Δ   ⁢           ⁢   θ                 -   Δ     ⁢           ⁢   θ           Δ   ⁢           ⁢   ψ         0           -   Δ     ⁢           ⁢   ϕ                 -   Δ     ⁢           ⁢   ψ             -   Δ     ⁢           ⁢   θ           Δ   ⁢           ⁢   ϕ         0         ]     .           
 
 Using the definition of the matrix exponent and the skew symmetric property of Φ Δ , one can write down the following closed-form solution:  
                       exp   (       -     1   2       ⁢     Φ   Δ       )     =       I   ⁢           ⁢     cos   ⁡     (   s   )         -       1   2     ⁢     Φ   Δ     ⁢           ⁢       sin   ⁡     (   s   )       s           ,             where             s   =         1   2     ⁢          [     Δ   ⁢           ⁢   ϕ   ⁢           ⁢   Δ   ⁢           ⁢   θ   ⁢           ⁢   Δ   ⁢           ⁢   ψ     ]            =       1   2     ⁢             (     Δ   ⁢           ⁢   ϕ     )     2     +       (     Δ   ⁢           ⁢   θ     )     2     +       (     Δ   ⁢           ⁢   ψ     )     2         .                       (   7   )             
 
 Eqs. (6) and (7) ensure (at least theoretically) that the updated quaternion e k+1  has a unit norm. However, a small Lagrange multiplier term can be added to the first component of Equation 7 to further maintain numerical stability and the unity norm of the resulting quaternion. The resulting final solution for the time-update of the quaternion vector is given by  
           e     k   +   1       =     [       I   ⁢           ⁢     (       cos   ⁡     (   s   )       +       η   ·   d     ⁢           ⁢     t   ·   λ         )       -       1   2     ⁢     Φ   Δ     ⁢           ⁢       sin   ⁡     (   s   )       s     ⁢     e   k         ]       ,       
 
 where  
       λ   =     1   -            e   k          2           
is the deviation of the square of the quaternion norm from unity resulting from numerical integration errors, and η is the factor that determines the convergence speed of the numerical error. These factors serve the role of the above mentioned Lagrange multiplier that ensures that the norm of the quaternion remains close to unity. The constraint on the speed of convergence for stability of the numerical solution is η·dt&lt;1. 
 
         [0040]     Finally, the discrete time random-walk process for the IMU sensor error terms is given by 
 
 a   b     k+1     ==a   b     k     +dt·w   a     bk    
 
ω b     k+1   =ω b     k     +dt·w   ω     bk   , 
 
 where 
 
 w a     bk    
 
 and 
 
 w ω     bk    
 
 are zero-mean Gaussian random variables. 
 
         [0041]     These navigation equations are considered a direct formulation, as opposed to the alternative indirect (error) formulation. This choice was made for consistency with the MIT EKF implementation mentioned above.  
         [0042]     Observation Models: The system made use of two independent avionic sensors to aid the INS: a 10 Hz, 50 ms latency GPS (Ashtech G12) and a barometric altimeter that measures absolute altitude as a function of ambient air pressure. The observation models used in our system for these sensors (described below) are highly nonlinear, making the use of the SPKF framework again preferable to an EKF solution.  
         [0043]     GPS: Since our GPS antenna is not located at the same location in the body frame as the IMU, it not only observes the position and velocity of the body in the navigation frame, but also the attitude of the body relative to the navigation frame because of the “lever-arm effect.” More specifically, the GPS observation model is given by: 
 
 p   k   GPS   =p   k−N   +C   b   n   {tilde over (r)}   gps   +n   p     k     (8) 
 
 v   k   GPS   =v   k−N   +C   b   n ω k−N   ×{tilde over (r)}   gps   +n   v     k     (9) 
 
 where p k−N  and v k−N  are the time-delayed (by N samples due to sensor latency) 3D navigation-frame position and velocity vectors of the vehicle, {tilde over (r)} gps  is the location of the GPS antenna in the body frame (relative to the IMU location), ω k−N  are the true rotational rates of the vehicle at time k−N, and n p     k    and n v     k    are stochastic measurement noise terms. The noise terms are modeled as being time-dependent because the accuracy of observations varies over time according to the current PDOP value of the loosely coupled GPS solution. Since the DCM, C b   n , in Eqs. (8) and (9) are a function of the attitude quaternion, the GPS measurements provide information not only of the position and velocity of the vehicle, but also of its attitude. This removes the need for an absolute attitude sensor such as a magnetic compass or tilt-sensor. However, this will also result in the non-observability of the IMU sensor errors during prolonged periods of GPS outages, which in turn can lead to significant INS drift. 
 
         [0044]     The time delay (N samples) in the GPS model equations results from the internal GPS processing latency inherent to all loosely coupled GPS solutions. This implies that the latest GPS measurement relates to the state of the vehicle as it was a number of samples in the past. If the specific latency of the GPS is small, it can (and often is) ignored. If the latency is significant, however, care is taken when fusing this lagged information with the current estimate of the state of the vehicle in the measurement update step of the Kalman filter.  
         [0045]     Barometric altimeter: Ambient air pressure provides an accurate source of sea-level altitude information. Important sources of error are sensor quantization and measurement noise. A high-end altimeter with 10 −3  psi (0.6 meter) resolution was used. The measurement noise was assumed to be zero-mean, white, and Gaussian. The observation model that incorporates these effects are:  
           z   k   alt     =       -     1   φ       ⁢           ⁢     ln   ⁡     [         ρ   0   q     ⁢     ⌊       (         ρ   0     ⁢           ⁢     exp   ⁡     (     φ   ·     z   k       )         +     n     z   a         )     /     ρ   0   q       ⌋         ρ   0       ]           ,       
 
 where ρ 0  is the nominal air pressure at sea-level, φ is the pressure decay rate with altitude constant (1.16603×10 −4  psi/m), z k  is the current navigation-frame z-axis position of the vehicle, ρ 0   q  is the air pressure quantization resolution of the altimeter (10 −3  psi), z k   alt  is the altimeter output and └•┘ is the integer flooring function. This model is not only a nonlinear function of the state, but the measurement noise also effects the output altitude measurement in a non-additive fashion. Again, for such a model the use of the SPKF not only allows for a much simpler implementation than the EKF (no analytical derivatives need to be calculated), but also results in more accurate estimation results. Nonlinear sensor effects such as quantization and compressions are all readily incorporated within the Kalman estimation framework using the inherently nonlinear modeling capability of SPKFs. 
 
         [0046]     The MIT designed, fine-tuned EKF was replaced in the helicopter vehicle with a SPKF based state estimator to implement the present invention. The state estimator uses the above-described nonlinear kinematic process model and observation models of the GPS and barometric altimeter. The state estimator is of a square-root central difference Kalman filter (SR-CDKF) SPKF formulation because of its ease of implementation, intuitive choice of scaling parameters, and numerical robustness. The SR-CDKF algorithm is set forth below as Algorithm 4.  
         [0047]     There are a number of problem specific issues that are dealt with in adapting the general SPKF framework to the UAV state estimation problem. The important ones include asynchronicity, differing sample rates, and time-varying dimension of sensor observations; filter initialization; GPS latency; and quaternion unity norm constraint.  
         [0048]     The first issue is measurement asynchronicity, varying sample rates, and time-varying dimensions. Unlike well behaved synthetic laboratory experiments, the UAV avionics system operates on an asynchronous message passing principle. Although the main system (and filter) is clocked at the IMU rate (100 Hz), the avionic sensors (GPS and altimeter) operate not only asynchronously from this clock, but their measurements are also provided at different sampling rates (10 Hz and 20 Hz respectively). This in turn implies that every filter cycle does not necessarily have both a time-update and a measurement-update step. Every time a new IMU measurement becomes available (roughly every 10 ms), the filter undergoes a time-update using the IMU driven kinematic process model, but a measurement-update is done only if there are actually new sensor data available for processing. The flight-computer polls the navigational sensors (or their simulation equivalents) to determine whether new data are available, and if so, update a bank of sensor buffers with these new measurements. These measurements are accompanied by a unique time-stamp if new data were written into the sensor buffers.  
         [0049]     Based on these time-stamps and prior knowledge of the different update rates of the sensors, the estimator system builds up an adaptive event-map of when to expect new data from the different sensors. This event-map, which is built up during the filter initialization stage, is used in dealing with the GPS latency problem.  
         [0050]     Since the different sensors have different observation vector dimensions (GPS has six dimensions, and altimeter has one dimension) and operate at different rates, the SPKF observation model for any given measurement update is configured to adapt to this time-varying total observation dimension. If both sensors report new data, the effective observation model (and its measurement noise random variable) will be a concatenation of the individual sensor observation models and sigma-points will be drawn from this augmented observation state (true 16D state and augmented noise state). It might also be the case that only one sensor (either the GPS or altimeter) reports new data for a given measurement update, resulting in the observation model (and the related SPKF based measurement update sigma-point generation) reverting to the relevant single sensor model. This time-varying observation model requires careful book-keeping of sensor events to accurately adapt the filter to the time-varying nature of the sensor data stream.  
         [0051]     The second issue is filter initialization. During the initialization of the navigation filter (state estimator), sensor data are observed and processed over a number of seconds while the UAV is at rest on the ground in a known position and attitude. This step contributes to ensuring robust performance of the filter during subsequent aggressive maneuvers.  
         [0052]     The initial position estimate, {circumflex over (P)} 0 =[{circumflex over (x)} 0 ŷ 0 {circumflex over (z)} 0 ] T , in the NED frame is based solely on the averaged GPS position measurements for the first couple of seconds while the UAV is stationary. The initial NED frame velocity estimate, {circumflex over (v)} 0 =[{circumflex over (v)} x     0   {circumflex over (v)} y     0   {circumflex over (v)} z     0   ] 0 , is initialized to zero. The helicopter is oriented into a known yaw direction (either due north or due south) with the x−y (horizontal) plane level (using two spirit levels) during the initialization phase. This allows the initial quaternion estimate, ê 0 =[ê 0     0   ê 1     0   ê 2     0   ê 3     0   ] T , to be set to a known value such as ê 0 =[1 0 0 0] T . The averaged IMU accelerometer and gyroscope readings during the initialization period are used to initialize the estimates of the IMU bias variables. If the IMU is unbiased, the expected stationary accelerometer reading should be a=[0 0−g] T  (where g is the local gravitational acceleration constant, i.e., 9.81 m/s 2 ) and the gyroscope rate readings (ignoring the rotation of the earth) should be zero. Any reading deviating from these expected values can then be used to initialize the bias estimates.  
         [0053]     The final important house-keeping task performed during the initialization phase is the build up the “event map” for when to expect new data from the avionics sensors. This is done by monitoring the time-stamps of the sensor stream buffers over a period of time while the helicopter is stationary. A pre-specified number (≈10) of sensor cycles are observed before the full event-map is robustly initialized. This in turn implies that the duration of this specific initialization phase is determined by the slowest sensor in the avionics system (in this case the GPS). As stated earlier, an accurate event map is also needed to accurately compensate for the inherent processing latency present in the GPS measurements.  
         [0054]     The third issue is GPS latency. One of the big challenges in building a robust state estimator is dealing with the inherent measurement latency of the GPS sensor. As previously mentioned, a GPS sensor has a finite processing delay between when a GPS satellite signal is received for processing and when the actual position and velocity measurement related to that signal becomes available. This implies that the current GPS reading actually corresponds to the position and velocity state of the vehicle at some point in the past. This time difference is called the measurement latency. For cheaper lower performance GPS systems, this latency can be in the order of couple of seconds, causing serious problems when these measurements are fused inside a Kalman filter with the current prediction of the vehicle state.  FIG. 3  demonstrates this issue graphically for a linear dynamic state-space model given by 
 
 x   k+1   =A   k   x   k   +B   k   u   k   +v   k   (10) 
 
 y   k   =C   k   x   k   +n   k   (11) 
 
 where v k ˜N(O,R v ) and n k ˜N(O, R n ). The state estimation filter, in general, receives measurements from a variety of sensors at each measurement-update step. Some measurements corresponds to the system state at the current time, y k , given by Equation (2), while other latency-delayed measurements, y k *, correspond to the system state at time l=k−N, i.e., y k *=C l *x l +n k *, where N is the sensor latency measured in sample periods, C l * is the measurement sensitivity matrix, and n k * is the observation noise for the delayed measurement with n k ˜N(O,R n ). 
 
         [0055]      FIG. 3  shows, for a system with delayed measurement resulting from sensor latency, that at time k, the state estimation filter receives two sets of sensor measurements from the system. A normal measurement y k  corresponds to the system state at time k, and a delayed measurement y k * corresponds to the system state at time l=k−N. The following presents a technique for optimally fusing these different sets of measurements with the current estimate of the system state.  
         [0056]     SPKF based Sensor Latency Compensation: To fuse new information (innovation signal) resulting from a lagged sensor measurement, {tilde over (y)} k−n , with the current prediction of the system state, {circumflex over (x)}{overscore ( k )}, the following form of the Kalman measurement update equations is used: 
 
 {circumflex over (x)}   k   ={circumflex over (x)}{overscore (k)}+κ   k   {tilde over (y)}   k−n , κ k   =P   x     k     {tilde over (y)}     k−n   ( P   {tilde over (y)}     k−n   ) −1 , n=N lat . 
 
 A key insight here is that the optimal Kalman gain in this case is a function of the cross-covariance between the current state and the latency lagged system state at the time the sensor measurement was made, P x     k     {tilde over (y)}     k&#39;n   . This quantity can be calculated using the sigma-point approach if the following state estimate and cross-covariance terms can be maintained accurately during the latency period: 
 
{circumflex over (x)}{overscore ( k )} −n   , P{overscore (     x     )}     k     x     k−n     =E [( x   k   −{circumflex over (x)}{overscore (   k )})( x   k−n   −{circumflex over (x)}{overscore (   k )} −n)   T ]. 
 
 The needed term in the optimal Kalman gain expression is then implicitly calculated using the sigma-point approach as shown in  FIG. 4 . To maintain the correct lagged state and lagged cross-covariance terms, one needs to redefine the state-space model (process and observation equations) used internally by the SPKF is redefined. This is done by first augmenting the system state with the lagged state that must be maintained, i.e., x k   a =[x k   T x l   T ] T . This is done when the lagged sensor makes its measurement, N lat  discrete time periods before the measurement is available at the output of the sensor. The redefined system state-space model is given by:  
               x     k   +   1     a     =     [           f   ⁡     (     x   k     )                 x   l           ]                           y   k     =         h   ⋓     ⁡     (     x   k   a     )       =     {               h   1     ⁡     (     x   k     )             k   ≠     l   +     N   lat                     h   2     ⁡     (     x   l     )             k   ≠     l   +     N   lat               .                   
 
 The top half of the augmented state evolves according to the original nonlinear process model, while the bottom half (system state at measurement instance) is maintained at its initialized value during the latency period. The observation model states that normal (non latency lagged) sensor observations are functions of the normal propagated system state, i.e., h 1 (•), whereas the latency lagged sensor (e.g., GPS), is a function of the bottom part of the augmented state, the lagged (maintained) value, i.e., it uses h 2 (•). By redefining the system models as described above, and applying the normal SPKF filter time- and measurement-update equations throughout the latency period, the predicted augmented system state and covariance will have the following structure when the lagged sensor finally “reports in” at the end of the latency period at l=k−N lat :  
                 x   ^     k     a   -       =     [             x   ^     k   -                 x   ^     l   *           ]                           P     x   k   a     -     =     [           P       x   k     ⁢     x   k       -           P       x   k     ⁢     x   l       -               P       x   l     ⁢     x   k       -           P       x   l     ⁢     x   l       -           ]               
 
 Performing a measurement-update at this point based on the lagged innovation signal will result in the following gain term:  
                 P       x   k   a     ⁢       y   ~     l         =     [           P       x   k     ⁢       y   ~     l                   P       x   l     ⁢       y   ~     l               ]       ,               κ   k     =           P       x   k   a     ⁢       y   ~     l         (     P       y   ~     l       )       -   1       =     [           P       x   k     ⁢       y   ~     l       -           P       y   ~     l       -   1                 P       x   l     ⁢       y   ~     l       -           P       y   ~     l       -   1             ]         ,             
 
 which contains the correct cross-covariance components needed to perform the fusion of the lagged innovation signal with the current system state. After this step, the bottom part of the augmented system state is re-initialized with the correctly updated state estimate, in anticipation of the next lagged-sensor cycle. 
 
         [0057]     The fourth issue is SPKF based quaternion unity norm constraint. As mentioned earlier, the quaternion based attitude formulation has many benefits over an Euler-angle based formulation. These benefits do, however, come with the caveat that the unity norm of the estimated quaternion vector has to be maintained during the estimation process. There is an elegant method available to enforce this unity constraint that is ideally suited to the SPKF framework.  
         [0058]     The pseudo-observation of the quaternion sub-vector of the full state vector is defined as  
                     z   e     =          e        2                 =       e   T     ⁢   e                   =       e   0   2     +     e   1   2     +     e   2   2     +     e   3   2         ,                 (   12   )             
 
 i.e., the squared norm of the quaternion vector is directly observed. This is a pseudo-observation, however, because there is no actual sensor that can measure the norm of the true attitude quaternion. The true attitude quaternion should, however, always have a unity norm so that the observation can be forced at time k to be equal to one, i.e., 
 
z e,k ≡1 
 
 One can now calculate the difference (innovation signal) between the assumed known (observed) quaternion norm and that of the prediction of the observation based on the current estimate of the quaternion, i.e.,  
                       z   ~       e   ,   k       =       z     e   ,   k       -       z   ^       e   ,   k     -                   =     1   -     E   ⁡     [              e   ^     k   -          2     ]                       =     1   -     E   ⁡     [         e   ^       0   ,   k     2     +       e   ^       1   ,   k     2     +       e   ^       2   ,   k     2     +       e   ^       3   ,   k     2       ]           ,                 (   13   )             
 
 and update the vehicle state using a standard Kalman framework measurement update, i.e., 
 
 {circumflex over (x)}   k   ={circumflex over (x)}{overscore (   k )}+ K   e   z   e,k   −{circumflex over (z)}{overscore (   e )} ,k . 
 
 This step can readily be incorporated into the the existing SPKF framework by simply augmenting the observation model with Equation (12) and concatenating the assumed unity observation to the end of the true observation vector. It is also convenient at this point to introduce a synthetic additive observation noise term, n e , into the pseudo-observation equation for the quaternion norm, 
 
 z   e   =∥e∥   2   +n   e , 
 
 where n e  is modeled as a zero-mean Gaussian random variable, i.e., 
 
n e ˜N(n e ;0,σ ne   2 ), 
 
 where σ n     e     2  is the variance. The magnitude of the variance of this synthetic noise term will directly affect the “weighting” that the quaternion norm unity constraint receives in relation to the other observations. If the variance is set to zero, the SPKF will put a large weight (importance) on ensuring that the constraint is met, possibly to the detriment of other components in the state vector estimate. On the other hand, if the variance is set very high, the filter will largely discount the pseudo observation, resulting in poor quaternion regulation. The exact setting of this parameter should thus be determined in relation to the variances of the other observation noise terms in order to find an acceptable trade-off between the two extreme conditions. 
 
         [0059]     Because of the quadratic form of the pseudo-observation nonlinearity, the SPKF (in contrast to the EKF) is ideally suited for this specific method of quaternion norm regulation. The SPKF generates exact results for quadratic nonlinearities, whereas the EKF results for the same nonlinearity are highly biased and inconsistent. Furthermore, the right hand term of Equation (13), E[ê 0,k   2 +ê 1,k   2 +ê 2,k   2 +ê 3,k   2 ], can be calculated accurately at almost no extra computational cost by noticing that  
               E   ⁡     [         e   ^       0   ,   k     2     +       e   ^       1   ,   k     2     +       e   ^       2   ,   k     2     +       e   ^       3   ,   k     2       ]       =       E   ⁡     [       e   ^       0   ,   k     2     ]       +     [       e   ^       1   ,   k     2     ]     +     [       e   ^       2   ,   k     2     ]     +     [       e   ^       3   ,   k     2     ]                   =         σ   ^       e   0     2     +       σ   ^       e   1     2     +       σ   ^       e   2     2     +       σ   ^       e   3     2                     =     trace   ⁢     {     P     e   k       }         ,             
 
 where {circumflex over (σ)} e     i     2  is the variance of the ith component of the quaternion vector and P e     k    is the sub-block of the estimated state covariance matrix that relates to the quaternion sub-vector. In other words 
 
 P   e     k     =E [( e   k   −ê   k )( e   k   −ê   k ) T ], 
 
 where the indexes of the sub-vector estimate (and its covariance) relative to the full state vector estimate and covariance are given by x=[pveb w b a ] T . Based on this result, the quaternion norm pseudo-observation augmentation of the observation model can be implemented without the need to propagate extra sigma-points for the calculation of the predicted observation and its covariance. These values already exist encapsulated and pre-calculated within the prediction of the state and its covariance. This in turn implies that this SPKF-centric quaternion norm regularization method can be implemented at almost no extra computational cost. 
 
       EXPERIMENTAL RESULTS  
       [0060]     The UAV platform is an R/C X-Cell 90 helicopter with custom avionics: Flight computer (300 MHz DSP400), Ashtech-G12 GPS (non-differential), Inertial Sciences ISIS-IMU, Honeywell Barometric altimeter, wireless Ethernet link, and custom servo board. However, to accurately compare the state estimation performance of the SPKF based navigation filter to a state-of-the-art “hand tuned” EKF solution, comparative studies were made using a high-fidelity vehicle simulator. Using a simulation environment for testing allows for repeatable and well controlled comparative experiments. This simulator (designed by MIT) is built around a quaternion based fully nonlinear model of small helicopter dynamics utilizing a 43 dimensional state vector and accounts for most forces and moments acting upon the vehicle. All actuators are also modeled. The model is parameterized by 70 discrete parameters, fit to the true dynamics of vehicle [Gavrilets, V., Mettler, B., and Feron, E., “Nonlinear Model for a Small-Size Acrobatic Helicopter,” in  Proceedings of AIAA Guidance Navigation and Control Conference, Montreal, Canada  (August 2001)]. The vehicle control system makes use of a robust state dependent Ricatti-equation (SDRE) controller [Bogdanov, A., Wan, E. A., Carlsson, M., Zhang, Y., Kieburtz, R., and Baptista, A., “Model Predictive Neural Control of a High Fidelity Helicopter Model,” in  Proceedings of AIAA Guidance Navigation and Control Conference  (2001)].  
         [0061]     Experiment 1: In this experiment, the helicopter was flown in simulation along a complex trajectory that increased in “aggressiveness” over time (e.g., rapid-rise-and-hover, figure-eights, and split-s). A graphical rendering of this trajectory is shown in  FIG. 5 . The SDRE controller used the true known states of the vehicle for the online calculation of the control law, i.e., the SPKF or EKF estimated states were not fed back to the control system. This was done to ensure that the helicopter flew exactly the same flight profile when comparing the estimation performance of the different estimators, and is a main motivation for why the high-fidelity simulation environment is so attractive when comparing different estimation approaches.  
                                                                                           Average RMS Error                position   velocity   Euler angles (degrees)            Algorithm   (m)   (m/s)   roll   pitch   Yaw               EKF   2.1   0.57   0.25   0.32   2.29       SPKF - without LC   1.9 (10%)   0.52 (9%)   0.20 (20%)   0.26 (19%)   1.03 (55%)       SPKF - with LC   1.4 (32%)   0.38 (34%)   0.17 (32%)   0.21 (34%)   0.80 (65%)                  
 
         [0062]     The table above summarizes the average root-mean-square (RMS) estimation errors for the three different state estimators (EKF, SPKF, latency compensated SPKF). The relative error reduction percentage for each of the two SPKF estimators compared to the EKF is shown in parentheses. The results show that, even though the normal SPKF already outperforms the EKF (as expected), correct accounting for GPS latency is well worth the extra effort. The plots of  FIG. 6  show in graphical format the same results as those presented in the table (only the latency compensated SPKF is shown relative to the EKF).  FIG. 6  shows both the average improvement of the SPKF, as well as reduction in maximum error (as seen in “spikes” for the EKF) where the start of an aggressive maneuver excites more nonlinear vehicle dynamics.  
         [0063]     Experiment 2: In this experiment “closing the loop” in the GNC system is accomplished by feeding the estimated states back to the SDRE control system. In other words, the vehicle control commands will now be a function of the estimates generated by either the EKF or SPKF estimator and not of the “true” vehicle states. This mimics (in simulation) the true interdependency between the estimation and control system as would occur in the real flight hardware during a fully autonomous flight. This experiment thus not only indicates the difference in estimation performance between the different filters, but also how that translates into improved or worsened control-performance. The average linear quadratic (LQ) control cost (J LQ ), which is a function of the difference between the desired and achieved state trajectories, is calculated as a measure of control performance.  
         [0064]     For this experiment, the helicopter was commanded to perform an aggressive high speed nose-in turn. This maneuver requires the helicopter to fly along an imaginary circular trajectory while constantly pointing its nose towards the exact center of the circle. Accurate position, velocity, and especially yaw angle estimates are needed to accurately follow the desired flight plan with the desired attitude.  FIG. 7  shows the results of this experiment for both the EKF and SPKF. The desired flight trajectory is indicated by the red curve, the true realized trajectory in blue and the estimated trajectory in green. The true attitude of the helicopter is indicated by periodic renderings of the vehicle itself along the flight path. The left-hand plot shows the results for the EKF, and the right-hand plot shows the results for the SPKF. Clearly for the SPKF case the estimated trajectory is not only close to the true trajectory (small estimation error), but the true trajectory is close to the desired trajectory. This indicates good control performance. The EKF plots clearly shows worse performance according to both these criteria. Also evident from the plots is the much improved yaw angle tracking performance of the SPKF system compared to the EKF system. Not only does the helicopter renderings on the left indicate that their noses are not pointing at the true center of the desired circle, they do not even point to the same point. The SPKF system, on the other hand, does much better in estimating and realizing the correct yaw attitude for this maneuver. Finally, the average control cost of the EKF system for this maneuver was calculated as J LQ =3.30, compared to the J LQ =1.82 of the SPKF based system. This corresponds to a 45% reduction in control cost. These results again confirm the superior performance of the SPKF over the EKF.  
         [0065]     Experiment 3: In this experiment, preliminary results in simulation compare the robustness of the SPKF to IMU degradation.  FIG. 8  shows RMSE performance versus increase in IMU additive noise (standard scaling of additive white Gaussian noise). Highlighted are the nominal performances of an Inertial Sciences ISIS-IMU (cost&gt;10 k, weight=250 g) and the Cloud Cap Crista IMU (cost&lt;2 k, weight=19 g). The Cloud Cap Crista IMU uses MEMs based gyroscopes and accelerometers manufactured by Analog Devises, and have roughly 40 times as much sensor noise as the ISIS-IMU. As indicated by the curves, the performance of the SPKF with the cheaper and less accurate IMU is still superior to the EKF used with the more expensive IMU.  
         [0066]     Actual flight data experiments:  FIG. 9  shows the estimation results of the SPKF compared to the EKF based system on actual test flight telemetry. The UAV was flown under pilot guidance along a complex sweeping S-shaped maneuver until it reached a specified altitude (50 m), at which point the system was switched to fully autonomous flight. The autonomous flight plan entailed holding the UAV steady in hover for a number of seconds, flying the UAV in a square trajectory at a constant altitude of about 55-60 meters, and again holding the UAV steady in hover for a number of seconds before landing. Because there was no ground truth signal available for absolute error comparison the results are evaluated on more subjective terms. A top-down (2D) projection of the estimation results, which is shown in  FIG. 10 , provides good insight for this purpose.  FIG. 10  shows that a significant number of GPS outages occurred during the pilot guided ascent to the hovering altitude (S-shaped curve). Clearly, the SPKF appears to more accurately track the (assumed) true underlying trajectory during this outage period. Coordinates {40-60} of  FIG. 10  indicate that the EKF generated position estimate exhibits an erratic jump just before the GPS measurements again become available.  FIGS. 11A, 11B , and  11 C show the effect of the GPS outages on, respectively, the separate north, east, and down components of the estimated 3D positions. This error results from the inherent nature of the INS solution (derived from integrating the bias compensated IMU gyroscope and accelerometer data) to drift during periods of GPS outage. Since the SPKF performs a more accurate time-update during these outage periods and possibly more accurately tracks the underlying IMU biases than does the EKF, the resulting SPKF estimates are more robust to GPS outages in general.  
         [0067]     Although the above-described preferred embodiment implemented a direct formulation of the kinematics equations, an alternative preferred embodiment of the invention, implements an indirect (error) formulation. In the error formulation, the Kalman filter estimates the errors in the navigation and attitude information. The state variables of the indirect formulation are not position, velocity, and attitude but are the errors in an Inertial Navigation System (INS) computation of position, velocity, and attitude. (The INS uses the direct form of the kinematic equations.) The system observation in the indirect error state formulation is the difference between INS computation and GPS measurements. The error state Kalman filter generates estimates of the errors in the inertial system using external observations that may be updated at a rate much lower than the INS computation rate. This is in contrast to the direct form implementation, which needs to update the filter at the INS rate (e.g., the IMU rate). After each update of the error state Kalman filter with new GPS measurements, the INS is corrected by feedback of the error estimates and the predicted error state is set to zero for the next sample time.  
         [0068]     More specifically, analysis of the indirect formulation starts with the standard Kinematic model used within the INS (inertial navigation system),  
                 ⅆ     ⅆ   t       ⁢   p     =   v                   ⅆ     ⅆ   t       ⁢   v     =         C   b   n     ⁢     f   b       +   g                       ⅆ     ⅆ   t       ⁢     C   b   n       =       C   b   n     ⁡     (       w   nb   b     ×     )         ,             
 
 where C b   n  is the Direction Cosine Matrix (DCM) from the body frame to the navigation frame, i.e., the local NED frame. The angular rate vector of the body frame with respect to the navigation frame projected to the body frame is given by the skew-symmetric matrix of W nb   b ,  
         (       w   nb   b     ×     )     =       (         0         -     w   z             w   y               w   z         0         -     w   x                 -     w   y             w   x         0         )     .         
 
         [0069]     The position and velocity measurement equation for the GPS, taking into account the lever-arm effect is 
 
 p   GPS   =p+C   b   n   r   GPS   +n   GPS   p  
 
 v   GPS   =v+C   b   n   w   nb   b   ×r   GPS   +n   GPS   v ,  (14) 
 
 where r GPS  is the position of the GPS sensors in the body frame and n GPS  is the noise of GPS measurements. 
 
         [0070]     The differences between the INS computations of position, velocity, and quaternion and their true values are 
 
δ p={tilde over (p)}−p  
 
δ v={tilde over (v)}−v  
 
δ q={tilde over (q)}   −1   ·q,  
 
 where ‘˜’ denotes values computed by the INS, and ‘.’ denotes quaternion composition. The quaternion can be decomposed as a scalar and a 3×1 vector  
         δ   ⁢           ⁢   q     =       (       δ   ⁢           ⁢     q   0         δ   ⁢           ⁢   q       )     .         
 
         [0071]     The dynamics for the error states are then given as: 
        1) Position error  
                 ⅆ     ⅆ   t       ⁢   δ   ⁢           ⁢   p     =     δ   ⁢           ⁢   v             (   15   )             
    2) Attitude error (represented in quaternion)  
                 ⅆ     ⅆ   t       ⁢       δ   ⁢           ⁢   q     →       ≈         -       w   ~     nb   b       ×       δ   ⁢           ⁢   q     →       -     0.5   ⁢           ⁢   δ   ⁢           ⁢     w   nb   b                 (   16   )             
    3) Velocity error  
                 ⅆ     ⅆ   t       ⁢   δ   ⁢           ⁢   v     ≈         (     2   ⁢           ⁢         C   ~     b   n     ⁡     (         f   ~     b     ×     )         )     ⁢           ⁢       δ   ⁢           ⁢   q     →       +         C   ~     b   n     ⁢           ⁢   δ   ⁢           ⁢     f   b                 (   17   )             
 
 Because the navigation range of the vehicle is small, the relative motion between the navigation frame and the inertial frame is neglected in the attitude error expression. Approximations stem from neglecting cross-terms of the error states and the measurement uncertainty. The new error state vector is defined as  
       X   =       (           δ   ⁢           ⁢   p               δ   ⁢           ⁢   v                 δ   ⁢           ⁢   q     →           )     .         
       
 
         [0075]     The position, attitude, and velocity error state Expressions (6-8) provide  
                 ⅆ     ⅆ   t       ⁢   X     =         (         0         I   3         0           0       0         2   ⁢           ⁢         C   ~     b   n     ⁡     (       f   ~     b     )                 0       0         -     (         w   ~     nb   b     ×     )             )     ⁢   X     +       (         0       0           0           C   ~     b   n                 -   0.5     ⁢           ⁢     I   3           0         )     ⁢       (           δ   ⁢           ⁢     w   nb   b                 δ   ⁢           ⁢     f   b             )     .                 (   18   )             
 
         [0076]     To specify the observation equation, one may write the estimation of the GPS measurements using the INS computation as 
 
 {tilde over (p)}   GPS   ={tilde over (p)}+{tilde over (C)}   b   u   r   GPS  
 
 {tilde over (v)}   GPS   ={tilde over (v)}+{tilde over (C)}   b   n   {tilde over (w)}   nb   b   ×r   GPS   (19) 
 
         [0077]     Subtracting Equation (14) from Equation (19), and using the definition of the error states, provides  
                   y   =       ⁢       (             p   ~     GPS                 v   ~     GPS           )     -     (           p   GPS               v   GPS           )                   ≈       ⁢         (           I   3         0         2   ⁢           ⁢         C   ~     b   n     ⁡     (       r   GPS     ×     )                 0         I   3           2   ⁢           ⁢         C   ~     b   n     ⁡     (       (         w   ~     nb   b     ×     r   GPS       )     ×     )               )     ⁢   X     -         (           n   p               n   v           )     GPS     .                     (   20   )             
 
         [0078]     Equation (18) and Equation (20) describe the error state dynamics and the state observation, respectively. The EKF or SPKF can then be applied to these system equations. Alternative forms of the error state-space may be obtained by either using Euler angles (instead of quaternions) or using the error of the DCM as a state.  
         [0079]     The preferred embodiment was described with reference to a loosely coupled GPS/INS integration for UAV autonomy. The invention can also be applied to a tightly coupled integration, in which raw satellite data signal transmissions (e.g., pseudo-range code, carrier phase, and Doppler) are integrated directly with the IMU sensors, thereby effectively bypassing the GPS receiver. The observation data from IMU and raw satellite signal transmissions from the GPS contribute to the probabilistic inference system to enable complete estimation of the navigational state of the system, IMU specific ancillary parameters, and GPS specific ancillary parameters.  
         [0080]     The invention can also be applied to only the GPS to integrate raw satellite transmissions in accordance with an SPKF-based approach in contrast to an EKF-based approach. In such an embodiment, the raw satellite signal transmissions are used to estimate a set of navigational state components, including but not limited to, position and velocity information relating to the GPS receiver.  
         [0081]     Although the preferred embodiment was described for an SPKF based probabilistic inference system implemented with the square-root version of CDKF (SR-CDKF) algorithm, other sigma-point approach algorithms can be used. A list of examples of such algorithms includes unscented Kalman filter (UKF) algorithms (Algorithm 1), central difference Kalman filter (CDKF) algorithms (Algorithm 2), square-root version of UKF (SR-UKF) (Algorithm 3), square-root version of CDKF (SR-CDKF) (Algorithm 4), sigma-point particle filter (SPPF) algorithm (Algorithm 5), and Gaussian mixture sigma-point particle filter (GMSPPF) algorithm (Algorithm 6). Each parenthetical reference identifies one of the particular algorithms presented below as a collection of the mathematical algorithms listed above.  
         [0082]     Algorithm 1: The Unscented Kalman Filter (UKF) 
        Initialization: {circumflex over (x)} 0 =E[x 0 , P x     0   =E[(x 0 −{circumflex over (x)} 0 )(x 0 −{circumflex over (x)} 0 ) T ] 
                   x   ^     0   a     =       E   ⁡     [     x   a     ]       =       E   ⁡     [             x   ^     0         0       0         ]       T         ,                 P   0   a     =       E   ⁡     [       (       x   0   a     -       x   ^     0   a       )     ⁢           ⁢       (       x   0   a     -       x   ^     0   a       )     T       ]       =     [           P     x   0           0       0           0         R   v         0           0       0         R   n           ]                 
    For k=1, . . . , ∞: 
            1. Calculate sigma-points: 
 
χ k−1   a   =[{circumflex over (x)}   k−1   a   {circumflex over (x)}   k−1   a   +γ{square root}{square root over (P     k−1           a     )}{circumflex over (x)}   k−1   a   −γ{square root}{square root over (P     k−1           a     )}] 
    2. Time-update equations:  
               𝒳     k   |     k   -   1       x     =     f   ⁡     (       𝒳     k   -   1     x     ,     𝒳     k   -   1     v     ,     u     k   -   1         )                       x   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒳     i   ,     k   |     k   -   1         x                       P     x   k     -     =       ∑     i   =   0       2   ⁢   L       ⁢         w   i     (   c   )       ⁡     (       𝒳     i   ,     k   |     k   -   1         x     -       x   ^     k   -       )       ⁢           ⁢       (       𝒳     i   ,     k   |     k   -   1         x     -       x   ^     k   -       )     T                   
   
            3. Measurement-update equations:  
               𝒴     k   |     k   -   1         =     h   ⁡     (       𝒳     k   |     k   -   1       x     ,     𝒳     k   -   1     n       )                       y   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢     𝒴     i   ,     k   |     k   -   1                             P       y   ~     k       =       ∑     i   =   0       2   ⁢   L       ⁢         w   i     (   c   )       ⁡     (       𝒴     i   ,     k   |     k   -   1           -       y   ^     k   -       )       ⁢       (       𝒴     i   ,     k   |     k   -   1           -       y   ^     k   -       )     T                       P       x   k     ⁢     y   k         =       ∑     i   =   0       2   ⁢   L       ⁢         w   i     (   c   )       ⁡     (       𝒳     i   ,     k   |     k   -   1         x     -       x   ^     k   -       )       ⁢       (       𝒴     i   ,     k   |     k   -   1           -       y   ^     k   -       )     T                       K   k     =       P       x   k     ⁢     y   k         ⁢     P       y   ~     k       -   1                         x   ^     k     =         x   ^     k   -     +       K   k     ⁡     (       y   k     -       y   ^     k   -       )                       P     x   k       =       P     x   k     -     -       K   k     ⁢     P       y   ~     k       ⁢     K   k   T                   
    Parameters: x a =x T v T n T ] T , χ a =[(χ x ) T (χ v ) T (χ n ) T ], T , γ={square root}{square root over (L+λ)}: γ is a composite scaling parameter and λ is given in [0007], L is the dimension of the augmented states, R, is the process-noise covariance, R n  is the observation-noise covariance, and w i  are the weights as calculated in [0007].        
 
         [0089]     Algorithm 2: The Central Difference Kalman Filter (CDKF)—SPKF Formulation 
        Initialization: {circumflex over (x)} 0 =E[x 0 ], p x     0   =E[(x 0 −{circumflex over (x)} 0 )(x 0 −{circumflex over (x)} 0 ) T ]    For k=1, . . . , ∞: 
            1. Calculate sigma-points for time-update:  
                         x   ^       k   -   1       a   v       =     [             x   ^       k   -   1             v   _           ]       ,             P     k   -   1       a   v       =     [           P     x     k   -   1             0           0         R   v           ]                         𝒳     k   -   1       a   v       =     [             x   ^       k   -   1       a   v                 x   ^       k   -   1       a   v       +     h   ⁢       P     k   -   1       a   v                       x   ^       k   -   1       a   v       -     h   ⁢       P     k   -   1       a   v                   ]               
    2. Time-update equations:  
         𝒳     k   |     k   -   1       x     =     f   ⁢           ⁢     (       𝒳     k   -   1     x     ,     𝒳     k   -   1     v     ,     u     k   -   1         )           
           x   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒳     i   ,     k   |     k   -   1         x             
         P     x   k     -     =       ∑     i   =   1     L     ⁢     [           w   i     (     c   1     )       ⁡     (       𝒳     i   ,     k   |     k   -   1         x     -     𝒳       L   +   i     ,     k   |     k   -   1         x       )       2     +         w   i     (     c   2     )       ⁡     (       𝒳     i   ,     k   |     k   -   1         x     +     𝒳       L   +   i     ,     k   |     k   -   1         x     -     2   ⁢           ⁢     𝒳     0   ,     k   |     k   -   1         x         )       2       ]           
    3. Calculate sigma-points for measurement-update:  
                         x   ^       k   |     k   -   1         a   n       =     [             x   ^     k   -           n   _           ]       ,             P     k   |     k   -   1         a   n       =     [           P     x   k     -         0           0         R   n           ]                         𝒳     k   |     k   -   1         a   n       =     [             x   ^       k   |     k   -   1         a   n                 x   ^       k   |     k   -   1         a   n       +     h   ⁢       P     k   |     k   -   1         a   n                       x   ^       k   |     k   -   1         a   n       -     h   ⁢       P     k   |     k   -   1         a   n                   ]               
    4. Measurement-update equations:  
         𝒴     k   |     k   -   1         =     h   ⁡     (       𝒳     k   |     k   -   1       x     ,     𝒳     k   |     k   -   1       n       )           
           y   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒴     i   ,     k   |     k   -   1                   
         P       y   ~     k       =       ∑     i   =   1     L     ⁢     [           ⁢         w   i     (     c   1     )       ⁢           ⁢       (       𝒴     i   ,     k   |     k   -   1           -     𝒴       L   +   i     ,     k   |     k   -   1             )     2       +       w   i     (     c   2     )       ⁢           ⁢       (       𝒴     i   ,     k   |     k   -   1           +     𝒴       L   +   i     ,     k   |     k   -   1           -     2   ⁢           ⁢     𝒴     0   ,     k   |     k   -   1               )     2         ]           
         P       x   k     ⁢     y   k         =           ⁢     =                 w   1     (     c   1     )       ⁢     P     x   k     -         ⁢           [       𝒴       1   :   L     ,     k   |     k   -   1           -     𝒴         L   +   1     :     2   ⁢   L       ,     k   |     k   -   1             ]     T     ⁢     
     ⁢     K   k       =         P       x   k     ⁢     y   k         ⁢     P       y   ~     k       -   1       ⁢           ⁢       x   ^     k       =           x   ^     k   -     +         K   k     ⁡     (       y   k     -       y   ^     k   -       )       ⁢     
     ⁢     P     x   k           =       P     x   k     -     -       K   k     ⁢     P       y   ~     k       ⁢     K   k   T                     
   
            Parameters: x a     v   =[x T v T ] T , χ a     v   =[(χ x ) T (χ v ) T ] T , x a     n   =[x T n T ] T , χ a     n   =[(χ x ) T (χ n ) T ] T , h≧1 is the scalar central difference step size, L is the dimension of the augmented states, R v  is the process-noise covariance, R n  is the observation-noise covariance, and w i  are the weights as calculated in Equation (**). (•) 2  is shorthand for the vector outer product, i.e. a 2 {dot over (=)}aa T .     General note: Here we again augment the system state with the process noise and observation noise vectors (v k  and n k ) as we did for the UKF. For the CDKF, however, we split this augmentation between the time-update and measurement-update, i.e., for the time-update the augmented state vector and augmented covariance matrix is given by  
                 x   k     a   v       =       [           x   k   T           v   k   T           ]     T       ,               P   k     a   v       =     [           P     x   k           0           0         R   v           ]       ,             
 
 and by  
                 x   k     a   n       =       [           x   k   T           n   k   T           ]     T       ,               P   k     a   n       =     [           P     x   k           0           0         R   n           ]       ,             
 
 for the measurement-update.  
                 𝒳   0     =     x   _       ⁢     
     ⁢             𝒳   i     =       x   _     +       (     h   ⁢           ⁢       P   x         )     i                 i   =   1     ,   …   ⁢           ,   L           ⁢     
     ⁢             𝒳   i     =       x   _     -       (     h   ⁢           ⁢       P   x         )     i                 i   =     L   +   1       ,   …   ⁢           ,     2   ⁢   L             ⁢     
     ⁢       w   0     (   m   )       =         h   2     -   L       h   2         ⁢     
     ⁢             w   i     (   m   )       =     1     2   ⁢     h   2                                     ⁢       i   =   1     ,   …   ⁢           ,     2   ⁢   L               ⁢     
     ⁢             w   i     (     c   1     )       =     1     4   ⁢     h   2                               i   =   1     ,   …   ⁢           ,     2   ⁢   L             ⁢     
     ⁢             w   i     (     c   2     )       =         h   2     -   1       4   ⁢     h   4                   i   =   1     ,   …   ⁢           ,     2   ⁢   L                     (*   ⁢   *)             
       
 
         [0098]     Algorithm 3: The Square-Root UKF (SR-UKF)—General State Estimation Form 
        Initialization: {circumflex over (x)} 0 =E[x 0 ], S x     0   =chol{E[(x 0 −{circumflex over (x)} 0 )(x 0 −{circumflex over (x)} 0 ) T ]}, S v ={square root}{square root over (R v )}, S n ={square root}{square root over (R v )} 
                   x   ^     0   a     =       E   ⁡     [     x   a     ]       =       [             x   ^     0         0       0         ]     T         ,                 S   0   a     =       chol   ⁢     {     E   ⁡     [       (       x   0   a     -       x   ^     0   a       )     ⁢       (       x   0   a     -       x   ^     0   a       )     T       ]       }       =     [           S     x   0           0       0           0         S   v         0           0       0         S   n           ]                 
    For k=1, . . . , ∞: 
            1. Calculate sigma-points: 
 
χ k−1   a   =[{circumflex over (x)}   k−1   a   {circumflex over (x)}   k−1   a   +γS   x     k−1     a   {circumflex over (x)}   k−1   a   −γS   x     k−1     a ]
    2. Time-update equations:  
               𝒳     k   |     k   -   1       x     =     f   ⁡     (       𝒳     k   -   1     a     ,     𝒳     k   -   1     v     ,     u     k   -   1         )                       x   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒳     i   ,     k   |     k   -   1         x                       S     x   k     -     =     qr   ⁢           ⁢     {     [         w   1     (   c   )         ⁢     (       𝒳       1   :     2   ⁢   L       ,     k   |     k   -   1         x     -       x   ^     k   -       )       ]     }                     S     x   k     -     =     cholupdate   ⁢           ⁢     {       S     x   k     -     ,       𝒳     0   ,     k   |     k   -   1         x     -       x   ^     k   -       ,     w   0     (   c   )         }                     𝒴     k   |     k   -   1         =     h   ⁢           ⁢     (       𝒳     i   ,     k   |     k   -   1         x     ,     𝒳     k   -   1     n       )                       y   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒴     i   ,     k   |     k   -   1                         
    3. Measurement-update equations:  
               S       y   ~     k       =     qr   ⁢     {     [         w   1     (   c   )         ⁢     (       𝒴       1   :     2   ⁢   L       ,     k   |     k   -   1           -       y   ^     k   -       )       ]     }                     S       y   ~     k       =     cholupdate   ⁢           ⁢     {       S       y   ~     k       ,       𝒴     0   ,     k   |     k   -   1           -       y   ^     k   -       ,     w   0     (   c   )         }                     P       x   k     ⁢     y   k         =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   c   )       ⁢           ⁢     (       𝒳     i   ,     k   |     k   -   1         x     -       x   ^     k   -       )     ⁢           ⁢       (       𝒴     i   ,     k   |     k   -   1           -       y   ^     k   -       )     T                       K   k     =       (       P       x   k     ⁢     y   k         /     S       y   ~     k     T       )     /     S       y   ~     k                         x   ^     k     =         x   ^     k   -     +       K   k     ⁡     (       y   k     -       y   ^     k   -       )                     U   =       K   k     ⁢           ⁢     S       y   ~     k                       S     x   k       =     cholupdate   ⁢           ⁢     {       S     x   k     -     ,   U   ,     -   1       }                 
   
            Parameters: x a =[x T v T n T ] T , χ a =[(χ Z ) T (χ v ) T (χ n ) T ], γ={square root}{square root over (L+λ)}is the composite scaling parameter and λ is given in [0007], L is the dimension of the state, R v  is the process-noise covariance, R n  is the observation-noise covariance, and w i  are the weights as calculated in [0007].        
 
         [0105]     Algorithm 4: The Square-Root CDKF (SR-CDKF)- General State Estimation Form 
        Initialization: {circumflex over (x)} 0 =E[x 0 ], S x     0   =chol{E[(x 0 −{circumflex over (x)} 0 )(x 0 −{circumflex over (x)} 0 ) T ]}, S v ={square root}{square root over (R v )}, S n ={square root}{square root over (R v )}    For k=1, . . . , ∞: 
            1. Calculate sigma points for time-update:  
                         x   ^       k   -   1       a   v       =     [             x   ^       k   -   1             v   _           ]       ,             S     k   -   1       a   v       =     [           S     x     k   -   1             0           0         S   v           ]                         𝒳     k   -   1       a   v       =     [             x   ^       k   -   1       a   v                 x   ^       k   -   1       a   v       +     h   ⁢           ⁢     S     k   -   1       a   v                     x   ^       k   -   1       a   v       -     h   ⁢           ⁢     S     k   -   1       a   v                 ]               
    2. Time-update equations:  
         𝒳     k   |     k   -   1       x     =     f   ⁢           ⁢     (       𝒳     k   -   1     x     ,     𝒳     k   -   1     v     ,     u     k   -   1         )           
           x   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒳     i   ,     k   |     k   -   1         x             
         S     x   k     -     =     qr   ⁢           ⁢     {     [         w   1     (     c   1     )         ⁢           ⁢     (       𝒳       1   :   L     ,     k   |     k   -   1         x     -     𝒳         L   +   1     :     2   ⁢   L       ,     k   |     k   -   1         x       )     ⁢           ⁢       w   1     (     c   2     )         ⁢           ⁢     (       𝒳       1   :   L     ,     k   |     k   -   1         x     +     𝒳         L   +   1     :     2   ⁢   L       ,     k   |     k   -   1         x     -     2   ⁢           ⁢     𝒳     0   ,     k   |     k   -   1         x         )       ]     }           
    3. Calculate sigma-points for measurement update:  
                         x   ^       k   |     k   -   1         a   n       =     [             x   ^     k   -           n   _           ]       ,             S     k   |     k   -   1         a   n       =     [           S     x   k     -         0           0         S   n           ]                         𝒳     k   |     k   -   1         a   n       =     [             x   ^       k   |     k   -   1         a   n                 x   ^       k   |     k   -   1         a   n       +     h   ⁢           ⁢     S     k   |     k   -   1         a   n                     x   ^       k   |     k   -   1         a   n       -     h   ⁢           ⁢     S     k   |     k   -   1         a   n                 ]               
    4. Measurement-update equations:  
         𝒴     k   |     k   -   1         =     h   ⁢           ⁢     (       𝒳     k   |     k   -   1       x     ,     𝒳     k   |     k   -   1       n       )           
           y   ^     k   -     =       ∑     i   =   0       2   ⁢   L       ⁢       w   i     (   m   )       ⁢           ⁢     𝒴     i   ,     k   |     k   -   1                   
         S       y   ~     k       =     qr   ⁢           ⁢     {     [         w   1     (     c   1     )         ⁢           ⁢     (       𝒴       1   :   L     ,     k   |     k   -   1           -     𝒴         L   +   1     :     2   ⁢   L       ,     k   |     k   -   1             )     ⁢           ⁢       w   1     (     c   2     )         ⁢           ⁢     (       𝒴       1   :   L     ,     k   |     k   -   1           -     𝒴         L   +   1     :     2   ⁢   L       ,     k   |     k   -   1           -     2   ⁢           ⁢     𝒴     0   ,     k   |     k   -   1               )       ]     }           
  P   x     k     y   ={square root}{square root over (w     1           (c                 1                 )     )}   S{overscore (     x     )}     k     [y   1:L,k|k−1   −y   L+1:2   L,k|k− 1   ] T  
 
 K   k =( P   x     k     y     k     /S   {tilde over (y)}     k     T )/ S   {tilde over (y)}     k    
 
 {circumflex over (x)}   k   ={circumflex over (x)}{overscore (   k )}+ K   k ( y   k   −ŷ{overscore (   k )}) 
 
 U=K   k   S{tilde over (     y     )}     k    
 
 S   x     k   =cholupdate{ S{overscore (     x     )}     k     , U, − 1}
   
            Parameters: {circumflex over (x)}   v   =[x T v T ] T , χ a     v   =[(χ x ) T (χ v ) T ] T , x a     n   =[x T n T ] T , χ a     n   =[(χ x ) T (χ n ) T ] T , h≧1 is the scalar central difference step size, L is the dimension of the augmented states, R v  is the process-noise covariance R n  is the observation-noise covariance, and w i  are the weights as calculated in Equation (**) (•) 2  is shorthand for the vector outer product.  
                 𝒳   0     =     x   _       ⁢     
     ⁢             𝒳   i     =       x   _     +       (     h   ⁢           ⁢       P   x         )     i                 i   =   1     ,   …   ⁢           ,   L           ⁢     
     ⁢             𝒳   i     =       x   _     -       (     h   ⁢           ⁢       P   x         )     i                 i   =     L   +   1       ,   …   ⁢           ,     2   ⁢   L             ⁢     
     ⁢       w   0     (   m   )       =         h   2     -   L       h   2         ⁢     
     ⁢             w   i     (   m   )       =     1     2   ⁢     h   2                                     ⁢       i   =   1     ,   …   ⁢           ,     2   ⁢   L               ⁢     
     ⁢             w   i     (     c   1     )       =     1     4   ⁢     h   2                               i   =   1     ,   …   ⁢           ,     2   ⁢   L             ⁢     
     ⁢             w   i     (     c   2     )       =         h   2     -   1       4   ⁢     h   4                   i   =   1     ,   …   ⁢           ,     2   ⁢   L                     (*   ⁢   *)             
       
 
         [0113]     Algorithm 5 The Sigma-Point Particle Filter (SPPF)  
         [0114]     The new filter that results from using a SPKF for proposal distribution generation within a particle filter framework is called the sigma-point particle filter (SPPF): 
        Initialization: k=0 
            1. For i=1, . . . , N, draw (sample) particle x 0   (i)  from the prior p(x 0 ).    
            For k=1, 2, . . . 
            1. Importance sampling step    
            For i=1, . . . , N: 
            (a) Update the Gaussian prior distribution for each particle with the SPKF 
                Calculate sigma-points for particle,  
               x     k   -   1       a   ,     (   i   )         =         [           x     k   -   1       (   i   )               v   _       k   -   1               n   _       k   -   1             ]     T     ⁢     :                     𝒳       k   -   1     ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         a   ,     (   i   )         =     [           x     k   -   1       a   ,     (   i   )                 x     k   -   1       a   ,     (   i   )         +     γ   ⁢       P     k   -   1       a   ,     (   i   )                       x     k   -   1       a   ,     (   i   )         -     γ   ⁢           ⁢       P     k   -   1       a   ,     (   i   )                     ]               
    Propagate sigma-points into future (time update):  
               𝒳       k   |     k   -   1       ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         x   ,     (   i   )         =     f   ⁢           ⁢     (       𝒳       k   -   1     ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         x   ,     (   i   )         ,     𝒳       k   -   1     ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         v   ,     (   i   )         ,     u   k       )                       x   _       k   |     k   -   1         (   i   )       =       ∑     j   =   0       2   ⁢   L       ⁢       w   j     (   m   )       ⁢           ⁢     𝒳       k   |     k   -   1       ,   j       x   ,     (   i   )                           P     k   |     k   -   1         (   i   )       =       ∑     j   =   0       2   ⁢   L       ⁢         w   j     (   c   )       ⁡     (       𝒳       k   |     k   -   1       ,   j       x   ,     (   i   )         -       x   _       k   |     k   -   1         (   i   )         )       ⁢           ⁢       (       𝒳       k   |     k   -   1       ,   j       x   ,     (   i   )         -       x   _       k   |     k   -   1         (   i   )         )     T                       𝒴       k   |     k   -   1       ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         (   i   )       =     h   ⁢           ⁢     (       𝒳       k   |     k   -   1       ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         x   ,     (   i   )         ,     𝒳       k   -   1     ,     (     0   ⁢           ⁢   …   ⁢           ⁢   2   ⁢   L     )         n   ,     (   i   )           )                       y   _       k   |     k   -   1         (   i   )       =       ∑     j   =   0       2   ⁢   L       ⁢       W   j     (   m   )       ⁢           ⁢     𝒴     j   ,     k   |     k   -   1           (   i   )                     
    Incorporate new observation (measurement update):  
               P       y   k     ⁢     y   k         =       ∑     j   =   0       2   ⁢   L       ⁢           w   j     (   c   )       ⁡     [       𝒴       k   |     k   -   1       ,   j       (   i   )       -       y   _       k   |     k   -   1         (   i   )         ]       ⁡     [       𝒴       k   |     k   -   1       ,   j       (   i   )       -       y   _       k   |     k   -   1         (   i   )         ]       T                     P       x   k     ⁢     y   k         =       ∑     j   =   0       2   ⁢   L       ⁢           w   j     (   c   )       ⁡     [       𝒳       k   |     k   -   1       ,   j       (   i   )       -       x   _       k   |     k   -   1         (   i   )         ]       ⁡     [       𝒴       k   |     k   -   1       ,   j       (   i   )       -       y   _       k   |     k   -   1         (   i   )         ]       T                     K   k     =       P       x   k     ⁢     y   k         ⁢     P       x   k     ⁢     y   k         -   1                         x   _     k     (   i   )       =         x   _       k   |     k   -   1         (   i   )       +       K   k     ⁡     (       y   k     -       y   _       k   |     k   -   1         (   i   )         )                       P   k     (   i   )       =       P     k   |     k   -   1         (   i   )       -       K   k     ⁢     P       y   k     ⁢     y   k         ⁢     K   k   T                   
   
                (b) Sample x k   (i) ˜q N (x k |y 1:k )=N(x k ; {overscore (x)} k   (i) , P k   (i) )    
            For i=1, . . . , N, evaluate the importance weights up to a normalizing constant:  
         w   k     (   i   )       =       w     k   -   1       (   i   )       ⁢         p   ⁡     (       y   k     |     x   k     (   i   )         )       ⁢           ⁢     p   ⁡     (       x   k     (   i   )       |     x     k   -   1       (   i   )         )             q   𝒩     ⁡     (       x   k     (   i   )       |     y     1   :   k         )               
    For i=1, . . . , N, normalize the importance weights: {tilde over (w)} k   (i)=w   k   (i) /Σ j=1   N w k   (j) .     2. Selection step (resampling) 
            Multiply/suppress samples x k   (i)  with high/low importance weights {tilde over (w)} k   (i) , respectively, to obtain N random samples approximately distributed according to p(x k |y 1:k )     For i=1, . . . , N, set w k   (i)={tilde over (w)}   k   (i =N −1 .     (optional) Do a single MCMC (Markov chain Monte Carlo) move step to add further ‘variety’ to the particle set without changing their distribution.    
            3. Output: The output of the algorithm is a set of samples that can be used to approximate the posterior distribution as follows:  
           p   ^     ⁡     (       x   k     |     y     1   :   k         )       =       1   N     ⁢           ⁢       ∑     i   =   1     N     ⁢       δ   ⁡     (       x   k     -     x   k     (   i   )         )       .             
 
 From these samples, any estimate of the system state can be calculated, such as the MMSE estimate,  
           x   ^     k     =       E   ⁡     [       x   k     |     y     1   :   k         ]       ≈       1   N     ⁢       ∑     i   =   1     N     ⁢       x   k     (   i   )       .               
     Similar expectations of the function g(x k ) (such as MAP estimate, covariance, skewness, etc.) can be calculated as a sample average.     General note: In the resampling stage, not only the particles but also their respective SPKF propagated means and covariances are discarded or duplicated, i.e., we&#39;re resampling the whole parallel ensemble of SPKFs. The SPPF presented above makes use of a UKF for proposal generation. Our preferred form however, is a SPPF based around the square-root CDKF (SR-CDKF).        
 
         [0134]     The UKF was used in the pseudo-code above in order to simplify the presentation of the algorithm.  
         [0135]     Algorithm 6: The Gaussian Mixture Sigma-Point Particle Filter (GMSPPF)  
         [0136]     The full GMSPPF algorithm will now be presented based on the component parts discussed above. As a graphical aid to understand this algorithm, please refer to the schematic presented in  FIG. 12 .  
         [0137]     A) Time Update and Proposal Distribution Generation  
         [0138]     At time k−1, assume the posterior state density is approximated by the G-component GMM  
               p   ~     G     ⁡     (       x     k   -   1       |     y     1   :     k   -   1           )       =       ∑     ℊ   =   1     G     ⁢         α   ~       k   -   1       (   ℊ   )       ⁢           ⁢   𝒩   ⁢           ⁢     (         x     k   -   1       ;       μ   ~       k   -   1       (   ℊ   )         ,       P   ~       k   -   1       (   ℊ   )         )           ,       
 
 and the process and observation noise densities are approximated by the following I and J component GMMs respectively  
                 p   𝒢     ⁡     (     v     k   -   1       )       =       ∑     i   =   1     I     ⁢       β     k   -   1       (   i   )       ⁢           ⁢   𝒩   ⁢           ⁢     (         v     k   -   1       ;     μ     v   ,     k   -   1         (   i   )         ,     Q     k   -   1       (   i   )         )                         p   𝒢     ⁡     (     n   k     )       =       ∑     j   =   1     J     ⁢       γ   k     (   j   )       ⁢           ⁢   𝒩   ⁢           ⁢     (         n   k     ;     μ     n   ,   k       (   j   )         ,     R   k     (   j   )         )                   
 
         [0139]     Following the GSF approach of [3], but replacing the EKF with a SPKF, the output of a bank of G″=GIJ parallel SPKFs are used to calculate GMM approximations of p(x k |y 1:k−1 ) and p(x k |y 1:k ) according to the pseudo-code given below. For clarity of notation define 
 
 g′=g+ ( i− 1) G,  
 
 noting that references to g′ implies references to the respective g and i, since they are uniquely mapped. Similarly define 
 
 g″=g′+ ( j− 1) GI,  
 
 with the same implied unique index mapping from g″ to g′ and j. The time-update now proceeds as follows:  
           1.             For   ⁢           ⁢   j     =     1   ⁢           ⁢   …   ⁢           ⁢   J       ,       set   ⁢           ⁢         p   ~     ⁡     (     n   k     )         (   j   )         =       𝒩   ⁡     (         n   k     ;     μ     n   ,   k       (   j   )         ,     R   k     (   j   )         )       .                                   For   ⁢           ⁢   i     =     1   ⁢           ⁢   …   ⁢           ⁢   I       ,       set   ⁢           ⁢         p   ~     ⁡     (     v     k   -   1       )         (   i   )         =     𝒩   ⁢           ⁢     (         v     k   -   1       ;     μ     v   ,     k   -   1         (   i   )         ,     Q     k   -   1       (   i   )         )                                     For   ⁢           ⁢   ℊ     =     1   ⁢           ⁢   …   ⁢           ⁢   G       ,       set   ⁢           ⁢         p   ~     ⁡     (       x     k   -   1       |     y     1   :     k   -   1           )         (   ℊ   )         =     𝒩   ⁢           ⁢       (         x     k   -   1       ;       μ   ~       k   -   1       (   ℊ   )         ,       P   ~       k   -   1       (   ℊ   )         )     .                   
        2. For g′=1 . . . G′ use the time update step of a SPKF (employing the DSSM process equation x k =f(x k−1 , v k−1 , u k−1 ) and densities {tilde over (p)}(x k−1 |y 1:k−1 ) (g)  and {tilde over (p)}(v k−1 ) (i)  from above) to calculate a Gaussian approximate predictive prior density  
               p   ~     ⁡     (       x   k     |     y     1   :     k   -   1           )         (     ℊ   ′     )       =     𝒩   ⁢           ⁢     (         x   k     ;     μ     k   |     k   -   1         (     ℊ   ′     )         ,     P     k   |     k   -   1         (     ℊ   ′     )         )         ,       
            and update the mixing weights:  
         α     k   |     k   -   1         (     ℊ   ′     )       =           α     k   -   1       (   ℊ   )       ⁢     β     k   -   1       (   i   )             ∑     ℊ   =   1     G     ⁢       ∑     i   =   1     I     ⁢       α     k   -   1       (   ℊ   )       ⁢     β     k   -   1       (   i   )               .         
   
            [3] A LSPACH , D. L., AND S ORENSON , H. W. Nonlinear Bayesian Estimation using Gaussian Sum Approximation.  IEEE Transactions on Automatic Control  17, 4 (1972), 439-448.     3. For g″=1 . . . . G″, complete the measurement update step of each SPKF (employing the DSSM observation equation y k =h(x k , n k ), the current observation y k , and densities {tilde over (p)}(x k |y 1:k−1 ) (g′)  and p(n k ) (j)  from above) to calculate a Gaussian approximate posterior density 
 
 {tilde over (p)} ( x   k   |y   1:k ) (g″)   =N ( x   k ;μ k   (g″)   ,P   k   (g″) ), 
 
 and update the GMM mixing weights:  
           α   k     (     ℊ   ″     )       =         α     k   |     k   -   1         (     ℊ   ′     )       ⁢     γ   k     (   j   )       ⁢     z   k     (   j   )             ∑       ℊ   ′     =   1       G   ′       ⁢       ∑     j   =   1     J     ⁢       α   k     (     ℊ   ′     )       ⁢           ⁢     γ   k     (   j   )       ⁢           ⁢     z   k     (   j   )                 ,       
 
 where z k   (j) =p j (y k |x k ) is the observation likelihood evaluated at x k =μ k   (g′)  and the current observation, y k . 
       
 
         [0144]     The predictive state density is now approximated by the following GMM:  
           p   𝒢     ⁡     (       x   k     |     y     1   :     k   -   1           )       =       ∑       ℊ   ′     =   1       G   ′       ⁢       α     k   |     k   -   1         (     ℊ   ′     )       ⁢           ⁢   𝒩   ⁢           ⁢     (         x   k     ;     μ     k   |     k   -   1         (     ℊ   ′     )         ,     P     k   |     k   -   1         (     ℊ   ′     )         )             
 
 and the posterior state density (which will only be used as the proposal distribution in the IS-based measurement update step) is approximated by the following GMM:  
           p   𝒢     ⁡     (       x   k     |     y     1   :   k         )       =       ∑       g   ″     =   1       G   ″       ⁢       α   k     (     ℊ   ″     )       ⁢           ⁢   𝒩   ⁢           ⁢       (         x   k     ;     μ   k     (     ℊ   ″     )         ,     P   k     (     ℊ   ″     )         )     .             
 
         [0145]     B) Measurement Update  
         [0146]     1. Draw N samples {x k   (i); i= 1 . . . N} from the GMM proposal distribution p G (x k |y 1:k ) and calculate their corresponding importance weights:  
           w   ~     k     (   i   )       =           p   ⁡     (       y   k     |     x   k     (   i   )         )       ⁢           ⁢       p   𝒢     ⁡     (       x   k     (   i   )       |     y     1   :     k   -   1           )             p   𝒢     ⁡     (       x   k     (   i   )       |     y     1   :   k         )         .         
 
         [0147]     2. Normalize the weights:  
         w   k     (   i   )       =           w   ~     k     (   i   )           ∑     i   =   1     N     ⁢       w   ~     k     (   i   )           .         
 
         [0148]     3. Use one of the following approaches to fit a G-component GMM to the set of weighted particles {w k   (i) , x k   (i); i= 1 . . . N}, representing the updated GMM approximate state posterior distribution at time k, i.e.  
             p   ~     𝒢     ⁡     (       x   k     |     y     1   :   k         )       =       ∑     ℊ   =   1     G     ⁢         α   ~     k     (   ℊ   )       ⁢           ⁢   𝒩   ⁢           ⁢       (         x   k     ;       μ   ~     k     (   ℊ   )         ,       P   ~     k     (   ℊ   )         )     .             
 
         [0149]     (Option A) First resample the set of weighted particles into a new set of N equally weighted particles using any of the efficient resampling techniques 8  known and then apply an expectation-maximization (EM) algorithm to this new cloud of samples approximating the posterior density.    8 Our preferred method is gradual resampling [188, 46].    
         [0150]     (Option B) Directly apply a weighted expectation-maximization (WEM) algorithm [132] to the weighted set of particles to recover the GMM posterior.  
         [0151]     For both cases, the EM/WEM algorithm is “seeded” by the G means, covariances and mixing weights of the prior state GMM, p G (x k−1 |y 1:k−1 ), and iterated until a certain convergence criteria (such as relative dataset likelihood increase) is met. Convergence usually occur within 4-6 iterations. Alternatively, as discussed earlier, an adaptive model-order-selection EM/WEM approach can be used to adaptively determine the optimal number of Gaussian component densities needed in the posterior GMM to accurately model the posterior cloud of samples.  
         [0152]     C) Inference  
         [0153]     Once the full posterior state density has been calculated in the previous step, any “optimal” estimate of the underlying system state can be calculated. These include estimates such as the condition mean (MMSE), maximum a-posteriori (MAP), mode, median, etc. to name but a few. As an example, we present the MMSE estimate: 
    [132] M C L ACHLAN , G.,  AND  K RISHNAN , T.  The EM Algorithm and Extensions . Wiley, 1997.    
 
         [0155]     The conditional mean state estimate 
 
 {circumflex over (x)}   k   =E[x   k   |y   1:k ], 
 
 and the corresponding error covariance 
 
 {circumflex over (P)}   k   =E [( x   k   −{circumflex over (x)}   k )( x   k   −{circumflex over (x)}   k ) T ], 
 
 can be calculated in one of two ways: 
 
         [0156]     (Option A) The estimates can be calculated before the EM/WEM smoothing stage by a direct weighted sum of the particle set,  
               x   ^     =       ∑     i   =   1     N     ⁢       w   k     (   i   )       ⁢           ⁢     x   k     (   i   )                             P   ^     k     =       ∑     i   =   1     N     ⁢       w   k     (   i   )       ⁢           ⁢     (       x   k     (   i   )       -       x   ^     k       )     ⁢           ⁢       (       x   k     (   i   )       -       x   ^     k       )     T           ,             
 
         [0157]     (Option B) or after the posterior GLiM has been fitted,  
                 x   ^     k     =       ∑     g   =   1     G     ⁢         α   ~     k     (   g   )       ⁢           ⁢       μ   ~     k     (   g   )                           P   ^     k     =       ∑     g   =   1     G     ⁢           α   ~     k     (   g   )       ⁢           [       P   k     (   g   )       +       (         μ   ~     k     (   g   )       -       x   ^     k       )     ⁢           ⁢       (         μ   ~     k     (   g   )       -       x   ^     k       )     T         ]     .                 
 
         [0158]     Since N         G, the first approach (Option A) is computationally more expensive than the second, but possibly generates better (lower variance) estimates, since it calculates the estimates before the implicit resampling of the WEM step. The choice of which method to use will depend on the specifics of the inference problem and is an ongoing research question.  
         [0159]     It will be obvious to those having skill in the art that many changes may be made to the details of the above-described embodiments without departing from the underlying principles of the invention. The following are several examples of such changes.  
         [0160]     Although the preferred embodiment estimated a single time-varying IMU gyroscope rate bias vector, the invention can also be applied to estimate IMU scale and alignment parameters. Additional parameters are augmented into the state vector.  
         [0161]     Although the preferred embodiment neglected the effects resulting from the rotational rate of the earth as measured in the navigation frame (Coriolis effect), the invention can also be applied to account for these effects by appropriate modification of the kinematics equations.  
         [0162]     Although the preferred embodiment used a quaternion representation of the attitude, the invention can also be applied to other attitude representations such as standard Euler angles.  
         [0163]     Although the preferred embodiment used a Lagrange approach to maintain unity norm on the quaternion, the constraint may also be accomplished by estimating and updating an error quaternion.  
         [0164]     The scope of the present invention should, therefore, be determined only by the following claims.