Next Article in Journal
On Hermite Functions, Integral Kernels, and Quantum Wires
Next Article in Special Issue
Set-Based B-Series
Previous Article in Journal
Risk Propagation and Supply Chain Health Control Based on the SIR Epidemic Model
Previous Article in Special Issue
Proving Feasibility of a Docking Mission: A Contractor Programming Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Reliability Assessment of an Unscented Kalman Filter by Using Ellipsoidal Enclosure Techniques

1
Group: Distributed Control in Interconnected Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany
2
Institute of System Dynamics, University of Applied Sciences Konstanz, D-78462 Konstanz, Germany
3
Lab-STICC, ENSTA Bretagne, 29806 Brest, France
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(16), 3011; https://doi.org/10.3390/math10163011
Submission received: 1 August 2022 / Revised: 14 August 2022 / Accepted: 18 August 2022 / Published: 21 August 2022
(This article belongs to the Special Issue Set-Based Methods for Differential Equations and Applications)

Abstract

:
The Unscented Kalman Filter (UKF) is widely used for the state, disturbance, and parameter estimation of nonlinear dynamic systems, for which both process and measurement uncertainties are represented in a probabilistic form. Although the UKF can often be shown to be more reliable for nonlinear processes than the linearization-based Extended Kalman Filter (EKF) due to the enhanced approximation capabilities of its underlying probability distribution, it is not a priori obvious whether its strategy for selecting sigma points is sufficiently accurate to handle nonlinearities in the system dynamics and output equations. Such inaccuracies may arise for sufficiently strong nonlinearities in combination with large state, disturbance, and parameter covariances. Then, computationally more demanding approaches such as particle filters or the representation of (multi-modal) probability densities with the help of (Gaussian) mixture representations are possible ways to resolve this issue. To detect cases in a systematic manner that are not reliably handled by a standard EKF or UKF, this paper proposes the computation of outer bounds for state domains that are compatible with a certain percentage of confidence under the assumption of normally distributed states with the help of a set-based ellipsoidal calculus. The practical applicability of this approach is demonstrated for the estimation of state variables and parameters for the nonlinear dynamics of an unmanned surface vessel (USV).

1. Introduction

Stochastic filtering approaches are widely used in the context of state estimation for dynamic systems for which not all state variables are measured directly [1,2,3,4,5,6,7]. Under the assumption of observability [8,9] (which can partially be relaxed to detectibility), they can be applied effectively to reconstruct non-measurable state variables and to suppress the effects of measurement noise in a model-based manner. Moreover, the model-based nature of these approaches helps to reduce lag effects that are unavoidable if pure signal-based filtering techniques (e.g., low-pass filtered numerical differentiations) are used instead. However, appropriate stochastic filtering approaches need to be chosen with care due to the fact that the exact computation of probability densities is only possible under specific assumptions [5,6]. The practically most relevant scenario, in which the analytic computation is possible, is the case of linear state equations with normally distributed additive process noise and linear measurement models, again including additive Gaussian disturbances. Then, the application of Bayes’ theorem during both the state prediction (i.e., the temporal forecast of the probability density from one discretization point to the next with the help of the dynamic system model) and the innovation stage (correction of the predicted information with the help of the newly available measurements) leads again to normally distributed information. This scenario corresponds to the case of the classical Kalman Filter (KF) with closed form expressions for the probability densities in both aforementioned stages [10]. Due to the fact that normal distributions are uniquely defined by their expected values and covariance matrices, the KF represents a kind of state observer in which closed-form update rules for the covariance matrices lead to time-varying observer gains that are used to correct the state estimates in the innovation stage.
However, most real-life system models involve nonlinearities, due to which the exact computation of probability densities becomes either increasingly complex in each subsequent discretization step, or even impossible [11]. Therefore, typical approximations assume that—despite nonlinear effects—the state variables are still approximated with the help of normal distributions. This approximation can be achieved either by first-order Taylor linearizations of the state-space representation (leading to the EKF) or by selecting so-called sigma points with the help of a deterministic algorithm to approximate the expected values and covariances (leading to the UKF) [12,13,14]. The latter does not only find its use in the state estimation of dynamic systems in the frame of control design, but can also be applied for analyzing the effects of nonlinearities and noise in more general measurement and signal processing tasks.
The EKF and UKF fail, however, to provide reliable state estimates as soon as the true probability densities deviate significantly from a Gaussian density function, due to, for example, asymmetries, multi-modalities, or even a bounded support of the density function. Then, approaches such as Gaussian mixture filtering (basically employing a bank of individual EKFs or UKFs evaluated in parallel after splitting probability densities with wide covariances) [15,16,17,18], particle filtering [19], and the application of linear filters after embedding the nonlinear system dynamics into higher dimensional linear models by using approaches of Carleman linearization or Koopman embedding, are possible ways how to solve the filtering task alternatively [20,21].
However, the a priori detection of a failure of the EKF or UKF is not at all trivial and is commonly only done by firstly applying those simple filtering approaches and subsequently noticing that estimates for expected values do not converge to the true states, that variances become implausibly large or small, or that the predicted state information and measured state vector components seem to deviate to an extreme extent. To avoid such trial-and-error strategies, it is possible to use set-valued computations to determine outer bounds for selected confidence levels when propagating normally distributed input quantities through nonlinear system models [22]. In particular, the use of techniques for an ellipsoidal calculus is promising because iso-lines of a normally distributed probability density correspond to quadratic forms in the state vector that equally define ellipsoids. In recent work, a computationally efficient approach for performing state estimation with the help of ellipsoids has been developed for a purely set-valued uncertainty representation. This approach has recently also been extended to the domain of mixed uncertainty models in the frame of iterative learning state estimation [23].
In the current paper, we adopt the ellipsoidal state estimation approach so that it can be used to quantify outer bounds of specific confidence domains within which the results of the nonlinear filtering problem at hand needs to be included with certainty. Cases in which stochastic estimates (determined, e.g., by the UKF) violate these bounds more often than expected by the specified confidence level can be classified as unreliable. Analogously, stochastic estimates may become overly optimistic if their corresponding confidence bounds are much tighter than the respective ellipsoidal domains.
This paper is structured as follows. Section 2 gives an overview of the basic modeling of USVs, which serve as the benchmark application in this paper for a reliability analysis of UKF techniques with the help of an ellipsoidal state enclosure approach. Section 3 summarizes the applied UKF implementation, before details about a stochastic interpretation of ellipsoidal state enclosure techniques are given in Section 4. Section 5 summarizes the simulation results before conclusions and an outlook on future work are given in Section 6.

2. Modeling the Dynamics of USVs

The modeling of USVs is briefly discussed in this section as a representative application scenario for which stochastic state estimation schemes are typically applied to reconstruct velocity information and external disturbances by means of measurements of selected state vector components. Typically, these components are the position variables in an earth-fixed coordinate frame that can be determined by means of GPS (global positioning system).

2.1. Dynamic Equations

Throughout this paper, a model with three degrees of freedom (DOF) is used to describe the USV dynamics. It is assumed that in the considered scenario, the motion in terms of roll, pitch, and heave has no significant influence on the maneuvering dynamics of the USV. Therefore, the equations of motion can be written in the form [24,25]
M ν ˙ + C R B ( ν ) ν + N ( ν ) ν = τ c .
The translational velocities, expressed in the body-fixed frame in surge and sway, and the rate of rotation in yaw, are expressed by the velocity vector ν = u v r T , which represents the velocities (surge and sway velocities and yaw rate) in the three DOF of the system dynamics. The corresponding coordinate systems are shown in Figure 1. The forces in x b and y b directions and the moment with respect to the yaw axis provided by the actuators are combined in τ c = X Y N T .
The mass matrix
M = m X u ˙ 0 0 0 m Y v ˙ m x g Y r ˙ 0 m x g N v ˙ J z z N r ˙
takes into account the inertia of the rigid body and additional hydrodynamic masses. Coriolis and centripetal terms are summarized in the matrix
C R B = 0 m r m x g r m r 0 0 m x g r 0 0 .
The final term
N ( ν ) ν = X u u X | u | u | u | u + X v r v r + X r r r 2 Y v v Y | v | v | v | v + Y u r u r N r r N | r | r | r | r + N u v u v + N u r u r
on the left-hand side of the dynamic system model (1) accounts for hydrodynamic damping, including coupling effects. For a list of all parameters included in the equations above, and those used in the following subsections, see Table 1.

2.2. Propulsion

The propulsion system of the USV consists of two fixed jet thrusters arranged in a differential setup (Figure 1). The thrust force of the jet thrusters is described by the expression
F i = c 1 , i ρ d p 4 n i | n i | c 2 , i ρ d p 3 u a i | n i | , i { p o r t , s t a r } ,
where n i is the rotational speed of the respective propeller and u a i the longitudinal velocity of the corresponding jet thruster through the water. Further, d p is the diameter of the propeller and ρ the water density. The thrust parameters c 1 , i and c 2 , i are assumed to be constant for each operation regime. Four operation regimes are assumed which are defined in terms of the sign of both n i and u a i . This so-called four-quadrant model is given by
c 1 , i c 2 , i = a 1 , i b 1 , i T n i 0 u a i 0 a 1 , i 0 T n i 0 u a i < 0 a 2 , i 0 T n i < 0 u a i 0 a 2 , i b 2 , i T n i < 0 u a i < 0
with the constant parameters a 1 , i , a 2 , i , b 1 , i , and b 2 , i . For a more detailed discussion on the propulsion model, the reader is referred to [26].
Since the propulsion system is set up differentially, the velocities u a i are usually different if the USV changes its orientation. With the help of l y , describing the distance between both thrusters, cf. Figure 1, the velocity of the portside thruster ( u a p o r t ) and the velocity of the starboard thuster ( u a s t a r ) are expressed as
u a p o r t = u + l y r and u a s t a r = u l y r
in terms of the velocity u in surge and the yaw rate r.
Finally, the input vector containing the force in the direction of motion and the yaw moment results in
τ c = T F p o r t F s t a r = T f ( u ) ,
with the configuration matrix
T = 1 1 0 0 l y l y .

2.3. Parameter Values

As can be seen in Equations (2)–(4) and (6), a total of 22 parameters are included in the model. The number of parameters can be reduced if a specific USV is considered. Here, the overall mass m = 33 kg of the USV and the distance x g = 0 are assumed to be known a priori. Further, due to the cylindrical shape of the hull of the USV, the commonly used assumption X u ˙ = 0.05 · m is made [25]. Due to the additional assumption that the velocity in sway direction is fairly small, the quadratic damping parameter Y | v | v can be neglected.
The remaining parameters
θ 1 = ( J c o m b , Y r ˙ , N v ˙ , X u , Y v , N r , X | u | u , N | r | r , X v r , X r r , Y u r , N u v , N u r ) , θ 2 = ( a 1 , a 2 , b 1 ) ,
can be determined by means of numerical optimization with the help of experimental data that are gathered during dedicated driving maneuvers. A further parameter reduction can be performed using sensitivity and correlation analysis. The process of the parameter identification and reduction of the number of parameters to be identified are described in detail for a specific USV in [27]. The parameters obtained during this identification process are listed in Table 2. Note that all parameters not listed explicitly in the table or in the preceding text are set to zero in the remainder of this article.

2.4. Temporal Discretization and Definition of an Augmented Set of State Equations

To use the dynamic equations of the USV in a discrete-time simulation and state estimation environment with constant sampling period T s , the forward Euler discretization approach is used. The assumption of sufficiently small step sizes, and thus, negligible time discretization errors, leads to the transition equation given by
x s , k + 1 = x s , k + T s f s ( x s , k , n p o r t , k , n s t a r , k )
with the state x s = x y ψ u v r T of the USV and
f s ( x s , n p o r t , n s t a r ) = J ν M 1 τ c ( n p o r t , n s t a r ) C R B ( ν ) ν N ( ν ) ν
as the first-order set of state equations, including the kinematic transformation matrix
J = cos ψ sin ψ 0 sin ψ cos ψ 0 0 0 1 .
In the further course of this work, a total of four parameters of the propulsion system are assumed to be imprecisely known so that they have to be estimated in addition to the USV state by using the available position measurements. Therefore, the state equation is augmented by introducing a four-component integrator disturbance model according to
f ( x s , n p o r t , n s t a r ) = f s ( x s , n p o r t , n s t a r ) 0 4 × 1 ,
after appending the parameters p 1 , i and p 2 , i , i { p o r t , s t a r } , to the state vector x s , k , which allow for replacing the parameters c 1 , i c 2 , i T of the four-quadrant model (6) with the multiplicative uncertainty representation c 1 , i · p 1 , i c 2 , i · p 2 , i T .

2.5. Measurement Model

For the state estimation, the absolute position coordinates x and y are measured in the earth-fixed coordinate frame, for example, by using GPS. Since both values are assumed to be affected by zero-mean white Gaussian noise, the measurement model is given by
z x = x + w 1 z y = y + w 2 ,
where w i N ( w i ; 0 , σ ) with the coordinate-independent scalar standard deviation σ .

2.6. Tracking Control Using an Artificial Potential Field Approach

The tracking controller based on an artificial potential field approach [28,29,30] was taken from [31]. The approach is described below for completeness. In general, the artificial potential field method has its foundations in the area of robotics. There, it was originally developed as a tool for path and motion planning. In the artificial potential field approach, attracting potentials are introduced for the target states to be reached, and repelling potentials are employed to avoid collisions with obstacles. The references mentioned above represent generalizations of this approach for control purposes, especially with respect to the definition of an attracting potential for the desired trajectory that is to be tracked by the controller.
The control law is given by
F ˜ d , i = ( K 0 K P , i ( a r g ( ω ) ψ ) + K D , i ψ ˙ ) ω 2 , i { p o r t , s t a r } ,
where the desired thrust levels F ˜ d , i of the portside and starboard propellers ( i { p o r t , s t a r } ) are saturated to only forward thrusts up to F d , m a x , using the relation
F d , i = 0 if F ˜ d , i 0 F d , m a x if F ˜ d , i F d , m a x F ˜ d , i else .
The gains in (16) were experimentally tuned and satisfy the relations
K 0 > 0 , K P , p o r t = K P , s t a r and K D , p o r t = K D , s t a r .
The amplitude ω in (16) is the Euclidian vector norm ω = w of the input vector
w = γ y ˙ d ( y d y ) + y ˙ d
depending on the earth-fixed position vector of the USV y = x y T , the desired position vector y d , the desired velocity vector y ˙ d , and the tuning parameter γ . Finally, to obtain the desired speeds of the propellers, Equation (5) needs to be inverted using the desired thrusts from the controller. Since b 1 and b 2 are zero and only positive thrusts are allowed (cf. (17)), the rotational speed of the propellers can be calculated using the relation
n i = F i c 1 ρ d p 4 , i { p o r t , s t a r } .

3. UKF State Estimation

The nonlinear ship model presented in Section 2 is used in combination with the linear measurement model (15) to perform a model-based reconstruction of velocity information and to reconstruct the multiplicative parameter uncertainty, mentioned in the previous section. To deal with the corresponding nonlinearities, a UKF state prediction [12,14] is used, and for the update step, a linear Kalman filter update is sufficient.
It is assumed that the posterior is given as a Gaussian with mean x k 1 | k 1 and covariance matrix P k 1 | k 1 . Since the number of elements of the augmented state is n = 10 (including the multiplicative disturbance parameters; cf. Equation (14)), a total number of 2 n + 1 = 21 sigma points are used for the prediction. The sigma points are calculated as follows [14] (p. 155):
X 0 = x k 1 | k 1 , X i = x k 1 | k 1 + ( n + λ ) P k | k i T i = 1 , , n , X i = x k 1 | k 1 ( n + λ ) P k | k i n T i = n + 1 , , 2 n ,
with the scaling parameters λ and ( n + λ ) P k | k i as the ith row of the matrix square root [14] (p. 155). In addition, each sigma point has a corresponding weight. The weights are given by [14] (p. 155):
W 0 ( m ) = λ n + λ , W 0 ( c ) = λ n + λ + ( 1 α 2 + β ) , W i ( m ) = W i ( c ) = 1 2 ( n + λ ) i = 1 , , 2 n ,
with λ = α 2 ( n + κ ) n . For the tuning parameters, we chose α = 0.01 , β = 3 , and κ = 0 . A detailed explanation of the tuning parameters is given in [14] (p. 155).
Following the generation of these sigma points in each discretization step, they can be predicted using the nonlinear transition equation
Y i = X i + T s f ( X i )
corresponding to the augmented discrete-time system model that includes the expression (14). Afterwards, the set of sigma points is used to approximate the true probability density by a Gaussian with mean
x k | k 1 i = 0 2 n W i ( m ) Y i
and covariance
P k | k 1 i = 0 2 n W i ( c ) Y i x k | k 1 Y i x k | k 1 T + Q k .
As the measurement model (15) is linear with additive Gaussian noise, the measurement errors are Gaussian as well. Thus, the standard Kalman filter update
z k | k 1 = H k x k | k 1 ,
S k | k 1 = H k P k | k 1 H k T + R k ,
K k = P k | k 1 H k T S k | k 1 1 ,
x k | k = x k | k 1 + K k z k z k | k 1 ,
P k | k = P k | k 1 K k H k P k | k 1
can be used to evaluate the innovation step as soon as measured data are available at the time instant k.

4. Ellipsoidal Enclosure Approach for Bounding Confidence Regions

Set-valued simulation and estimation techniques provide the possibility to propagate bounded domains of possible state variables over time through a dynamic system model and to fuse those propagated domains with domains that are compatible with measured information by using set-based intersection operations. A possible implementation of this kind of estimation scheme is given by the tube arithmetic approach detailed in [32,33]. To obtain bounds that contain all reachable domains in the state space with certainty, it is necessary that uncertain system parameters, initial conditions, and external disturbances are bounded by appropriate domains, such as intervals, zonotopes, polytopes, or ellipsoids [34,35,36,37].
To bridge the gap between stochastic and purely set-valued estimation schemes, it was shown in [22] that ellipsoidal estimation approaches can also be used to analyze the reliability of linearization-based stochastic estimators (such as the Extended Kalman Filter) and to compute outer bounds of confidence regions of a certain probability if uncertain state information is described by means of normally distributed probability density functions.
This approach, discussed in [22] for the state prediction, is extended in the following to obtain a complete filter approach that comprises also an innovation stage in which results with a specific confidence level are computed.

4.1. Ellipsoidal Prediction of Confidence Bounds

To use the ellipsoidal calculus approach from [22,38] for the prediction of covariance matrix bounds, assume a discrete-time state-space model
z k + 1 = Φ z k , p · z k + w k .
In this model, the dynamics matrix Φ z k , p may depend on the state vector z k and on a bounded parameter vector p p ¯ ; p ¯ with the elementwise defined relation p ¯ p ¯ . The additive offset term w k is assumed to represent the influence of bounded external disturbances and control signals that are not directly included (in terms of a closed-loop system model) in the first summand of (31). Throughout this paper, it is assumed that the term w k is bounded by an ellipsoid. Suitable strategies to obtain these bounds are based on the so-called Löwner–John ellipsoids [39], which can be computed by means of either linear matrix inequalities or enclosed conservatively by using interval arithmetic, as described in Section 4.3 of [33].
We define further an ellipsoidal domain [23]
E k μ k , Γ ˜ k , r : = z k R n | z k μ k T Γ ˜ k T Γ ˜ k 1 z k μ k r 2
with the positive definite shape matrix Q ˜ k = Γ ˜ k Γ ˜ k T 0 and the ellipsoid midpoint μ k R n . When compared with a stochastic state prediction algorithm, the midpoint vector μ k can be interpreted as the mean of the corresponding probability density.
The parameter r describes a magnification factor according to [40] so that the ellipsoid (32) specifies the confidence bound of a given percentage if the vector z k is normally distributed with the covariance Q ˜ k . For a list of specific values of this magnification factor for dimensions n 10 , the reader is referred to [40].
For compact notation of the following ellipsoidal covariance prediction step, define the matrices
Γ k : = r · Γ ˜ k and Q k : = r 2 · Q ˜ k .
The following procedure is based on reference [38], from which only the computation of outer ellipsoidal bounds is taken into consideration.
For the compactness of notation, reformulate the summand Φ z k , p · z k in the system model (31) into the form
Φ z k , p · z k = Φ z k , p · z ˇ k + Φ ˜ · μ k + Φ z k , p Φ ˜ · μ k
with z k = z ˇ k + μ k , where
z k E k = E k μ k , Γ ˜ k , r .
Here, E k denotes the uncertainty on the non-origin centered states z k ,
z ˇ k E ˇ k = E ˇ k 0 , Γ ˜ k , r
the uncertainty on z ˇ k after shifting the ellipsoid to the origin, and
Φ ˜ = Φ μ k , mid p
is the midpoint approximation of the quasi-linear system matrix with
mid p = 1 2 · p ¯ + p ¯ .
Let E k denote an axis-aligned enclosure of E k in the form of an interval box in the coordinate frame z k .
Considering the term Φ z k , p · z k , a guaranteed outer confidence bound of magnification r is given for this summand by the ellipsoid E Φ , k + 1 μ k + 1 , Γ ˜ k + 1 , r with the covariance
Q ˜ Φ , k + 1 = Γ ˜ Φ , k + 1 Γ ˜ Φ , k + 1 T
according to the following steps. This procedure is given without further proof because it is a direct consequence of the work published in [38].
P1:
Apply
z ˇ k + 1 = Φ z k , p · z ˇ k
to the ellipsoid E ˇ k in (36). The outer ellipsoid enclosure of the image set is described by an ellipsoid with the shape matrix
Q ˇ k + 1 = α k + 1 2 · Γ k + 1 · Γ k + 1 T ,
where α k + 1 0 is the smallest value for which the LMI
M k + 1 : = Λ Q k 1 Φ T z k , p · Φ ˜ T Φ ˜ 1 · Φ z k , p α k + 1 2 R k Λ 0
is satisfied for all z k E k , i.e., for all state realizations in the interior of an axis-aligned tight enclosure of the ellipsoid, and for all possible parameters p p with the shape matrix parameterization
R k : = Γ k · Γ k T .
In (42), the symbol ⪯ denotes the negative semi-definiteness of the corresponding matrix expression. For possible strategies to select the preconditioning matrix Λ , aiming at a reduction of pessimism when computing this guaranteed outer ellipsoid enclosure, see [33].
P2:
Compute interval bounds for the term
b k = Φ p Φ ˜ · μ k b k
which accounts for a non-zero ellipsoid midpoint with z k , Φ ˜ , and p defined according to (35), (37), and (38). Inflate the ellipsoid bound described by the shape matrix (41) according to
Q Φ , k + 1 = 1 + ρ O , k + 1 2 · Q ˇ k + 1 ,
ρ O , k + 1 = sup α k + 1 1 · Γ k 1 · b k ,
where the interval-valued generalization of the Euclidean norm operator in (46) is defined in [22].
P3:
Compute the updated ellipsoid midpoint
μ Φ , k + 1 = Φ ˜ · μ k
and the updated square root of its shape matrix
Γ ˜ Φ , k + 1 = α k + 1 · 1 + ρ O , k + 1 · Φ ˜ · Γ ˜ k .
P4:
Compute an ellipsoidal enclosure of the Minkowski sum of the ellipsoid E Φ , k + 1 and the ellipsoid E w , k = E k μ w , k , Γ ˜ w , k , r w enclosing the term w k according to
E Φ , k + 1 E w , k E k + 1 μ k + 1 , Γ k + 1 , r
with the new midpoint
μ k + 1 = μ Φ , k + 1 + μ w , k
and the updated square root of the shape matrix (resp., square root of the new covariance matrix)
Γ ˜ k + 1 = Q ˜ k + 1 1 2 ,
which is given in closed-form by the nearly optimal shape matrix (i.e., close to the minimum volume ellipsoid)
Q ˜ k + 1 = 1 r 2 r 2 · 1 + 1 β · Γ Φ , k + 1 · Γ Φ , k + 1 T + r w 2 · 1 + β · Γ Ψ , k + 1 · Γ Ψ , k + 1 T
with
β = trace Γ Φ , k + 1 · Γ Φ , k + 1 T trace Γ Ψ , k + 1 · Γ Ψ , k + 1 T .
For a derivation of this expression, the reader is referred to [37,41,42].

4.2. Ellipsoidal Innovation Stage with Predefined Confidence Bounds

To perform the intersection of ellipsoids that represent the predicted state domains derived in the previous section and (possibly degenerate) ellipsoids that enclose all states compatible with the measured data, where each of them accounts for a user-defined confidence level, the procedure published in Section 4.2 of [33] is used without any modification. In contrast to widely known approaches from the literature, it is a generalization which allows for not only intersecting ellipsoids with identical midpoints but also for enclosing the intersections of ellipsoids with different midpoints. One of those ellipsoids may be infinitely wide in some dimensions of the state space for which no measured information exists.
For that purpose, the following two steps introduced in Section 4.2 of [33] are employed:
C1:
Determine the common midpoint for the desired outer bound of the intersection that must be included in all ellipsoids to be intersected (after the ellipsoid widening operations according to Equations (51) and (52) of [33]);
C2:
Determine the shape matrices for the outer ellipsoid bound according to the computation of Dikin ellipsoids according to [43].

5. Simulation Results

To perform the reliability assessment of the UKF approach by means of the proposed ellipsoidal enclosure approach, assume that the additive process noise is parameterized by the purely diagonal covariance matrix
Q = diag 0 0 0 0.25 0.25 0.0076 0.25 0.25 0.01 0.01 · 10 6
and the position measurement covariance by
R = diag 0.25 0.25 .
Moreover, the initial mean of the Gaussian probability density describing the uncertainty in the state vector to be estimated is chosen as
x 0 = z x , 0 z y , 0 0 0 0 0 1 1 0 0 T
with z x , 0 29.14 m and z y , 0 4.99 m , resulting from randomly disturbing the true initial vessel position ( 29 m ; 5 m ) , which has an offset of 6 m in each coordinate in comparison with the desired initial state, according to the initial state covariance (augmented by the integrator disturbance states according to Equation (14))
P 0 = diag 0.25 0.25 1 1 1 1 0.0535 0.0535 0.0033 0.0033 .
The desired vessel trajectory, serving as a reference for the artificial potential field controller, and the trajectory of the controlled ship motion, are illustrated in Figure 2.
All continuous-time state equations have been discretized in this section by using an explicit Euler scheme with a constant sampling period of 10 ms , corresponding also to the sampling time of the available position measurements.
For the reliability assessment in Figure 3, Figure 4 and Figure 5, it has been assumed that the ellipsoidal enclosure technique is parameterized with scaling factors that represent 99% confidence bounds for both the process and measurement noise in all cases under consideration. For a list of the corresponding scaling factors, deduced by a computationally efficient recursion formula that is based on a χ 2 distribution with the state dimension as degrees of freedom, the reader is referred to [40].
In addition, the scaling factor r representing the minimum coverage of the expected state according to [23] was varied in all depicted simulations. The first simulation in Figure 3 assumed constant bounds for the uncertain system parameters that are introduced by means of the integrator disturbance models mentioned above and in Equation (14), and the UKF simultaneously estimated these values at run-time. The interior of the non-rescaled ellipsoids with r = 1 leads to a confidence level of 1.44 % due to the state dimension n = 6 ; cf. [40].
A comparison of Figure 3 with Figure 4 and Figure 5 indicates that the enhanced parameter bounds—obtained in the ellipsoidal evaluation when using the augmented system model there as well—provide much tighter estimates for the velocity and yaw rate information (indicated in blue color) than in the case of uncertain but bounded parameters. The visible chattering of the respective bounds in Figure 4c,d and Figure 5c,d is caused by the fact that the ellipsoidal estimator is a priori initialized with the worst-case outer bound on the possible parameters and that intersections of the estimated domains resulting from the prediction step may significantly be inflated if the corresponding parameter ellipsoid midpoints deviate strongly from the ellipsoid information obtained in the set-valued innovation step; cf. [38].
However, the advantage of this behavior is the fact that the computed bounds always represent guaranteed outer enclosures of the reachable state domains with the confidence levels r that have been specified. This statement holds true even despite nonlinearities in the underlying dynamic system model. Future work can address an enhancement of the associated model for parameter variations in such a way that the general idea of a forgetting factor-like approach [44] will be transferred to set-valued online parameter estimation techniques. Such approaches will then be used also to limit the temporal parameter variation rates between two subsequent sampling instants of the ellipsoidal estimator to a user-defined rate.
However, for the application at hand, it can be seen that the computed ellipsoid bounds, especially in Figure 5, practically always bound the 3-standard deviation ranges determined by means of the UKF from the outside. This behavior helps to confirm that the UKF produces state estimates that do not violate the ellipsoidal bounds with the identical confidence level due to, for example, biased state estimates that would be caused by a large influence of linearization errors or by a convergence to an ambiguous state in the case of probability densities that may have a multi-modal shape (in fact, such scenarios can even exist in the model at hand if the heading uncertainty becomes so large that forward and backward motion could no longer be distinguished). In addition, it becomes obvious that the most crucial factor reducing the sensitivity of velocity, and therefore, also position estimates is the accurate online identification of the disturbance parameters that are associated with the uncertain model for the USV’s propulsion system. For that reason, especially those parameters need to be identified accurately (possibly at run-time) in order to achieve not only reliable state estimates but also to obtain accurate trajectory tracking capabilities if either the proposed UKF-based estimator or the ellipsoidal counterpart is included in a closed-loop or predictive control structure. However, it should be pointed out that especially for the velocity estimates, the UKF-based uncertainty ranges are much tighter than the set-valued counterparts. This gives rise to the assumption that the UKF performs strong smoothing of the estimated values, but delivers uncertainty bounds that may be more optimistic than they would actually be in reality.

6. Conclusions and Outlook on Future Work

In this paper, a stochastic interpretation of an ellipsoidal state estimation procedure has been introduced and applied to the reliability assessment of a UKF-based state estimation for USVs which is purely based on position measurements. It has been shown that this approach allows for checking whether the Gaussian assumption made by a UKF leads to estimates that are explainable also by performing set-valued prediction and innovation stages that cover the identical confidence bounds.
Future work will address the experimental validation of the proposed ellipsoidal enclosure techniques, for example, by using the DDboat robots presented in [31]. Moreover, methodological developments will focus on the case of mixed uncertainty models (e.g., by describing measurement uncertainty by Gaussian probabilities and parameter uncertainty with the help of set-valued counterparts). First attempts into this direction have already been made in [23], where a stochastic approach for iterative learning observer design was investigated recently. Moreover, interfaces between such mixed uncertainty representations in state estimation algorithms and predictive control procedures will be a further subject of future work.

Author Contributions

Conceptualization, A.R., S.W., P.H., J.R. and L.J.; Data curation, A.R., S.W., P.H., J.R. and L.J.; Formal analysis, A.R., P.H., J.R. and L.J.; Investigation, A.R., S.W., P.H., J.R. and L.J.; Methodology, A.R., S.W., P.H., J.R. and L.J.; Software, A.R., S.W., P.H., J.R. and L.J.; Validation, A.R., S.W., P.H., J.R. and L.J.; Visualization, A.R., S.W., P.H., J.R. and L.J.; Writing—original draft, A.R., S.W., P.H., J.R. and L.J.; Writing—review & editing, A.R., S.W., P.H., J.R. and L.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

All data are included in the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Maybeck, P.S. Stochastic Models, Estimation, and Control, Volume 1; Academic Press, Inc.: New York, NY, USA, 1979. [Google Scholar]
  2. Maybeck, P.S. Stochastic Models, Estimation, and Control, Volume 2; Academic Press, Inc.: New York, NY, USA, 1982. [Google Scholar]
  3. Maybeck, P.S. Stochastic Models, Estimation, and Control, Volume 3; Academic Press, Inc.: New York, NY, USA, 1982. [Google Scholar]
  4. Anderson, B.D.O.; Moore, J.B. Optimal Filtering; Dover Publications, Inc.: Mineola, NY, USA, 2005. [Google Scholar]
  5. Papoulis, A. Probability, Random Variables, and Stochastic Processes; McGraw-Hill: New York, NY, USA, 1991. [Google Scholar]
  6. Stengel, R. Optimal Control and Estimation; Dover Publications, Inc.: Mineola, NY, USA, 1994. [Google Scholar]
  7. Åström, K.J. Introduction to Stochastic Control Theory; Mathematics in Science and Engineering; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  8. Hermann, R.; Krener, A.J. Nonlinear Controllability and Observability. IEEE Trans. Autom. Control 1977, 22, 728–740. [Google Scholar] [CrossRef] [Green Version]
  9. Sontag, E. Mathematical Control Theory—Deterministic Finite Dimensional Systems; Springer: New York, NY, USA, 1998. [Google Scholar]
  10. Kalman, R.E. A New Approach to Linear Filtering and Prediction Problems. Trans. ASME-J. Basic Eng. 1960, 82, 35–45. [Google Scholar] [CrossRef] [Green Version]
  11. Daum, F. Nonlinear Filters: Beyond the Kalman Filter. IEEE Aerosp. Electron. Syst. Mag. 2005, 20, 57–69. [Google Scholar] [CrossRef]
  12. Julier, S.J.; Uhlmann, J.K.; Durrant-Whyte, H.F. A New Approach for the Nonlinear Transformation of Means and Covariances in Filters and Estimators. IEEE Trans. Autom. Control 2000, 45, 477–482. [Google Scholar] [CrossRef] [Green Version]
  13. Uhlmann, J.K. First-Hand: The Unscented Transform. Available online: https://ethw.org/First-Hand:The_Unscented_Transform (accessed on 26 June 2022).
  14. Wan, E.A.; Van Der Merwe, R. The Unscented Kalman Filter for Nonlinear Estimation. In Proceedings of the IEEE 2000 Adaptive Systems for Signal Processing, Communications, and Control Symposium (Cat. No. 00EX373), Lake Louise, AB, Canada, 4 October 2000; pp. 153–158. [Google Scholar]
  15. Sorenson, H.W.; Alspach, D.L. Recursive Bayesian Estimation Using Gaussian Sums. Automatica 1971, 7, 465–479. [Google Scholar] [CrossRef]
  16. Alspach, D.; Sorenson, H. Nonlinear Bayesian Estimation Using Gaussian Sum Approximations. IEEE Trans. Autom. Control 1972, 17, 439–448. [Google Scholar] [CrossRef]
  17. Terejanu, G.; Singla, P.; Singh, T.; Scott, P.D. Adaptive Gaussian Sum Filter for Nonlinear Bayesian Estimation. IEEE Trans. Autom. Control 2011, 56, 2151–2156. [Google Scholar] [CrossRef]
  18. Rauh, A.; Briechle, K.; Hanebeck, U.D. Nonlinear Measurement Update and Prediction: Prior Density Splitting Mixture Estimator. In Proceedings of the 2009 IEEE Control Applications, (CCA) & Intelligent Control, (ISIC), St. Petersburg, Russia, 8–10 July 2009. [Google Scholar]
  19. Del Moral, P. Non Linear Filtering: Interacting Particle Solution. Markov Process. Relat. Fields 1996, 2, 555–580. [Google Scholar]
  20. Dekhici, B.; Benyahiya, B.; Cherki, B. Forecast of Chemostat Dynamics Using Data-Driven Approach. In Proceedings of the 2021 International Conference on Control, Automation and Diagnosis (ICCAD), Grenoble, France, 3–5 November 2021; pp. 1–6. [Google Scholar] [CrossRef]
  21. Koopman, B.O.; Neumann, J.V. Dynamical Systems of Continuous Spectra. Proc. Natl. Acad. Sci. USA 1932, 18, 255–263. [Google Scholar] [CrossRef] [Green Version]
  22. Rauh, A.; Jaulin, L. A Computationally Inexpensive Algorithm for Determining Outer and Inner Enclosures of Nonlinear Mappings of Ellipsoidal Domains. Int. J. Appl. Math. Comput. Sci. AMCS 2021, 31, 399–415. [Google Scholar]
  23. Rauh, A.; Chevet, T.; Dinh, T.N.; Marzat, J.; Raïssi, T. Robust Iterative Learning Observers Based on a Combination of Stochastic Estimation Schemes and Ellipsoidal Calculus. In Proceedings of the 2022 25th International Conference on Information Fusion (FUSION), Linköping, Sweden, 4–7 July 2022. [Google Scholar]
  24. Fossen, T.I. Handbook of Marine Craft Hydrodynamics and Motion Control; Wiley: Hoboken, NJ, USA, 2011. [Google Scholar]
  25. Fossen, T.I. Guidance and Control of Ocean Vehicles; John Wiley & Sons: Chichester, UK, 1994. [Google Scholar]
  26. Wirtensohn, S.; Reuter, J.; Blaich, M.; Schuster, M.; Hamburger, O. Modelling and Identification of a Twin Hull-Based Autonomous Surface Craft. In Proceedings of the 2013 18th International Conference on Methods & Models in Automation & Robotics (MMAR), Miedzyzdroje, Poland, 26–29 August 2013; pp. 121–126. [Google Scholar]
  27. Wirtensohn, S.; Wenzl, H.; Tietz, T.; Reuter, J. Parameter Identification and Validation Analysis for a Small USV. In Proceedings of the 2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR), Miedzyzdroje, Poland, 24–27 August 2015; pp. 701–706. [Google Scholar]
  28. Khatib, O. The Potential Field Approach Additionally, Operational Space Formulation In Robot Control. In Adaptive and Learning Systems: Theory and Applications; Narendra, K.S., Ed.; Springer: Boston, MA, USA, 1986; pp. 367–377. [Google Scholar]
  29. Tanaka, Y.; Tsuji, T.; Kaneko, M. Dynamic Control of Redundant Manipulators Using the Artificial Potential Field Approach with Time Scaling. Artif. Life Robot. 1999, 3, 79–85. [Google Scholar] [CrossRef]
  30. Wang, W.; Zhu, M.; Wang, X.; He, S.; He, J.; Xu, Z. An Improved Artificial Potential Field Method of Trajectory Planning and Obstacle Avoidance for Redundant Manipulators. Int. J. Adv. Robot. Syst. 2018, 15, 1–13. [Google Scholar] [CrossRef] [Green Version]
  31. Rauh, A.; Gourret, Y.; Lagattu, K.; Hummes, B.; Jaulin, L.; Reuter, J.; Wirtensohn, S.; Hoher, P. Experimental Validation of Ellipsoidal Techniques for State Estimation in Marine Applications. Algorithms 2022, 15, 162. [Google Scholar] [CrossRef]
  32. Rohou, S.; Jaulin, L.; Mihaylova, L.; Le Bars, F.; Veres, S.M. Guaranteed Computation of Robot Trajectories. Robot. Auton. Syst. 2017, 93, 76–84. [Google Scholar] [CrossRef] [Green Version]
  33. Rauh, A.; Rohou, S.; Jaulin, L. An Ellipsoidal Predictor–Corrector State Estimation Scheme for Linear Continuous-Time Systems with Bounded Parameters and Bounded Measurement Errors. Front. Control Eng. 2022, 3, 785795. [Google Scholar] [CrossRef]
  34. Jaulin, L.; Kieffer, M.; Didrit, O.; Walter, É. Applied Interval Analysis; Springer: London, UK, 2001. [Google Scholar]
  35. Rohou, S.; Jaulin, L. Exact Bounded-Error Continuous-Time Linear State Estimator. Syst. Control Lett. 2021, 153, 104951. [Google Scholar] [CrossRef]
  36. Kühn, W. Rigorous Error Bounds for the Initial Value Problem Based on Defect Estimation. Technical Report. 1999. Available online: http://www.decatur.de/personal/papers/defect.zip (accessed on 11 November 2020).
  37. Kurzhanskii, A.B.; Vályi, I. Ellipsoidal Calculus for Estimation and Control; Birkhäuser: Boston, MA, USA, 1997. [Google Scholar]
  38. Rauh, A.; Bourgois, A.; Jaulin, L. Union and Intersection Operators for Thick Ellipsoid State Enclosures: Application to Bounded-Error Discrete-Time State Observer Design. Algorithms 2021, 14, 88. [Google Scholar] [CrossRef]
  39. John, F. Extremum Problems with Inequalities as Subsidiary Conditions. In Studies and Essays Presented to R. Courant on his 60th Birthday; Interscience Publishers, Inc.: New York, NY, USA, 1948; pp. 187–204. [Google Scholar]
  40. Wang, B.; Shi, W.; Miao, Z. Confidence Analysis of Standard Deviational Ellipse and Its Extension into Higher Dimensional Euclidean Space. PLoS ONE 2015, 10, e0118537. [Google Scholar] [CrossRef] [PubMed]
  41. Halder, A. On the Parameterized Computation of Minimum Volume Outer Ellipsoid of Minkowski Sum of Ellipsoids. In Proceedings of the 2018 IEEE Conference on Decision and Control (CDC), Miami, FL, USA, 17–19 December 2018; pp. 4040–4045. [Google Scholar] [CrossRef] [Green Version]
  42. Noack, B.; Klumpp, V.; Hanebeck, U.D. State Estimation with Sets of Densities Considering Stochastic and Systematic Errors. In Proceedings of the 2009 12th International Conference on Information Fusion, Seattle, WA, USA, 6–9 July 2009; pp. 1751–1758. [Google Scholar]
  43. Henrion, D.; Tarbouriech, S.; Arzelier, D. LMI Approximations for the Radius of the Intersection of Ellipsoids: Survey. J. Optim. Theory Appl. 2001, 108, 1–28. [Google Scholar] [CrossRef]
  44. Isermann, R.; Münchhof, M. Identification of Dynamic Systems: An Introduction with Applications; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
Figure 1. Earth- and body-fixed coordinate systems for the definition of state variables of a USV.
Figure 1. Earth- and body-fixed coordinate systems for the definition of state variables of a USV.
Mathematics 10 03011 g001
Figure 2. Comparison of the desired and controlled vessel trajectories.
Figure 2. Comparison of the desired and controlled vessel trajectories.
Mathematics 10 03011 g002
Figure 3. Estimation results with constant bounds for the uncertain system parameters: scaling factor r = 1 for the state prediction (1.44% confidence bound) with 99% confidence bounds of process and measurement noise.
Figure 3. Estimation results with constant bounds for the uncertain system parameters: scaling factor r = 1 for the state prediction (1.44% confidence bound) with 99% confidence bounds of process and measurement noise.
Mathematics 10 03011 g003
Figure 4. Estimation results with adaptation of the bounds for the uncertain system parameters: Scaling factor r = 1 for the state prediction (0.02% confidence bound for n = 10 ) with 99% confidence bounds of process and measurement noise.
Figure 4. Estimation results with adaptation of the bounds for the uncertain system parameters: Scaling factor r = 1 for the state prediction (0.02% confidence bound for n = 10 ) with 99% confidence bounds of process and measurement noise.
Mathematics 10 03011 g004
Figure 5. Estimation results with adaptation of the bounds for the uncertain system parameters: Scaling factor r = 4.2787 for the state prediction (95% confidence bound for n = 10 ) with 99% confidence bounds of process and measurement noise.
Figure 5. Estimation results with adaptation of the bounds for the uncertain system parameters: Scaling factor r = 4.2787 for the state prediction (95% confidence bound for n = 10 ) with 99% confidence bounds of process and measurement noise.
Mathematics 10 03011 g005
Table 1. Description of all parameters used for USV modeling.
Table 1. Description of all parameters used for USV modeling.
ParameterDescriptionUnit
mDisplacement kg
x g x b -coordinate of center of gravity m
J c o m b Moment of inertia w.r.t. the z b axis (incl. hydrodynamic effects) kgm 2
X u ˙ Hydrodynamic mass in x b -direction kg
Y v ˙ Hydrodynamic mass in y b -direction kg
Y r ˙ Coupling coefficient of hydrodynamic mass kg · m
N v ˙ Coupling coefficient of hydrodynamic mass kg · m
X u Linear hydrodynamic damping in x b -direction N m / s
Y v Linear hydrodynamic damping in y b -direction N m / s
N r Linear hydrodynamic damping around z b -axis Nm rad / s
X v r Coupling coefficient of hydrodynamic damping N ( m / s ) ( rad / s )
X r r Coupling coefficient of hydrodynamic damping N ( m / s ) 2
Y u r Coupling coefficient of hydrodynamic damping N ( m / s ) ( rad / s )
N u v Coupling coefficient of hydrodynamic damping Nm ( m / s ) 2
N u r Coupling coefficient of hydrodynamic damping Nm ( m / s ) ( rad / s )
X | u | u Quadratic hydrodynamic damping in x b -direction N ( m / s ) 2
Y | v | v Quadratic hydrodynamic damping in y b -direction N ( m / s ) 2
N | r | r Quadratic hydrodynamic damping around z b -axis Nm ( rad / s ) 2
a 1 Thrust parameter (forward thrust)
b 1 Thrust parameter (forward thrust and velocity)
a 2 Thrust parameter (backward thrust)
b 2 Thrust parameter (backward thrust and velocity)
Table 2. Estimated parameters (reduced parameter set).
Table 2. Estimated parameters (reduced parameter set).
J c o m b X u Y v X | u | u N | r | r
7.20 kgm 2 4.62 N m / s 255.26 N m / s 6.53 N ( m / s ) 2 9.45 N ( rad / s ) 2
X v r N u r N u v a 1 a 2
129.12 Ns 2 ( m · rad ) 6.67 Nms 2 ( m · rad ) 48.84 Nm ( m / s ) 2 0.97 0.47
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Rauh, A.; Wirtensohn, S.; Hoher, P.; Reuter, J.; Jaulin, L. Reliability Assessment of an Unscented Kalman Filter by Using Ellipsoidal Enclosure Techniques. Mathematics 2022, 10, 3011. https://doi.org/10.3390/math10163011

AMA Style

Rauh A, Wirtensohn S, Hoher P, Reuter J, Jaulin L. Reliability Assessment of an Unscented Kalman Filter by Using Ellipsoidal Enclosure Techniques. Mathematics. 2022; 10(16):3011. https://doi.org/10.3390/math10163011

Chicago/Turabian Style

Rauh, Andreas, Stefan Wirtensohn, Patrick Hoher, Johannes Reuter, and Luc Jaulin. 2022. "Reliability Assessment of an Unscented Kalman Filter by Using Ellipsoidal Enclosure Techniques" Mathematics 10, no. 16: 3011. https://doi.org/10.3390/math10163011

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop