+

CN114221638B - A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria - Google Patents

A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria Download PDF

Info

Publication number
CN114221638B
CN114221638B CN202111568689.4A CN202111568689A CN114221638B CN 114221638 B CN114221638 B CN 114221638B CN 202111568689 A CN202111568689 A CN 202111568689A CN 114221638 B CN114221638 B CN 114221638B
Authority
CN
China
Prior art keywords
measurement
matrix
covariance
state
noise
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111568689.4A
Other languages
Chinese (zh)
Other versions
CN114221638A (en
Inventor
赵雪华
兰曼
卫一卿
王冰冰
王素芳
秦玉琨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Luoyang Institute of Science and Technology
Original Assignee
Luoyang Institute of Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Luoyang Institute of Science and Technology filed Critical Luoyang Institute of Science and Technology
Priority to CN202111568689.4A priority Critical patent/CN114221638B/en
Publication of CN114221638A publication Critical patent/CN114221638A/en
Application granted granted Critical
Publication of CN114221638B publication Critical patent/CN114221638B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03HIMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
    • H03H17/00Networks using digital techniques
    • H03H17/02Frequency selective networks
    • H03H17/0248Filters characterised by a particular frequency response or filtering method
    • H03H17/0255Filters based on statistics
    • H03H17/0257KALMAN filters

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Mathematical Physics (AREA)
  • Measurement Of Mechanical Vibrations Or Ultrasonic Waves (AREA)
  • Indication And Recording Devices For Special Purposes And Tariff Metering Devices (AREA)
  • Complex Calculations (AREA)

Abstract

本发明提供一种基于随机加权准则的最大互相关熵卡尔曼滤波方法,包括:构建线性系统方程和量测方程、选择合适的核宽且初始化系统状态和协方差、根据系统方程更新状态和协方差的一步预测、在固定点初始迭代时刻再次初始化状态值、根据初始系统和量测方程进行系统模型变形且计算出变形后的误差和由此计算出误差的核函数、由随机加权准则和核函数得出两个对角阵、两个对角阵来修正一步预测协方差和量测误差从而修正增益矩阵、估计出系统后验状态和协方差,本发明对于线性模型的非高斯重尾冲击噪声问题,可以获得比卡尔曼滤波和最大互相关熵卡尔曼滤波更好的性能,可广泛应用于线性系统的噪声为非高斯情况,提高非高斯噪声情形下的滤波估计精度。

The invention provides a maximum cross-correlation entropy Kalman filtering method based on random weighting criteria, comprising: constructing a linear system equation and a measurement equation, selecting a suitable kernel width and initializing a system state and covariance, updating a one-step prediction of the state and covariance according to the system equation, re-initializing the state value at the initial iteration time of a fixed point, deforming the system model according to the initial system and measurement equation and calculating the error after deformation and a kernel function of the error calculated thereby, obtaining two diagonal matrices by the random weighting criteria and the kernel function, and correcting the one-step prediction covariance and the measurement error by the two diagonal matrices to correct the gain matrix, and estimating the system posterior state and covariance. The invention can obtain better performance than Kalman filtering and maximum cross-correlation entropy Kalman filtering for the problem of non-Gaussian heavy-tailed impact noise of a linear model, and can be widely applied to the case where the noise of a linear system is non-Gaussian, so as to improve the filtering estimation accuracy under the non-Gaussian noise situation.

Description

Maximum cross-correlation entropy Kalman filtering method based on random weighting criterion
Technical Field
The invention belongs to the technical field of signal processing, and particularly relates to a maximum cross-correlation entropy Kalman filtering method based on a random weighting criterion.
Background
State estimation is an important issue in signal processing. The Kalman filtering method is one of important methods for solving the problem of state estimation under Gaussian noise of a linear system, fully utilizes a state model and observation data of the system, and minimizes the error of the state estimation by solving the problem of optimization, so as to obtain the optimal estimation of the system. However, the noise is polluted due to the system model or measurement, and the heavy tail non-gaussian noise is often generated, which causes the accuracy of the kalman filtering algorithm to be reduced or even spread, so that the filtering algorithm for the non-gaussian noise is required.
For the case that the measured noise is non-Gaussian, filtering algorithms which have appeared at present are Gaussian sum filtering, M estimation filtering based on Huber technology and t filtering based on Student's method. However, the probability density distribution of noise is known by using Gaussian and filtering, which is difficult to realize in engineering practice, because the Huber technology cannot drop after the influence parameter gamma exceeds 1.345, so that the estimation performance is reduced, and student t filtering can only be used in the case that the covariance of system noise and the covariance of measurement noise are small. Therefore, it is important to propose a new kalman filtering method suitable for the linear system, which improves both the robustness and the noise immunity. For this reason, researchers have proposed a new method for solving heavy-tail non-gaussian noise, i.e., a filtering method based on maximum cross-correlation entropy, such as maximum cross-correlation entropy kalman filtering, etc. Unlike conventional filtering methods, the cross-correlation entropy includes not only second-order statistical information but also higher-order statistical information, so that a better estimation effect can be obtained.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a maximum cross-correlation entropy Kalman filtering method based on a random weighting criterion, which is suitable for a linear system under the condition that noise is non-Gaussian, and improves the robustness and noise immunity of the system.
In order to achieve the above object, the present invention is achieved by the following technical means.
A maximum cross-correlation entropy Kalman filtering method based on a random weighting criterion comprises the following steps:
step one, constructing a linear system equation and a measurement equation as follows:
Wherein k-1 represents k-1 time, x k∈Rn is n-dimensional system state vector at k time, z k∈Rm is m-dimensional measurement vector at k time, F k-1 and H k are known transfer matrix and measurement matrix respectively, q k-1∈Rn is n-dimensional system noise at k-1 time, r k∈Rm is m-dimensional measurement noise at k time, system noise obeys Gaussian distribution q k-1~N(0,Qk-1), measurement noise is non-Gaussian obeys mixed Gaussian distribution r k~λN(0,Rk,1)+(1-λ)N(0,Rk,2),qk-1 and r k and is uncorrelated process and measurement Gaussian noise, and the requirements are met
Where E [. Cndot. ] represents a mathematical expectation, delta kj is a Croneck sign function,A transpose vector representing the hybrid noise vector r j;
initializing, selecting a kernel width sigma, and initializing the system state And covariance P (0|0), let k=1;
Step three, updating the prior state according to a one-step prediction equation of the system And covariance P k|k-1;
step four, initializing the state value again at the fixed point iteration moment, wherein t=1 and
Fifthly, performing system model deformation according to the initial system and the measurement equation, and calculating an error of the new model, thereby calculating a kernel function of the error;
firstly, reconstructing a state equation and a measurement equation:
Wherein E [. Cndot. ] represents mathematical expectation, P k|k-1 is a state one-step prediction error covariance matrix at the kth time, R k is a measurement noise covariance matrix at the kth time, B P (k|k-1) is a matrix obtained by performing Cholesky decomposition on P k|k-1, Is the transposed matrix of B P (k|k-1), and similarly, B R (k) is a matrix obtained by performing Cholesky decomposition on R k,Is the transpose of B R (k), B k is a new diagonal matrix of B P (k|k-1) and B R (k);
In equation (d) Is multiplied by simultaneously two sides ofObtaining:
Dk=Wkxk+ek
Wherein the method comprises the steps of The i-th column element of the error vector e k is:
ek(i)=di(k)-wi(k)xk(i)
where D i (k) is the i-th element of D k, W i (k) is the i-th row element of matrix W k, x k (i) here represents the i-th state quantity of x k, and D k is an l=n+m-dimensional vector;
Step six, obtaining two diagonal arrays by a random weighting criterion and a kernel function;
due to the random weighting criteria, a new cost function is defined:
Wherein the method comprises the steps of G σ (·) gaussian kernel:
Here, we take:
then x k (i) optimal solution:
the matrixing form is as follows:
Wherein the method comprises the steps of And is also provided with Obtaining two diagonal matrixes
Step seven, two diagonal arraysTo correct one-step prediction covarianceAnd measurement error covariance
Thereby correcting the gain matrix;
estimating the posterior state of the system filtering
Sum covariance
If k+1=n, where N is the preset algorithm iteration number, stopping calculation, otherwise continuing to execute the above steps.
Compared with the prior art, the invention has the beneficial effects that:
The invention improves the accuracy of MCKF by introducing MCKF a random weighting criterion, increases the related entropy by adopting the random weighting theory in the cost function, accords with the maximum related entropy criterion (MCC), improves the estimation accuracy, and improves the state estimation accuracy and the estimation effectiveness compared with the traditional KF algorithm and MCKF algorithm through experiments.
Drawings
FIG. 1 is a flow chart of a RWMCKF-based method according to the present invention;
Fig. 2 is a probability density function for state x 1 at KF, MCKF (σ=2), and RWCKF;
Fig. 3 is a probability density function for state x 2 at KF, MCKF (σ=2), and RWCKF;
Fig. 4 is a probability density function for state x 1 at MCKF (σ=2) and RWCKF;
fig. 5 is a probability density function for state x 2 at MCKF (σ=2) and RWCKF.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. For a better understanding of the method of the present invention, the network structure of the present invention will be described in detail.
The invention relates to a maximum cross-correlation entropy Kalman filtering method based on a random weighting criterion, which comprises the following steps:
step one, constructing a linear system equation and a measurement equation as follows:
Wherein k-1 represents the k-1 moment, x k∈Rn is the n-dimensional system state vector at the k moment, z k∈Rm is the m-dimensional measurement vector at the k moment, F k-1 and H k are respectively known transfer matrix and measurement matrix, q k-1∈Rn is the n-dimensional system noise at the k-1 moment, r k∈Rm is the m-dimensional measurement noise at the k moment, the system noise is assumed to obey Gaussian distribution q k-1~N(0,Qk-1), the measurement noise is non-Gaussian mixture Gaussian distributions r k~λN(0,Rk,1)+(1-λ)N(0,Rk,2),qk-1 and r k are uncorrelated process and measurement Gaussian noise, and the requirements are satisfied
Where E [. Cndot. ] represents a mathematical expectation, delta kj is a Croneck sign function,A transpose vector representing the hybrid noise vector r j;
initializing, selecting a proper kernel width sigma through experience, and initializing system state And covariance P (0|0), let k=1;
Step three, updating the prior state according to a one-step prediction equation of the system And covariance P k|k-1;
step four, initializing the state value again at the fixed point iteration moment, wherein t=1 and
Fifthly, performing system model deformation according to the initial system and the measurement equation, and calculating an error of the new model, thereby calculating a kernel function of the error;
firstly, reconstructing a state equation and a measurement equation:
Wherein E [. Cndot. ] represents mathematical expectation, P k|k-1 is a state one-step prediction error covariance matrix at the kth time, R k is a measurement noise covariance matrix at the kth time, B P (k|k-1) is a matrix obtained by performing Cholesky decomposition on P k|k-1, Is the transposed matrix of B P (k|k-1). Similarly, B R (k) is a matrix obtained by performing Cholesky decomposition on R k,Is the transpose of B R (k), B k is a new diagonal matrix of B P (k|k-1) and B R (k);
In equation (d) Is multiplied by simultaneously two sides ofObtaining:
Dk=Wkxk+ek
Wherein the method comprises the steps of The i-th column element of the error vector e k is:
ek(i)=di(k)-wi(k)xk(i)
Where D i (k) is the i-th element of D k, W i (k) is the i-th row element of matrix W k, x k (i) here represents the i-th state quantity of x k, and D k is an l=n+m-dimensional vector.
Step six, obtaining two diagonal arrays by a random weighting criterion and a kernel function;
due to the random weighting criteria, a new cost function is defined:
Wherein the method comprises the steps of G σ (·) gaussian kernel:
Here, we take:
then x k (i) optimal solution:
the matrixing form is as follows:
Wherein the method comprises the steps of And is also provided with Obtaining two diagonal matrixes
Step seven, two diagonal arraysTo correct one-step prediction covarianceAnd measurement error covariance
Thereby correcting the gain matrix;
Estimating the posterior state and covariance of the system filtering, specifically,
At this time, the estimation of the target state parameter can be completedSum-state estimation error covariance matrixWill be used for the estimation of the state parameter at the next moment.
The invention adopts the random weighted maximum cross-correlation entropy Kalman filtering (RWMCKF) algorithm to perform state estimation on the linear system under the condition of non-Gaussian heavy tail noise, and the application of the random weighting criterion enhances the robustness of the system and improves the filtering precision. According to the invention, MATLAB simulation software is used for carrying out simulation experiments, RWMCKF algorithm is compared with the existing filtering algorithms KF and MCKF to obtain the state estimation accuracy and estimation effectiveness are greatly improved.
The invention is illustrated by the following specific examples.
Example 1
Consider a general linear system model:
Wherein θ=pi/18, and the system noise is Gaussian noise q i (k-1) to N (0, 2) (i=1, 2), and the measurement noise is non-Gaussian mixed Gaussian noise r (k) to 0.9N (0, 1) +0.1N (0, 100).
According to the maximum correlation entropy Kalman filtering method based on the random weighting criterion, the state initial value is takenThe error covariance matrix takes P (0|0) =diag (100 ). The kernel width σ of the gaussian kernel function is set to 0.1, 0.5, 1,2, 3,5, 8, 10, and compared with KF algorithm and MCKF (σ=2), respectively, to obtain probability density functions of the two states x 1、x2 of fig. 2 and 3 under different filtering algorithms. The simulation result of the maximum correlation entropy Kalman filtering method based on the random weighting criterion is shown as a curve RWMCKF, compared with the traditional KF and MCKF, the performance advantage is obvious, the KF algorithm is biased under the condition of heavy tail noise measurement, MCKF and RWMCKF are unbiased, but the unbiasedness of the RWCKF algorithm is more advantageous than that of the MCKF algorithm.
The effect of the kernel width σ of the gaussian kernel on the maximum correlation entropy kalman filter of the provided random weighting criteria of the present invention can be derived from fig. 3, 4 that RWCKF and MCKF have the similarity that σ=2 is most effective.
Embodiment two:
the simulation model is replaced by one-dimensional linear uniform acceleration motion, and the system model and the measurement model are as follows:
wherein Δt=0.1 s, and both the system noise and the measurement noise are nonlinear mixed gaussian noise:
q1(k-1)~0.9N(0,0.01)+0.1N(0,1)
q2(k-1)~0.9N(0,0.01)+0.1N(0,1)
q3(k-1)~0.9N(0,0.01)+0.1N(0,1)
r(k)~0.8N(0,0.01)+0.2N(0,100)。
According to the maximum correlation entropy Kalman filtering method based on the random weighting criterion, a filtering algorithm is initialized first. The state initial value and the covariance initial value are set to x (0) = [001] T, P (0|0) =diag (0.01,0.01,0.01), respectively. The kernel width σ of the gaussian kernel function is set to 2 (i.e., the relatively optimal kernel width in example 1), then a mean square error table under the algorithms KF, MCKF (σ=2) and RWMCKF (σ=2) can be obtained:
mean square error under the algorithms of tables IKF, MCKF (σ=2) and RWMCKF (σ=2)
Table I shows the mean square error of KF, MCKF (sigma=2) and RWMCKF (sigma=2), respectively, and it can be derived from Table I that the mean square error of the maximum correlation entropy Kalman filtering variance based on the random weighting criterion is minimum under the same Gaussian mixture system and measurement noise influence, which shows that the performance of the algorithm is greatly improved compared with KF and MCKF.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any changes or substitutions easily contemplated by those skilled in the art within the scope of the present invention should be included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (1)

1.一种基于随机加权准则的最大互相关熵卡尔曼滤波方法,其特征在于:包括以下步骤:1. A maximum cross-correlation entropy Kalman filtering method based on a random weighted criterion, characterized in that it comprises the following steps: 步骤一:构建线性系统方程和量测方程如下:Step 1: Construct the linear system equation and measurement equation as follows: 其中k-1表示第k-1时刻,xk∈Rn为第k时刻的n维系统状态向量,zk∈Rm为第k时刻的m维量测向量;Fk-1和Hk分别为已知的转移矩阵和量测矩阵,qk-1∈Rn为第k-1时刻的n维系统噪声,rk∈Rm为第k时刻的m维量测噪声;系统噪声服从高斯分布qk-1~N(0,Qk-1),其中N(0,Qk-1)表示均值为0、方差为Qk-1的正态分布;量测噪声为非高斯服从混合高斯分布rk~λN(0,Rk,1)+(1-λ)N(0,Rk,2),其中N(0,Rk,1)表示均值为0,方差为Rk,1的正态分布;N(0,Rk,2)均值为0,方差为Rk,2的正态分布;qk-1和rk为不相关的过程和量测高斯噪声,满足Wherein k-1 represents the k-1th moment, x k ∈R n is the n-dimensional system state vector at the kth moment, z k ∈R m is the m-dimensional measurement vector at the kth moment; F k-1 and H k are the known transfer matrix and measurement matrix respectively, q k-1 ∈R n is the n-dimensional system noise at the k-1th moment, and r k ∈R m is the m-dimensional measurement noise at the kth moment; the system noise obeys the Gaussian distribution q k-1 ~N(0,Q k-1 ), where N(0,Q k-1 ) represents a normal distribution with mean 0 and variance Q k-1 ; the measurement noise is non-Gaussian and obeys a mixed Gaussian distribution r k ~λN(0,R k,1 )+(1-λ)N(0,R k,2 ), where N(0,R k,1 ) represents a normal distribution with mean 0 and variance R k,1 ; N(0,R k,2 ) has a mean of 0 and a variance of R k,2 is a normal distribution; q k-1 and r k are uncorrelated process and measurement Gaussian noises, satisfying 其中E[·]代表数学期望,δkj是克罗内克符号函数,代表混合噪声向量rj的转置向量,Rk第k时刻的量测噪声协方差矩阵,分别代表上述的向量qj和rj的转置向量;where E[·] represents the mathematical expectation, δ kj is the Kronecker sign function, represents the transposed vector of the mixed noise vector rj , Rk is the measurement noise covariance matrix at the kth moment, and Represent the transposed vectors of the above vectors qj and rj respectively; 步骤二:初始化,选择一个核宽σ,且初始化系统状态和协方差P(0|0),令k=1;Step 2: Initialization, select a kernel width σ and initialize the system state and covariance P(0|0), let k=1; 步骤三:根据系统的一步预测方程,更新先验状态和协方差Pk|k-1Step 3: Update the prior state according to the system's one-step prediction equation and covariance P k|k-1 ; 步骤四:在固定点迭代时刻再次初始化状态值:令t=1和 Step 4: Initialize the state value again at the fixed point iteration time: let t = 1 and 步骤五:根据初始系统和量测方程进行系统模型变形,计算新模型的误差,由此计算出误差的核函数;Step 5: Deform the system model according to the initial system and measurement equations, calculate the error of the new model, and thus calculate the kernel function of the error; 首先,将状态方程与量测方程重建:First, the state equation and measurement equation are reconstructed: 其中:E[·]代表数学期望,Pk|k-1是第k时刻的状态一步预测误差协方差矩阵,Rk是第k时刻的量测噪声协方差矩阵,BP(k|k-1)是对Pk|k-1进行Cholesky分解后得到的矩阵,是BP(k|k-1)的转置矩阵,同理BR(k)是Rk进行Cholesky分解后得到的矩阵,是BR(k)的转置矩阵,Bk是由BP(k|k-1)与BR(k)构成的新的对角矩阵;Where: E[·] represents the mathematical expectation, P k|k-1 is the state one-step prediction error covariance matrix at the kth moment, R k is the measurement noise covariance matrix at the kth moment, and BP (k|k-1) is the matrix obtained by Cholesky decomposition of P k|k-1 . is the transposed matrix of BP (k|k-1). Similarly, BR (k) is the matrix obtained by Cholesky decomposition of Rk . is the transposed matrix of BR (k), and Bk is a new diagonal matrix composed of BP (k|k-1) and BR (k); 在方程的两侧同时左乘以得:In the equation Multiply both sides of have to: Dk=Wkxk+ek D k = W k x k + e k 其中误差向量ek第i列元素为:in The i-th column element of the error vector e k is: ek(i)=di(k)-wi(k)xk(i)e k (i)=d i (k) -wi (k)x k (i) 其中:di(k)是Dk的第i个元素,wi(k)是矩阵Wk的第i行元素,xk(i)在此处代表xk的第i个状态量,且Dk为L=n+m维向量;Where: d i (k) is the i-th element of D k , w i (k) is the i-th row element of matrix W k , x k (i) here represents the i-th state quantity of x k , and D k is a L = n + m dimensional vector; 步骤六:由随机加权准则和核函数得出两个对角阵;Step 6: Obtain two diagonal matrices by using the random weighted criterion and kernel function; 由于随机加权准则,定义新的代价函数:Due to the random weighting criterion, a new cost function is defined: 其中Gσ(·)高斯核函数: in G σ (·) Gaussian kernel function: 在此取: Take it here: 则xk(i)的最优解:Then the optimal solution of x k (i) is: 矩阵化形式为:The matrix form is: 其中 得到两个对角矩阵 in and Get two diagonal matrices 步骤七:两个对角阵来修正一步预测协方差和量测误差协方差 Step 7: Two diagonal matrices To correct the one-step forecast covariance and measurement error covariance 其中分别为Cx(k)和Cz(k)的逆矩阵;in and are the inverse matrices of C x (k) and C z (k) respectively; 从而修正增益矩阵;Thus the gain matrix is corrected; 步骤八:估计出系统滤波的后验状态Step 8: Estimate the posterior state of the system filter 和协方差and covariance 若k+1=N,其中N为预设的算法迭代次数,则停止计算;否则继续执行上述步骤。If k+1=N, where N is the preset number of algorithm iterations, then stop the calculation; otherwise, continue to execute the above steps.
CN202111568689.4A 2021-12-21 2021-12-21 A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria Active CN114221638B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111568689.4A CN114221638B (en) 2021-12-21 2021-12-21 A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111568689.4A CN114221638B (en) 2021-12-21 2021-12-21 A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria

Publications (2)

Publication Number Publication Date
CN114221638A CN114221638A (en) 2022-03-22
CN114221638B true CN114221638B (en) 2025-03-25

Family

ID=80704628

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111568689.4A Active CN114221638B (en) 2021-12-21 2021-12-21 A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria

Country Status (1)

Country Link
CN (1) CN114221638B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114614797B (en) * 2022-05-12 2022-09-30 之江实验室 Adaptive filtering method and system based on generalized maximum asymmetric correlation entropy criterion
CN116559694A (en) * 2023-05-31 2023-08-08 桂林航天工业学院 Battery SOC Estimation Method Based on Adaptive Maximum Correlation Entropy Correction Iterative Kalman Filter
CN117705108B (en) * 2023-12-12 2025-03-14 中铁第四勘察设计院集团有限公司 Filtering positioning method, system and filter based on maximum correlation entropy

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104112079A (en) * 2014-07-29 2014-10-22 洛阳理工学院 Fuzzy adaptive variational Bayesian unscented Kalman filter method
CN109459705A (en) * 2018-10-24 2019-03-12 江苏理工学院 A kind of power battery SOC estimation method of anti-outlier robust Unscented kalman filtering

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5043988A (en) * 1989-08-25 1991-08-27 Mcnc Method and apparatus for high precision weighted random pattern generation
WO2008133679A1 (en) * 2007-04-26 2008-11-06 University Of Florida Research Foundation, Inc. Robust signal detection using correntropy
CN108983215A (en) * 2018-05-25 2018-12-11 哈尔滨工程大学 A kind of method for tracking target based on maximum cross-correlation entropy adaptively without mark particle filter
CN110501686A (en) * 2019-09-19 2019-11-26 哈尔滨工程大学 State estimation method based on a novel adaptive high-order unscented Kalman filter

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104112079A (en) * 2014-07-29 2014-10-22 洛阳理工学院 Fuzzy adaptive variational Bayesian unscented Kalman filter method
CN109459705A (en) * 2018-10-24 2019-03-12 江苏理工学院 A kind of power battery SOC estimation method of anti-outlier robust Unscented kalman filtering

Also Published As

Publication number Publication date
CN114221638A (en) 2022-03-22

Similar Documents

Publication Publication Date Title
CN114221638B (en) A Maximum Cross-Correlation Entropy Kalman Filtering Method Based on Random Weighted Criteria
CN111337893B (en) An off-grid DOA estimation method based on real-valued sparse Bayesian learning
CN103954931B (en) A kind of localization method of far field and near field mixed source
CN104698433A (en) Single-snapshot data-based coherent signal DOA (direction of arrival) estimating method
CN112115419A (en) System state estimation method and system state estimation device
Wu et al. Direction-of-arrival estimation based on Toeplitz covariance matrix reconstruction
CN104616059B (en) A kind of Wave arrival direction estimating method based on quantum particle swarm
CN114462454A (en) Grid-free signal source DOA estimation method based on deep learning
CN111969979B (en) Minimum error entropy CDKF filter method
Li et al. Data-driven discovery of block-oriented nonlinear models using sparse null-subspace methods
CN111798494B (en) Maneuvering target robust tracking method under generalized correlation entropy criterion
CN111666688B (en) Corrected channel estimation algorithm combining angle mismatch with sparse Bayesian learning
CN110460549B (en) Novel channel estimation method of multi-user 3D MIMO system
CN108566237B (en) A Low-complexity Geometric Mean Decomposition Precoding Implementation Method Based on Bi-diagonalization
CN109217844B (en) Hyperparameter optimization method based on pre-trained stochastic Fourier feature kernel LMS
Scott et al. Nonlinear system identification and prediction using orthogonal functions
CN108710101A (en) A kind of DOA algorithm for estimating obtaining coherent signal subspace using orthogonality
CN113486522A (en) Fractional order nonlinear time-delay system parameter estimation method based on Legendre wavelet
CN113534040A (en) Coherent Source Off-grid DOA Estimation Method Based on Weighted Second-Order Sparse Bayesian
CN104537248B (en) Sources number estimation method for polarization sensitive array
CN112052585A (en) A Distributed Dimensionality Reduction Observer Design Method for Linear Time-Invariant Systems
Osinsky et al. Probabilistic examination of least squares error in low-bitwidth cholesky decomposition
David et al. Nonlinear split-plot design model in parameters estimation using estimated generalized least square-maximum likelihood estimation
CN105182299B (en) Non-orthogonal joint diagonalization echo signal processing method based on multiple spin matrix
CN113872567B (en) A complex affine projection adaptive signal processing method based on kernel function

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
点击 这是indexloc提供的php浏览器服务,不要输入任何密码和下载