# A New Sparse Gauss-Hermite Cubature Rule Based on Relative-Weight-Ratios for Bearing-Ranging Target Tracking.

1. IntroductionBayesian recursive estimation is commonly used in target tracking, positioning, and signal processing [1]. Generally, a Bayesian recursive estimation algorithm requires a state model and a measurement model. The a posteriori density function can describe the behaviour of the estimated state [2]. Since a closed form solution to the Bayesian recursive estimation is available only for a few special cases [3], such as the linear Gaussian system (which leads to the classical standard Kalman filter), a suboptimal solution is a preferable choice in the general case [4, 5]. Ito and Xiong [4] suggest that a local Gaussian filter can be used to approximate the general Bayesian recursive estimation suboptimally. The core problem of local Gaussian filters is in fact a high dimensional Gaussian weighted integration, which has been studied in numerical analysis; see [6-9] and the references therein. Lots of researches concentrate on the numerical approximation methods to solve the Gaussian weighted integral problem, and different approaches result in different local Gaussian filters, such as the cubature Kalman filter [10], the quadrature Kalman filter [11], and related variants [12-14]. Gauss-Hermite filter, introduced by [2, 4], makes use of the Gauss-Hermite quadrature rule and has the highest accuracy among all the above filters. However, it suffers from the curse of dimensionality since the number of cubature points increases exponentially with the dimension of the state.

To avoid the curse of dimensionality, several sparse rules are developed. Smolyak rule [15] is one of the useful tools to generate a small number of cubature points for high dimensional integral. The computational cost does not increase exponentially by using this sparse grid method. Reference [16] compares the approximation accuracies of various sparse grid methods, including trapezoidal rule, Crenshaw Curtis rule, and Gauss Patterson rule. Reference [17] combines Smolyak's rule and Gaussian Quadrature rule for high dimensional likelihood function in economic models. Jia et al. [18, 19] make a tracking comparison among Smolyak's rule based Gauss-Hermite filter of different levels and the traditional cubature filters in the context of determination of the spacecraft attitude and the lower-earth orbit satellite orbit. Simulations prove the effectiveness of Smolyak's rule based Gauss-Hermite filter. Reference [20] proposes the multiple sparse grid Gauss-Hermite filter based on sparse grid Gauss-Hermite filter and state-space partitioning. It is claimed that the computational burden is further reduced with respect to the Gauss-Hermite filter and the sparse grid Gauss-Hermite filter.

However, as Heiss and Winschel [17] mentioned, there exists a potential drawback that some of the cubature points have negative weights, which may result in instability for computation. So we come up with the idea to avoid this potential drawback. In this paper, a classification of full tensor-product Gauss-Hermite cubature points is obtained by using equivalence classification by position permutation and signum function. There exist plenty of cubature points with low weights, which can be deleted from the cubature scheme directly considering a relative-weight-ratio threshold. Comparing with the Smolyak-based rule, our construction of the new Gauss-Hermite rule is simple and practically meaningful. The corresponding weights of the cubature points are all positive; meanwhile, the full symmetry property still remains. There also exist some interesting relationships among the Gauss-Hermite filter, the 3rd embedding cubature filter, the sparse Gauss-Hermite filter, and the Unscented Kalman filter.

The remainder of this paper is organized as follows: In Section 2, a brief review of the nonlinear system and its Bayesian recursive estimation framework is presented. In Section 3, a cycle of general local Gaussian filter is presented, which offers six kinds of Gaussian weighted integrals. This leads to various specific local Gaussian filters by various choice of the cubature points set and the corresponding weights. In Section 4, a full tensor-product Gauss-Hermite integral cubature rule is presented. By introducing a simple and elegant operator, the full tensor-product based cubature points can be divided into different categories. A small set of positive weighted cubature points is generated by a threshold of relative-weight-ratio. Relationships between the new sparse Gauss-Hermite filter and the traditional cubature filters are analysed as well. In Section 5, a typical Bearing-Ranging tracking problem with a general 2D manoeuvring target motion is demonstrated to test the performance of our new sparse Gauss-Hermite filter. Some conclusions are given in Section 6.

2. Bayesian Recursive Estimation Algorithm

Consider the following discrete nonlinear system:

[x.sub.k] = f ([x.sub.k-1]) + [W.sub.k-1], (1)

[z.sub.k] = h ([x.sub.k]) + [v.sub.k], (2)

where (1) and (2) are the motion model and the measurement model of the system, respectively; [x.sub.k] [member of] [R.sup.n] is the state of the system and [z.sub.k] [member of] [R.sup.m] is the measurement; [w.sub.k] [member of] N(0, [Q.sub.k]) is the process noise and [v.sub.k] [member of] N(0, [R.sub.k]) is the measurement noise. [x.sub.k] is independent with [w.sub.k] and [v.sub.k]. By the discrete time Chapman-Kolmogoroff equation,

[mathematical expression not reproducible], (3)

where [Z.sub.1:k-1] = {[z.sub.1], ..., [z.sub.k-1]}. By the Bayesian formula,

[mathematical expression not reproducible], (4)

where [Z.sub.1:k] = {[z.sub.1], ..., [z.sub.k]}. Equations (3) and (4) are the time update formula and the measurement update formula. Figure 1 shows the recursive Bayesian estimation algorithm. When p([x.sub.k] | [Z.sub.1:k]) is obtained, we can estimate the state [[??].sub.k] and its covariance matrix [P.sub.k] by minimizing the mean square error. The results are presented as follows:

[mathematical expression not reproducible]. (5)

However, when p([x.sub.k] | [Z.sub.1:k]) becomes an arbitrary probability density distribution, it is difficult to calculate the high dimensional integrations in (5) directly. A suboptimal way is to place normal distributions on p([x.sub.k-1] | [Z.sub.1:k-1]), p([x.sub.k] | [Z.sub.1:k-1]), and P([x.sub.k] | [Z.sub.1:k]); thus the first-order moment and second-order moment can be used to describe the posterior probability. In other words, at time epoch k - 1, the posterior density is

P([x.sub.k-1] | [Z.sub.1:k-1]) = N([x.sub.k] : [x.sub.k-1], [P.sub.k-1]). (6)

At time epoch k, the predicted probability density of the state is

P ([x.sub.k] | [Z.sub.1:k-1]) = N ([x.sub.k] : [[??].sub.k|k-1], [P.sub.k|k-1]). (7)

Correspondingly, the posterior density of the state is

P([x.sub.k] | [Z.sub.1:k]) = N([x.sub.k] : [[??].sub.k], [P.sub.k]). (8)

3. Local Gaussian Filter

Section 2 points out that, under the Gaussian assumption, the first-order moment and second-order moment can be used to describe the property of the state. Hence, a suboptimal local Gaussian filter algorithm can replace the Bayesian recursive estimation (3) and (4). Details of general Gaussian filter can be found in [4].

(1) Time update.

(i) Prediction of state xfc|fc-1:

[mathematical expression not reproducible]. (9)

(ii) Prediction of covariance matrix [P.sub.k|k-1] given state [[??].sub.k|k-1]:

[mathematical expression not reproducible]. (10)

(2) Measurement update.

(i) Prediction of measurement [[??].sub.k|k-1]:

[mathematical expression not reproducible]. (11)

(ii) Covariance matrix [P.sup.zz.sub.k|k-1] given [[??].sub.k|k-1]:

[mathematical expression not reproducible]. (12)

(iii) Covariance matrix [P.sup.xz.sub.k|k-1] between state [[??].sub.k|k-1] and measurement [[??].sub.k|k-1]:

[mathematical expression not reproducible]. (13)

(iv) Gain of the filter:

[K.sub.k] = [P.sup.xz.sub.k|k-1] [([P.sup.zz.sub.k|k-1]).sup.-1]. (14)

(v) State update [[??].sub.k] and its covariance matrix [P.sub.k]:

[mathematical expression not reproducible]. (15)

We can see that (9), (10), (14), and (15) are similar to those corresponding formulae of standard Kalman filter. The only difference between local Gaussian filter and standard Kalman filter is the calculation of [mathematical expression not reproducible]. For standard Kalman filter, there exist specific formulae, while for the local Gaussian filter, numerical approximation methods need to calculate the higher dimensional integrals. A general high dimensional integral with Gaussian type weighting function can be expressed as follows:

[mathematical expression not reproducible]. (16)

Suppose that [SIGMA] = [S.sup.T] S, where S is a lower triangular matrix. By a linear transform t = [S.sup.T] S + [bar.x], we can get that

[mathematical expression not reproducible]. (17)

Various methods can approximate (17), such as the spherical radial integral rule [7, 21], Gauss-Hermite rule [2], central differential rule [4], Stochastic Integral Rule [22], Gaussian localized cumulative distribution rule [23], and Smolyak rule based sparse grid rule [18]. All of them use specific ways to generate [{[[xi].sub.i]}.sup.N.sub.i=1] and their corresponding weights [{[w.sub.i]}.sup.N.sub.i=1], where N is the number of cubature points set.

Remark 1. Generally, the choice of [{[[xi].sub.i], [w.sub.i]}.sup.N.aub.i=1] has no relationship with the estimation of state [[??].sub.k] and its covariance matrix [P.sub.k], but uniquely determined by the specific cubature integral rule. In fact, almost all cubature rules based [{[[xi].sub.i], [w.sub.i]}.sup.N.sub.i=1] can be computed and stored offline.

4. Sparse Gauss-Hermite Integral Rules

4.1. Symmetry Set Based on Full Position Permutation

Definition 2. In order to utilize the symmetry property of the cubature points, [[*].sub.n] is introduced to achieve a more concise denotation of the cubature points set. Denote * as a nonnegative seed; we have its corresponding seed vector v(*) as a n-dimensional vector [(*, 0).sup.T], where n is the state dimension. Then we have [[*].sub.n] = {FP(v(*)), - FP(v(*))},where FP(v(*)) means that the set of elements consists of the full permutation vectors of the seed vector and -FP(v(*)) is generated by randomly setting one or several nonzero values to their opposites in FP(v(*)).

Let the state dimension be n and take [1,1]" as an example, where {1,1} is the seed. Since two values are given, then the n-dimensional seed vector is [(1, 1, 0, ..., 0).sup.T]. It has total [mathematical expression not reproducible] full permutation, so [[1,1].sub.n] has [mathematical expression not reproducible] elements. For simplicity, suppose n = 3; then [[1].sub.3] has [mathematical expression not reproducible] elements, which is presented as the following set:

[mathematical expression not reproducible]. (18)

Remark 3. With the help of full position permutation, it becomes much easier to describe the cubature points set {[[xi].sub.i], i = 1, 2, ..., N}. Furthermore, it brings some interesting properties for the cubature points.

4.2. Full Tensor-Product Based Gauss-Hermte Integral Rule. The classical one-dimension Gauss-Hermite rule can be easily obtained according to [24]. Table 1 presents us with cubature points set {[xi]} and corresponding weights from orders 1 to 5. Here the order m also represents the number of cubature points in each dimension. We can see that the points and weights are both symmetric in R. For details about the construction of Gauss-Hermite quadrature points, one can refer to [25]. Furthermore, [26] provides a better and more stable way to construct cubature points and weights than moment matching method.

For n dimension integral problem, a full tensor-product based Gauss-Hermite rule can be obtained directly by the following formula [2]:

[mathematical expression not reproducible]. (19)

As mentioned above, n is the dimension of the state, m is the number of the cubature points for each dimension, and 1 [less than or equal to] i [less than or equal to] [m.sup.n] as presented in (19). Each point of the cubature set is a n-dimensional vector; that is, [mathematical expression not reproducible]. The weight of point i can be calculated as [mathematical expression not reproducible]. For example, let m = 3 and n = 2; we can easily get the cubature points and the corresponding weights as follows:

[mathematical expression not reproducible]. (20)

Recall Definition 2; the cubature points in (20) can be categorized as three sets {[[xi].sub.0], [[xi].sub.1], [[xi].sub.2]}; that is,

[[xi].sub.0] = [[0].sub.2], [[xi].sub.1] = [[[square root of 3]].sub.2], [[xi].sub.2] = [[[square root of 3], [square root of 3]].sub.2], (21)

and the weights can be summarized as three types as well:

[w.sub.0] = 4/9, [w.sub.1] = 1/9, [w.sub.2] = 1/36. (22)

The number of each category can be easily computed as

[mathematical expression not reproducible]. (23)

The total number of cubature points N = [n.sub.0] + [n.sub.1] + [n.sub.2] = 9 = [3.sup.2]. Equations (21), (22), and (23) show that such a classification is an equivalent notation of the full tensor-product rule. Now suppose that m = 3 remains unchanged; we would like to consider the general case of n dimension. According to Definition 2, there exist n + 1 categories. The corresponding {[[xi].sub.i], i = 0, 1, 2, ..., n}, {[w.sub.i], i = 0, 1, 2, ..., n}, and the number of each category {[n.sub.i], i = 0, 1, 2, ..., n} are shown as follows:

[mathematical expression not reproducible]. (24)

The total number of cubature points N = [n.sub.0] + [n.sub.1] + ... + [n.sub.n] = [3.sup.n]. It also shows that such an expression is another form of the full tensor-product based rule. When the dimension of state n increases, the number of cubature points N increases exponentially with n. The curse of dimensionality limits the usage of Gauss-Hermite integral rule.

Now, we are going to give the cubature points set and their corresponding weights with m = 1, 2, 4, 5. It can be easily conducted that when m =1, there is only one cubature point; that is, [xi] = (0, 0, ..., 0), and its weight is 1. When m = 2, we can refer to Table 1 to find that there is only one nonnegative value (i.e., 1), so there exists only one category as well:

[[xi].sub.0] = [[1, 1, ..., 1].sub.n]; [w.sub.0] = [(1/2).sup.n], [n.sub.0] = [2.sup.n]. (25)

When m = 2, it is interesting to find that the GHKF is similar to the 3rd embedding cubature Kalman filter [27]. We will elaborate their connections in the following Remark.

Remark 4. The main difference between GHKF and the 3rd embedding cubature Kalman filter is the central point [(0, 0, ..., 0).sup.T] and its weight [w.sub.0] utilized. The classical standard 3rd cubature rule based on spherical radial rule [10, 28], whose cubature points set is [[square root of n]], may exceed the range of state. Both the GHKF and the 3rd embedding cubature rule are stable for high dimensional integral rule. However, since the number of cubature points in 3rd embedding cubature Kalman filter is [2.sup.n] + 1, we still face the threat of dimension explosion when dealing with high dimensional system.

When m = 4, there still exists n +1 type of category which is analogous to the case m = 3. Here we can simply regard [p.sub.4,1] as 0 of case m = 3 only to remember that [p.sub.4,1] is positive. We have [p.sub.4,1] = 0.7442 and [p.sub.4,2] = 1.3556 according to Table 1. The total number of cubature points becomes [4.sup.n]. More specifically, the cubature points set {[xi]}, the corresponding weights {w}, and the number {[n.sub.i]} for each category are shown as follows:

[mathematical expression not reproducible], (26)

where [w.sub.4,1] = 0.4541, [w.sub.4,2] = 0.0459. It can be seen that the number of each cubature category has a factor [2.sup.n], which will result in the dimension explosion as well.

When N = 5, the total number of cubature points is N = [5.sup.n]. It can be classified as follows:

[mathematical expression not reproducible]. (27)

The corresponding weights are presented as

[mathematical expression not reproducible], (28)

where [p.sub.5,1] = 1.3556, [p.sub.5,2] = 2.857. [w.sub.0] = 0.5333, [w.sub.4,1] = 0.2221, [w.sub.4,2] = 0.1123. We can calculate the number of each category to obtain the following equations:

[mathematical expression not reproducible]. (29)

Here we can see that, for m = 2, 4, the number of each category has a factor [2.sup.n], so those cubature points sets are not a good choice for the high dimensional system. However, the number of each category is a polynomial of the dimension of state when m = 3, 5. In the face of the dimension explosion, it is rather tempting that we can just choose several categories to approximate the high dimensional integration. We have introduced the relative-weight-ratio as a criterion to achieve this goal. Detailed analysis is presented in the following subsection.

4.3. Sparse Gauss-Hermite Rule Based on Relative-Weight Ratio. Take m = 3 as an example and recall (21) and (22) which present the cubature points set and corresponding weights set, respectively. The relative-weight-ratio between category [[xi].sub.0] = [0] and category [[xi].sub.k] = [[[square root of 3], ..., [square root of 3]].sub.n] can be easily obtained:

[Ratio.sub.k] = [w.sub.0]/[w.sub.k] = [4.sup.k] k [greater than or equal to] 0. (30)

Equation (30) shows that as the subindex k of the cubature points [[xi].sub.k] set increases, the [Ratio.sub.k] decreases exponentially. It indicates that when considering a certain degree of accuracy, there is no need to use all Gauss-Hermite cubature points. When a threshold value K is settled, only the categories satisfying [Ratio.sub.k] [less than or equal to] K will be sufficient for the high dimensional integral. For example, set K = 100; then we have

[w.sub.0]/[w.sub.3] = 64 < 100, [w.sub.0]/[w.sub.4] = 128 > 100. (31)

According to the criterion, the categories including [[0].sub.n], [[[square root of 3]].sub.n], [[[square root of 3], [square root of 3]].sub.n], and [[[square root of 3], [square root of 3], [square root of 3]].sub.n] are enough to approximate the integral. The total number of the cubature points is

N = 1 + 2 + 2 (n - 1) + 4n(n - 1)(n - 1)/3. (32)

The number of cubature points has a polynomial relationship with the dimension of state. If we set threshold value as K = 50, the remaining categories will become [[0].sub.n], [[[square root of 3]].sub.n], and [[[square root of 3], [square root of 3]].sub.n]. The corresponding number of the cubature points is

N = 1 + 2n + 2n (n - 1). (33)

Remark 5. By setting the ratio threshold K, most low weighted cubature points will be eliminated. Such a strategy can efficiently eliminate the problem of dimension explosion when dealing with high dimensional system. Bear in mind that since lots of low weighted cubature points are eliminated, the sum of remaining points' weights does not equal to 1. We can deal with this problem by renormalizing the remaining weights and meanwhile maintaining the relative-weight-ratio. Unlike the Unscented Transform rules [29] or the higher order spherical radial rule cubature rule [28], our transformation keeps all weights positive.

Remark 6. When m = 3, considering [[0].sub.n] and [[[square root of 3]].sub.n] as selected cubature points, the total number is 2n + 1 which equals the number of the UKF with parameter [kappa] = 3 - n [29]. The difference lies in the determination of weights of the cubature points. In the context of sparse GHKF, the weight of [[0].sub.n] is [w.sub.0,GHKF] = 4/2n + 4. However under the background of UKF, the weight becomes [w.sub.0,UKF] = 1 - n/3. Similarly, we have weights of [[[square root of 3]].sub.n] as [w.sub.1,GHKF] = 1/2n + 4 and [w.sub.1,UKF] = 1/6 for sparse GHKF and UKF, respectively. When dimension n > 3, the weight of [0]n becomes negative in the UKF context, which is a potential unstable factor for integral approximation. The sparse Gauss-Hermite cubature points for m = 5 can also be obtained by repeating the above discussed process with a preset relative-weight-ratio. Comparing [[[p.sub.5,1], [p.sub.5,1]].sub.n] with [[[p.sub.5,2]].sub.n], the weight of the former category is larger than the latter one.

5. Numerical Investigation

In this section, a Nearly Constant Turning (NTC) manoeuvring target model is settled to verify the tracking performance of our new sparse Gauss-Hermite Kalman filter. NCT model is commonly used in aircraft flying control. We consider the 2-dimensional movement. Suppose the unknown turning rate is [omega]. Since [omega] is unknown, the NCT model is a time-varying nonlinear model [10]. The discrete state model can be settled as follows:

[mathematical expression not reproducible], (34)

where [mathematical expression not reproducible] represent the position and velocity of axis x, respectively. [y.sub.k] and [[??].sub.k] represent the position and velocity of axis y, respectively. AT is the sampling time interval. [[omega].sub.k] is the turning rate at time epoch k. The corresponding process noise [w.sub.k] [approximately equal to] N(0, Q), where Q can be rewritten as follows:

[mathematical expression not reproducible]. (35)

[q.sub.x] and [q.sub.y] represent the Power Spectrum Density for positions x and y. [q.sub.w] is the Power Spectrum Density of the turning rate. Suppose that the sensor platform is settled at the origin points. Bearing-Ranging measurement is used for the target tracking. The measurement equation can be expressed as follows:

[mathematical expression not reproducible], (36)

where [v.sub.k] is the measurement noise, which satisfies the Gaussian distribution with zero mean. The corresponding covariance matrix R can be expressed as follows:

R = diag ([[[sigma].sup.2.sub.r] [[sigma].sup.2.sub.[theta]]]). (37)

The corresponding parameters are settled by Table 2 [10].

We set the initial state of the target [x.sub.0] as

[x.sub.0] = [1000 m 300 m[s.sup.-1] 1000 m 0 m[s.sup.-1] -3 [degs.sup.-1]]. (38)

Then the corresponding covariance matrix [P.sub.0] of the initial state is

[P.sub.0] = diag [100 [m.sup.2] 10 [m.sup.2] [s.sup.-2] 100 [m.sup.2] 10 [m.sup.2] [s.sup.-2] 100 m[rad.sup.2] [s.sup.-2]]. (39)

The estimate of initial state of the filter [[??].sub.0] is randomly generated by the distribution N(x : [x.sub.0], [P.sub.0]). Our new sparse Gauss-Hermite Kalman filter (m = 3) with the cubature sets {[0], [[square root of 3]], [[square root of 3], [square root of 3]]} is used in the experiment. In order to make a reliable comparison between different filters, we implement our experiment with the (5th) CKF [28], full tensor-product based Gauss-Hermite Kalman filter (m = 3) [2], and Smolyak rule based sparse Gauss-Hermite Kalman filter [18] (m = 3).

The above experiment is repeated 100 times independently. Root mean square errors [RMSE.sub.pos], [RMSE.sub.vel], and [RMSE.sub.[omega]] are used to evaluate the tracking performance of the position, velocity, and the turning rate. The detailed formulations are shown as follows:

[mathematical expression not reproducible]. (40)

Similarly, CRMSE are used to evaluate the average tracking performance:

[mathematical expression not reproducible], (41)

where [[??].sup.i.sub.k,j] represents the kth estimate element of state at time epoch j for the ith experiment. [x.sup.i.sub,k,j] represents the kth theoretical element of state at time epoch j for the ith experiment. [N.sub.mc] represents the Monte Carlo experiment times. [N.sub.sim] represents the state number of each experiment. We set [N.sub.mc] = 100. [N.sub.sim] = 100 in this experiment. For a single simulation experiment, the tracking performance is shown in Figures 2, 3, and 4. For [N.sub.mc] repeated experiments, the tracking performance is shown in Figures 5, 6, and 7. The CRMSEs of different filters are shown in Table 3.

From Table 3, it can be seen that the full tensor-product based Gauss-Hermite filter and the (5th) CKF have almost exactly the same tracking performance, while the Smolyak-based sparse Gauss-Hermite filter has relatively lower tracking accuracy. The new sparse Gauss-Hermite filter has better tracking accuracy comparing with sparse Gauss-Hermite filter and has less tracking accuracy comparing with the full tensor-product based Gauss-Hermite filter and the (5th) CKF. Our new sparse Gauss-Hermite filter is a good choice to track this manoeuvring target problem with a relative sparse cubature points set where all corresponding weights are kept positive. Furthermore, our method burdens low computational costs and maintains stable numerical accuracy.

6. Conclusion and Discussion

Gauss-Hermite cubature rule is an effective way to approximate nonlinear Gaussian weighted type integral. However, the full tensor-product based Gauss-Hermite cubature rule may cause a dimension explosion and is rarely helpful for high dimensional case. Smolyak rule based sparse Gauss-Hermite cubature rule is a way to generate small cubature set by specific generation design, which has a potential drawback that some cubature points may have negative weights. This novel Gauss-Hermite rule is easily generated by using our notation in Definition 2 to classify the full tensor-product based Gauss-Hermite cubature points. Based on a proper relative-ratio-weight criterion, a sparse cubature set is regenerated. Simulations show that our sparse Gauss-Hermite rules will have comparable accuracy with the full tensor-product based Gauss-Hermite filter and higher precision comparing with Smolyak's rule based Gauss-Hermite filter. Furthermore, our method can lead to a substantially reduced number of cubature points and a more stable high dimensional integration. Our method can maintain accuracy of integration at the same time and could be a good choice for practice problems in engineering.

https://doi.org/10.1155/2017/2783781

Disclosure

The views and opinions expressed in this paper are those of the authors and do not necessarily reflect the official policy or position of the iGMAS.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work is supported by the iGMAS (international GNSS Monitoring and Assessment Service) and the Natural Science Foundation of China (no. 61573367).

References

[1] F. Gustafsson, F. Gunnarsson, N. Bergman et al., "Particle filters for positioning, navigation, and tracking," IEEE Transactions on Signal Processing, vol. 50, no. 2, pp. 425-437, 2002.

[2] I. Arasaratnam, S. Haykin, and R. J. Elliott, "Discrete-time nonlinear filtering algorithms using Gauss-Hermite quadrature," Proceedings of the IEEE, vol. 95, no. 5, pp. 953-977, 2007.

[3] M. Simandl and J. Dunik, "Derivative-free estimation methods: new results and performance analysis," Automatica. A Journal ofIFAC, the International Federation of Automatic Control, vol. 45, no. 7, pp. 1749-1757, 2009.

[4] K. Ito and K. Xiong, "Gaussian filters for nonlinear filtering problems," Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 45, no. 5, pp. 910-927, 2000.

[5] Y. Wu, D. Hu, M. Wu, and X. Hu, "A numerical-integration perspective on gaussian filters," IEEE Transactions on Signal Processing, vol. 54, no. 8, pp. 2910-2921, 2006.

[6] A. H. Stroud and D. D. Stancu, "Quadrature formulas with multiple Gaussian nodes," Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, vol. 2, no. 1, pp. 129-143, 1965.

[7] A. Genz, "Fully symmetric interpolatory rules for multiple integrals," SIAM Journal on Numerical Analysis, vol. 23, no. 6, pp. 1273-1283, 1986.

[8] A. Genz and B. D. Keister, "Fully symmetric interpolatory rules for multiple integrals over infinite regions with Gaussian weight," Journal of Computational and Applied Mathematics, vol. 71, no. 2, pp. 299-309, 1996.

[9] A. Genz, "Fully symmetric interpolatory rules for multiple integrals over hyper-spherical surfaces," Journal of Computational and Applied Mathematics, vol. 157, no. 1, pp. 187-195, 2003.

[10] I. Arasaratnam and S. Haykin, "Cubature Kalman filters," Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 54, no. 6, pp. 1254-1269, 2009.

[11] S. Bhaumik and Swati, "Cubature quadrature Kalman filter," IET Signal Processing, vol. 7, no. 7, pp. 533-541, 2013.

[12] A. K. Singh and S. Bhaumik, "Cubature quadrature Kalman filter for maneuvering target tracking," in Proceedings of the 1st IEEE International Conference on Smart Sensors and Application, ICSSA 2015, pp. 24-29, May 2015.

[13] A. K. Singh and S. Bhaumik, "Higher degree cubature quadrature kalman filter," International Journal of Control, Automation and Systems, vol. 13, no. 5, pp. 1097-1105, 2015.

[14] A. K. Singh, S. Bhaumik, and P. Date, "Quadrature filters for one-step randomly delayed measurements," Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 40, no. 19-20, pp. 8296-8308, 2016.

[15] S. Smolyak, "Quadrature and interpolation formulas for tensor products of certain classes of functions," Soviet Mathematics, Doklady, vol. 4, no. 5, pp. 240-243, 1963.

[16] T. Gerstner and M. Griebel, "Dimension-adaptive tensor-product quadrature," Computing. Archives for Scientific Computing, vol. 71, no. 1, pp. 65-87, 2003.

[17] F. Heiss and V. Winschel, "Likelihood approximation by numerical integration on sparse grids," Journal of Econometrics, vol. 144, no. 1, pp. 62-80, 2008.

[18] B. Jia, M. Xin, and Y. Cheng, "Sparse gauss-hermite quadrature filter with application to spacecraft attitude estimation," Journal of Guidance, Control, and Dynamics, vol. 34, no. 2, pp. 367-379, 2011.

[19] B. Jia, M. Xin, and Y. Cheng, "Sparse-grid quadrature nonlinear filtering," Automatica. A Journal of IFAC, the International Federation of Automatic Control, vol. 48, no. 2, pp. 327-341, 2012.

[20] R. Radhakrishnan, A. K. Singh, S. Bhaumik, and N. K. Tomar, "Multiple sparse-grid Gauss-Hermite filtering," Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 40, no. 7-8, pp. 4441-4450, 2016.

[21] A. H. Stroud, "Some cubature formulas for the surface of the "sphere," SIAM Journal on Numerical Analysis, vol. 10, no. 4, pp. 559-569, 1973.

[22] A. Genz and J. Monahan, "Stochastic integration rules for infinite regions," SIAM Journal on Scientific Computing, vol. 19, no. 2, pp. 426-439, 1998.

[23] J. Steinbring and U. D. Hanebeck, "LRKF revisited: the smart sampling Kalman filter (S2KF)," Journal of Advances in Information Fusion, vol. 9, no. 2, pp. 106-123, 2014.

[24] W. Press, B. Flannery, S. Teukolsky, and W. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, 1999.

[25] G. H. Golub and C. F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, Md, USA, 3rd edition, 1996.

[26] G. H. Golub and J. H. Welsch, "Calculation of Gauss quadrature rules," Mathematics of Computation, vol. 23, no. 106, article 221, 1969.

[27] X.-C. Zhang, "A novel cubature kalman filter for nonlinear state estimation," in Proceedings of the 52nd IEEE Conference on Decision and Control, CDC 2013, pp. 7797-7802, December 2013.

[28] B. Jia, M. Xin, and Y. Cheng, "High-degree cubature Kalman filter," Automatica. A Journal of IFAC, the International Federation of Automatic Control, vol. 49, no. 2, pp. 510-518, 2013.

[29] S. J. Julier and J. K. Uhlmann, "Unscented filtering and nonlinear estimation," Proceedings of the IEEE, vol. 92, no. 3, pp. 401-422, 2004.

Lijun Peng, Xiaojun Duan, and Jubo Zhu

College of Science, National University of Defense Technology, Changsha, Hunan

410073, China

Correspondence should be addressed to Lijun Peng; lijunpengzhu@163.com

Received 4 January 2017; Revised 15 June 2017; Accepted 24 July 2017; Published 11 September 2017

Academic Editor: Ming-Cong Deng

Caption: FIGURE 1: One cycle of Bayesian recursive estimation algorithm [18].

Caption: FIGURE 2: Estimation error of position (one simulation).

Caption: Figure 3: Estimation error of velocity (one simulation).

Caption: FIGURE 4: Estimation error of turn rate (one simulation).

Caption: FIGURE 5: RMSEs of position of different filters.

Caption: FIGURE 6: RMSEs of velocity of different filters.

Caption: FIGURE 7: RMSEs of turn rate of different filters.

TABLE 1: Cubature points and corresponding weights for one dimension (m = 1,2,3,4,5). m ([xi]} 1 {0} 2 {-1, 1} 3 {-[square root of 3], 0, + [square root of 3]} 4 {-2.334, - 0.742, 0.742, 2.334} 5 {-2.857, - 1.356, 0,1.356, 2.857} m {w} 1 {1} 2 {1/2, 1/2} 3 {1/6, 2/3, 1/6 4 {0.046, 0.454, 0.454, 0.046} 5 {0.0113, 0.2221, 0.5333, 0.2221, 0.0113} TABLE 2: Parameter setting for the experiment. [DELTA]T 1 s [w.sub.0] -3 deg/s [q.sub.x], [q.sub.y] 0.1 [m.sup.2]/[s.sup.3] [q.sub.w] 1.75 x [10.sup.-4] [s.sup.-3] [[sigma].sub.r] 10 m [[sigma].sub.theta] [square root of 10] mrad TABLE 3: CRMSE of different filters. Filter CKF (5th) GHKF (full) SGHKF (Smolyak) 2[n.sup.2] [3.aup.n] 4[n.sup.2] + 1 points points points [CRMSE.sub.pos] (m) 11.4217 11.4215 15.8146 [CRMSE.sub.vel] (m/s) 6.6320 6.6320 14.2974 [CRMSE.sub.w] (rad) 0.0088 0.0088 0.0207 Filter SGHKF (novel) 2[n.sup.2] + 1 points [CRMSE.sub.pos] (m) 14.2034 [CRMSE.sub.vel] (m/s) 10.4270 [CRMSE.sub.w] (rad) 0.0145

Printer friendly Cite/link Email Feedback | |

Title Annotation: | Research Article |
---|---|

Author: | Peng, Lijun; Duan, Xiaojun; Zhu, Jubo |

Publication: | Modelling and Simulation in Engineering |

Article Type: | Report |

Date: | Jan 1, 2017 |

Words: | 5514 |

Previous Article: | Fuel Costs Minimization on a Steel Billet Reheating Furnace Using Genetic Algorithms. |

Next Article: | Optimal Allocation of DG and DSTATCOM in Radial Distribution System Using Cuckoo Search Optimization Algorithm. |

Topics: |