WO2020052213A1 - 一种迭代容积点无迹卡尔曼滤波方法 - Google Patents

一种迭代容积点无迹卡尔曼滤波方法 Download PDF

Info

Publication number
WO2020052213A1
WO2020052213A1 PCT/CN2019/079135 CN2019079135W WO2020052213A1 WO 2020052213 A1 WO2020052213 A1 WO 2020052213A1 CN 2019079135 W CN2019079135 W CN 2019079135W WO 2020052213 A1 WO2020052213 A1 WO 2020052213A1
Authority
WO
WIPO (PCT)
Prior art keywords
points
sigma
unscented kalman
kalman filter
iterative
Prior art date
Application number
PCT/CN2019/079135
Other languages
English (en)
French (fr)
Inventor
徐晓苏
梁紫依
杨阳
袁杰
刘兴华
Original Assignee
东南大学
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 东南大学 filed Critical 东南大学
Publication of WO2020052213A1 publication Critical patent/WO2020052213A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/15—Correlation function computation including computation of convolution operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis

Definitions

  • the invention belongs to the technical field of communication navigation, and relates to an iterative volume point unscented Kalman filtering method.
  • Kalman filtering technology is an algorithm for optimally estimating the state of the system through the system's input and output observation data. It has important significance and has been well applied in many fields such as communication, navigation, guidance and control. In linear stationary systems with known noise, general linear Kalman filtering can be effectively used, but in non-linear systems, because the state transition matrix cannot be represented linearly, there are many improved Kalman filtering techniques. .
  • Extended Kalman filter is to expand the nonlinear system function according to Taylor, and take its linear part to solve the state matrix. Although this method is less computationally expensive than other nonlinear filters, it cannot solve high-degree-of-freedom nonlinear strong System estimation problem.
  • Volumetric Kalman Filtering and Unscented Kalman Filtering is a filtering technique that fits a line with points. It takes a series of points in a non-linear function and then fits the entire non-linear function by mapping the point set.
  • the trace Kalman filtering process is shown in Figure 1.
  • the volume points are characterized by the same weight, but the volume points cannot fit the statistical characteristics of strong nonlinear functions well.
  • the sigma points of the untraced Kalman filter have weights during the filtering process. Becomes negative, which diverges the filtered results.
  • the present invention discloses an iterative volume point unscented Kalman filtering method, which is improved on the original Kalman filtering method, and can be effectively applied to a system with high degree of freedom and strong nonlinearity.
  • the invention firstly provides a new method for selecting sigma points; secondly, according to the requirements of the positive definiteness of weights in the filtering process, the weight coefficients of each sigma points are given, which is closer to the statistical characteristics of the state quantity, thereby solving the traditional unscented Karl
  • the filter divergence problem caused by Mann filter due to the non-positive definiteness of the error covariance matrix again, the design flow of the general volume point Kalman filtering algorithm is given; finally, the parameter iteration method is used to diagnose the weight of the sigma points in the filter online Positive definiteness.
  • the present invention provides the following technical solutions:
  • An iterative volume point unscented Kalman filter algorithm includes the following steps:
  • Re-determining the weighting coefficient of the sigma points Re-determine the weighting coefficients of the sigma points in the filtering process, calculate the average value of the state prediction value at the last moment online, and compare with the state amount calculated by the weighted average of the non-linear mapping of the sigma points To determine the positive definiteness of the weight coefficient, the average value of the state quantity calculated by the weighted average of the sigma points must be equal to the average value of the previous state prediction value, and ensure that the weights are positive definite throughout the filtering process;
  • volume point unscented Kalman filtering algorithm Introducing the Kalman gain iteration coefficient into the volume point unscented Kalman filter, and detecting the positive definiteness of the weight in the filtering process in real time to avoid filtering divergence.
  • step 1) selects the sigma points of the iterative volume point unscented Kalman filter algorithm in step 1):
  • m is the average of the initial state quantities
  • P is the error covariance matrix of the initial state quantities
  • k is the empirical value
  • ⁇ determines the degree of dispersion of the sigma points
  • T is the transpose of the matrix
  • E i is defined as:
  • step 2 the specific steps of re-determining the weighting coefficient of the sigma point in step 2) include:
  • step 3 specifically includes the following steps:
  • X is a state quantity
  • Q is a covariance matrix of noise
  • u is an input
  • F ( ⁇ k , u k ) is a state quantity
  • ⁇ is the sigma points by mapping of the observation matrix
  • H is the observation matrix
  • W i m is the weight of observations
  • R k is the measurement noise
  • Y is the observed value
  • K is the Kalman gain
  • step 4) specifically includes the following steps:
  • G is a proportional parameter
  • the present invention has the following advantages and beneficial effects:
  • the invention can be effectively applied to a system of high-degree-of-freedom and strong nonlinearity containing random noise, and cooperatively solves the calculation amount problem, the non-linear filter divergence problem, and the negative weight problem, and can effectively improve the estimation accuracy and real-time property of the state quantity. Will diverge the filtering results.
  • the present invention can better fit the statistical characteristics of non-linear system functions, and can avoid the non-positive definiteness of the sigma point weights with respect to the untraced Kalman filter.
  • Figure 1 is a flowchart of the unscented Kalman filtering algorithm.
  • FIG. 2 is a flowchart of a method for iteratively calculating a volume point Kalman filter provided by the present invention.
  • An iterative volume point Kalman filtering method includes the following steps:
  • Step 1 Initialize the state initial value and covariance matrix of the nonlinear system, and add the volume points selected in the volume Kalman filter algorithm to the sigma points of the untraced Kalman filter algorithm to form a new sigma point set online calculation state
  • the mean and covariance of the quantity include the following sub-steps:
  • volume points are added to the 2n + 1 sigma points of the original unscented Kalman filter to form a new set of 4n + 1 sigma points.
  • the average value of the state values calculated by weighting the sigma points must be equal to The average value of the state prediction value of the previous step.
  • the new sigma point is defined as:
  • m is the average of the initial state quantities
  • P is the error covariance matrix of the initial state quantities
  • k is an empirical value, usually 0
  • ⁇ determines the degree of the sigma points, usually a small positive value
  • T is a matrix Transpose
  • E i is defined as:
  • I is the identity matrix
  • Step 2 Re-determine the weight coefficient of the sigma points in the filtering process, calculate the average value of the state prediction value at the last moment online, and compare with the state amount calculated by the sigma point nonlinear mapping weighted average, and make the sigma point weighted average
  • the calculated state quantity average must be equal to the average value of the previous state prediction value.
  • the positive definiteness of the weight coefficient is determined. The process of re-determining the weight coefficient is as follows:
  • the weights are defined as:
  • Step 3 Use the improved sigma point set in step 1 and step 2 to solve the state transition matrix, establish a prediction and update model of the nonlinear system, and optimally estimate the state quantity at this moment, including the following processes:
  • the improved sigma points map non-linear functions, perform one-step prediction of the state quantity of the system, and estimate the covariance matrix in the prediction update.
  • X is a state quantity
  • Q is a covariance matrix of noise
  • u is an input
  • F ( ⁇ k , u k ) is a state quantity.
  • Step 4 Calculate the covariance matrix and Kalman gain in the prediction update, and continue to update the state quantity at the next moment, which specifically includes the following process:
  • ⁇ is the sigma points by mapping of the observation matrix
  • H is the observation matrix
  • W i m is the weight of observations
  • R k is the measurement noise
  • Y is the observed value
  • K is the Kalman gain.
  • Step 5 Iterative coefficients are introduced into the Kalman gain, the positive definiteness of the weight coefficients is diagnosed online, and the new state quantities in the iterative process are repeatedly calculated, including the following processes:
  • G is a proportional parameter
  • j is used for the number of times of all iteration processes, and is defined as follows:
  • x is the state amount of the index during the iteration.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Software Systems (AREA)
  • Databases & Information Systems (AREA)
  • Algebra (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Biology (AREA)
  • Operations Research (AREA)
  • Probability & Statistics with Applications (AREA)
  • Filters That Use Time-Delay Elements (AREA)
  • Feedback Control In General (AREA)
  • Navigation (AREA)

Abstract

一种迭代容积点无迹卡尔曼滤波方法，包括以下步骤：迭代容积点无迹卡尔曼滤波算法sigma点的选取；重新确定sigma点的加权系数；给出容积点无迹卡尔曼滤波算法的流程；迭代计算容积点无迹卡尔曼滤波算法。本方法能够有效应用在含有随机噪声的高自由度强非线性的系统中，协同处理解决计算量问题、非线性滤波发散问题、负权重问题，能够有效提高状态量的估计精度和实时性，不会使滤波结果发散。本方案相对于容积卡尔曼滤波可以更好地拟合非线性系统函数的统计特性，相对于无迹卡尔曼滤波可以避免sigma点权重的非正定性。

Description

一种迭代容积点无迹卡尔曼滤波方法 技术领域
本发明属于通信导航技术领域，涉及一种迭代容积点无迹卡尔曼滤波方法。
背景技术
卡尔曼滤波技术是通过系统输入输出观测数据，对系统状态进行最优估计的算法，具有重要的意义，在通信,导航,制导与控制等多领域得到了较好的应用。在含有已知噪声的线性定常系统中，一般的线性卡尔曼滤波即可有效使用，但是在非线性系统中，由于状态转移矩阵无法被线性的表示，因此有多种改进的卡尔曼滤波技术产生。
扩展卡尔曼滤波是将非线性系统函数按照泰勒展开，取其线性部分进行状态矩阵的求解，此方法虽然相比于其他非线性滤波在计算量上较小，但无法解决高自由度非线性强的系统估计问题。容积卡尔曼滤波和无迹卡尔曼滤波是一种以点来拟合线的滤波技术，通过在非线性函数中取一系列的点，然后通过点集的映射来拟合整个非线性函数，无迹卡尔曼滤波流程如图1所示，容积点的特点是权重相同，但是容积点无法很好拟合强非线性函数的统计特性，而无迹卡尔曼滤波的sigma点在滤波过程中权重会变为负数，这会使滤波的结果发散。
综上所述，面对实际环境中多种传感器间的非线性耦合、协同导航模式，传统的滤波方式无法将计算量问题、非线性滤波发散问题、负权重问题协同处理，需要得到改进。
发明内容
为解决上述问题，本发明公开了一种迭代容积点无迹卡尔曼滤波方法，在原有卡尔曼滤波方法上进行改进，能够有效应用在高自由度强非线性的系统中。本发明首先给出了新的sigma点的选取方法；其次根据滤波过程中权重正定性的要求，给出了各sigma点的权重系数，更接近状态量的统计特性，从而解决了传统无迹卡尔曼滤波由于误差协方差矩阵的非正定性引起的滤波发散问题；再次，给出了一般性的容积点卡尔曼滤波算法的设计流程；最后利用参数迭代的方式，在线诊断滤波中sigma点权重的正定性。
为了达到上述目的，本发明提供如下技术方案：
一种迭代容积点无迹卡尔曼滤波算法，包括如下步骤：
1)迭代容积点无迹卡尔曼滤波算法sigma点的选取：将容积卡尔曼滤波算法中选取的容积点添加到无迹卡尔曼滤波算法的sigma点中，形成新的sigma点集在线计算状态量的均值和协方差；
2)重新确定sigma点的加权系数：重新确定滤波过程中sigma点的权重系数，在线计算上一时刻状态预测值的平均值，并与通过sigma点非线性映射加权平均计算后的状态量相比，确定权重系数的正定性，通过对sigma点加权平均计算后的状态量平均值必须等于前一步状态预测值的平均值，并且保证在整个滤波过程中权重均是正定的；
3)给出容积点无迹卡尔曼滤波算法的流程：利用改进后的sigma点拟合非线性函数，并通过非线性映射后的统计特性更新最优估计的状态量和协方差矩阵；
4)迭代计算容积点无迹卡尔曼滤波算法：在容积点无迹卡尔曼滤波中引入卡尔曼增益迭代系数，并实时检测滤波过程中权重的正定性，避免滤波的发散。
进一步的，所述步骤1)中迭代容积点无迹卡尔曼滤波算法sigma点的选取的具体步骤包括：
(1.1)在容积积分中，利用2n个等权球面点来积分计算∫f(y)dy，其中f(y)是任意非线性系统函数，其中，n是函数变量的个数；
(1.2)在原有的无迹卡尔曼滤波的2n+1个sigma点中添加容积点，形成新的4n+1个sigma点集，通过对sigma点加权平均计算后的状态值平均值必须等于前一步状态预测值的平均值，新的sigma点定义为：
Figure PCTCN2019079135-appb-000001
其中，m是初始状态量的均值；P是初始状态量的误差协方差矩阵；k为经验取值；α决定sigma点的散布程度；T是矩阵的转置；E i定义为：
Figure PCTCN2019079135-appb-000002
进一步的，所述步骤2)中重新确定sigma点的加权系数的具体步骤包括：
(2.1)在原有的容积点等权重系数中引入微调参数λ、κ、α、β，抑制无迹卡尔曼滤波sigma点权重的非正定性，将权重定义为：
Figure PCTCN2019079135-appb-000003
进一步的，所述步骤3)具体包括如下步骤：
(3.1)利用所述步骤1)和2)中改进的sigma点进行非线性函数的映射，对系统进行状态量的一步预测，并估计预测更新中的协方差矩阵：
Figure PCTCN2019079135-appb-000004
其中，X是状态量，Q是噪声的协方差矩阵，u是输入，F(χ k,u k)是状态量；
(3.2)使用新的微调参数λ和
Figure PCTCN2019079135-appb-000005
来计算sigma点，实现重排传递函数点，即χ′ k+1/k和w′ i，计算卡尔曼滤波系数，并完成本次状态量的最优估计：
Figure PCTCN2019079135-appb-000006
其中，Υ为sigma点通过观测矩阵的映射；H为观测矩阵；W i m为观测量的权重；R k为观测噪声；y为观测值；K为卡尔曼增益；
(3.3)将式(3.2)中P k+1和
Figure PCTCN2019079135-appb-000007
用于下次循环计算的新sigma点集：
Figure PCTCN2019079135-appb-000008
进一步的，所述步骤4)具体包括如下步骤：
(4.1)定义参数j如下，用于索引在迭代过程中的次数：
Figure PCTCN2019079135-appb-000009
(4.2)将如权利要求1所述步骤1)中式(1.1)的参数表示为
Figure PCTCN2019079135-appb-000010
P 0＝P k+1,j+1，计算sigma点，重复更新如权利要求1步骤3)中的卡尔曼滤波流程；
(4.3)引入参数计算迭代过程中新的状态量，将式(4.1)中的状态量形式改写为：
Figure PCTCN2019079135-appb-000011
其中，G为比例参数；
(4.4)定义参数为：
Figure PCTCN2019079135-appb-000012
其中，h为观测向量函数；
(4.5)定义不等式为：
Figure PCTCN2019079135-appb-000013
用于在线诊断滤波过程中权重的正定性，并且在每一次迭代中计算j＝j+1,G＝ηG，直到迭代过程结束，其中，R为观测噪声协方差矩阵。
与现有技术相比，本发明具有如下优点和有益效果：
本发明能够有效应用在含有随机噪声的高自由度强非线性的系统中，协同处理解决计算量问题、非线性滤波发散问题、负权重问题，能够有效提高状态量的估计精度和实时性，不 会使滤波结果发散。本发明相对于容积卡尔曼滤波可以更好地拟合非线性系统函数的统计特性，相对于无迹卡尔曼滤波可以避免sigma点权重的非正定性。
附图说明
图1是无迹卡尔曼滤波算法的流程图。
图2是本发明提供的迭代计算容积点卡尔曼滤波方法的流程图。
具体实施方式
以下将结合具体实施例对本发明提供的技术方案进行详细说明，应理解下述具体实施方式仅用于说明本发明而不用于限制本发明的范围。
本发明所述的一种迭代容积点卡尔曼滤波方法，其流程如图2所示，包含以下步骤：
步骤1：初始化非线性系统的状态初值与协方差矩阵，并将容积卡尔曼滤波算法中选取的容积点添加到无迹卡尔曼滤波算法的sigma点中，形成新的sigma点集在线计算状态量的均值和协方差，具体包括如下子步骤：
在容积积分中，利用2n个等权球面点(n是函数变量的个数)来积分计算∫f(y)dy，其中f(y)是任意非线性系统函数。
在原有的无迹卡尔曼滤波的2n+1个sigma点中添加容积点，形成新的4n+1个sigma点集，本发明方法中通过对sigma点加权平均计算后的状态值平均值必须等于前一步状态预测值的平均值，新的sigma点定义为：
Figure PCTCN2019079135-appb-000014
其中，m是初始状态量的均值；P是初始状态量的误差协方差矩阵；k为经验取值，通常取0；α决定sigma点的散布程度，通常取一个小的正值；T是矩阵的转置；E i定义为：
Figure PCTCN2019079135-appb-000015
其中，I是单位矩阵。
步骤2：重新确定滤波过程中sigma点的权重系数，在线计算上一时刻状态预测值的平均值，并与通过sigma点非线性映射加权平均计算后的状态量相比，并令sigma点加权平均计算后的状态量平均值必须等于前一步状态预测值的平均值，确定权重系数的正定性，重新确定权重系数的过程如下：
在原有的容积点等权重系数中引入微调参数λ、κ、α、β，抑制无迹卡尔曼滤波sigma点权重的非正定性，将权重定义为：
Figure PCTCN2019079135-appb-000016
步骤3：利用步骤1和步骤2中改进的sigma点集求解状态转移矩阵，建立非线性系统的预测更新模型，最优估计本时刻的状态量，具体包括如下过程：
改进的sigma点进行非线性函数的映射，对系统进行状态量的一步预测，并估计预测更新中的协方差矩阵。
Figure PCTCN2019079135-appb-000017
其中，X是状态量，Q是噪声的协方差矩阵，u是输入，F(χ k,u k)是状态量。
步骤4：计算预测更新中的协方差矩阵以及卡尔曼增益，在下一时刻中继续更新状态量，具体包括如下过程：
使用新的微调参数λ和
Figure PCTCN2019079135-appb-000018
来计算sigma点，实现重排传递函数点，即χ′ k+1/k和w′ i，计算卡尔曼滤波系数，并完成本次状态量的最优估计。
Figure PCTCN2019079135-appb-000019
其中，Υ为sigma点通过观测矩阵的映射；H为观测矩阵；W i m为观测量的权重；R k为观测噪声；y为观测值；K为卡尔曼增益。
将式(4.1)中P k+1和
Figure PCTCN2019079135-appb-000020
用于下次循环计算的新sigma点集：
Figure PCTCN2019079135-appb-000021
P′＝P k+1
步骤5：在卡尔曼增益中引入迭代系数，在线诊断权重系数的正定性，重复计算迭代过程中新的状态量，具体包括如下过程：
引入参数计算迭代过程中新的状态量，将式(4.1)中的状态量形式改写为：
Figure PCTCN2019079135-appb-000022
其中，G为比例参数，j用于所以迭代过程的次数，且如下定义：
Figure PCTCN2019079135-appb-000023
其中，x为迭代过程中索引的状态量。
将如步骤1中式(1.1)的参数表示为
Figure PCTCN2019079135-appb-000024
P 0＝P k+1,j+1，计算sigma点，重复更新步骤3中的卡尔曼滤波流程。
定义参数为：
Figure PCTCN2019079135-appb-000025
其中，h为观测向量函数。
定义不等式为：
Figure PCTCN2019079135-appb-000026
用于在线诊断滤波过程中权重的正定性，其中，R为观测噪声协方差矩阵，并且在每一次迭代中j＝j+1,G＝ηG，直到迭代过程结束。
本发明方案所公开的技术手段不仅限于上述实施方式所公开的技术手段，还包括由以上技术特征任意组合所组成的技术方案。应当指出，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围。

Claims (6)

  1. 一种迭代容积点无迹卡尔曼滤波算法，其特征在于，包括如下步骤：
    1)迭代容积点无迹卡尔曼滤波算法sigma点的选取：将容积卡尔曼滤波算法中选取的容积点添加到无迹卡尔曼滤波算法的sigma点中，形成新的sigma点集在线计算状态量的均值和协方差；
    2)重新确定sigma点的加权系数：重新确定滤波过程中sigma点的权重系数，在线计算上一时刻状态预测值的平均值，并与通过sigma点非线性映射加权平均计算后的状态量相比，确定权重系数的正定性；
    3)给出容积点无迹卡尔曼滤波算法的流程：利用改进后的sigma点拟合非线性函数，并通过非线性映射后的统计特性更新最优估计的状态量和协方差矩阵；
    4)迭代计算容积点无迹卡尔曼滤波算法：在容积点无迹卡尔曼滤波中引入卡尔曼增益迭代系数，并实时检测滤波过程中权重的正定性。
  2. 根据权利要求1所述的迭代容积点无迹卡尔曼滤波算法，其特征在于，所述步骤1)中迭代容积点无迹卡尔曼滤波算法sigma点的选取的具体步骤包括：
    (1.1)在容积积分中，利用2n个等权球面点来积分计算∫f(y)dy，其中f(y)是任意非线性系统函数，其中，n是函数变量的个数；
    (1.2)在原有的无迹卡尔曼滤波的2n+1个sigma点中添加容积点，形成新的4n+1个sigma点集，通过对sigma点加权平均计算后的状态值平均值必须等于前一步状态预测值的平均值，新的sigma点定义为：
    Figure PCTCN2019079135-appb-100001
    其中，其中，m是初始状态量的均值；P是初始状态量的误差协方差矩阵；k为经验取值；α决定sigma点的散布程度；T是矩阵的转置；E i的定义为：
    Figure PCTCN2019079135-appb-100002
  3. 根据权利要求1所述的迭代容积点无迹卡尔曼滤波算法，其特征在于，所述步骤2)中重新确定sigma点的加权系数的具体步骤包括：
    (2.1)在原有的容积点等权重系数中引入微调参数λ、κ、α、β，抑制无迹卡尔曼滤波 sigma点权重的非正定性，将权重定义为：
    Figure PCTCN2019079135-appb-100003
  4. 根据权利要求1所述的迭代容积点无迹卡尔曼滤波算法，其特征在于，所述步骤3)具体包括如下步骤：
    (3.1)利用所述步骤1)和2)中改进的sigma点进行非线性函数的映射，对系统进行状态量的一步预测，并估计预测更新中的协方差矩阵：
    Figure PCTCN2019079135-appb-100004
    其中，X是状态量，Q是噪声的协方差矩阵，u是输入，F(χ k,u k)是状态量；
    (3.2)使用新的微调参数λ和
    Figure PCTCN2019079135-appb-100005
    来计算sigma点，实现重排传递函数点，即χ′ k+1/k和w′ i，计算卡尔曼滤波系数，并完成本次状态量的最优估计：
    Figure PCTCN2019079135-appb-100006
    其中，Υ为sigma点通过观测矩阵的映射；H为观测矩阵；W i m为观测量的权重；R k为 观测噪声；y为观测值；K为卡尔曼增益；
    (3.3)将式(3.2)中P k+1和
    Figure PCTCN2019079135-appb-100007
    用于下次循环计算的新sigma点集：
    Figure PCTCN2019079135-appb-100008
  5. 根据权利要求1所述的迭代容积点无迹卡尔曼滤波算法，其特征在于，所述步骤4)具体包括如下步骤：
    (4.1)定义参数j如下，用于索引在迭代过程中的次数：
    Figure PCTCN2019079135-appb-100009
    (4.2)将如权利要求1所述步骤1)中式(1.1)的参数表示为
    Figure PCTCN2019079135-appb-100010
    P 0＝P k+1,j+1，计算sigma点，重复更新如权利要求1步骤3)中的卡尔曼滤波流程；
    (4.3)引入参数计算迭代过程中新的状态量，将式(4.1)中的状态量形式改写为：
    Figure PCTCN2019079135-appb-100011
    其中，G为比例参数；
    (4.4)定义参数为：
    Figure PCTCN2019079135-appb-100012
    其中，h为观测向量函数；
    (4.5)定义不等式为
    Figure PCTCN2019079135-appb-100013
  6. 用于在线诊断滤波过程中权重的正定性，并且在每一次迭代中计算j＝j+1,G＝ηG，直到迭代过程结束，其中，R为观测噪声协方差矩阵。
PCT/CN2019/079135 2018-09-11 2019-03-21 一种迭代容积点无迹卡尔曼滤波方法 WO2020052213A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811058809.4A CN109388778A (zh) 2018-09-11 2018-09-11 一种迭代容积点无迹卡尔曼滤波方法
CN201811058809.4 2018-09-11

Publications (1)

Publication Number Publication Date
WO2020052213A1 true WO2020052213A1 (zh) 2020-03-19

Family

ID=65418908

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/079135 WO2020052213A1 (zh) 2018-09-11 2019-03-21 一种迭代容积点无迹卡尔曼滤波方法

Country Status (2)

Country Link
CN (1) CN109388778A (zh)
WO (1) WO2020052213A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109388778A (zh) * 2018-09-11 2019-02-26 东南大学 一种迭代容积点无迹卡尔曼滤波方法
CN111238484B (zh) * 2020-02-28 2022-04-12 上海航天控制技术研究所 一种基于球形无迹变换的环火轨道自主导航方法
CN111756353B (zh) * 2020-06-12 2024-04-16 杭州电子科技大学 一种基于非线性融合滤波的液位仪噪声优化方法
CN113805075A (zh) * 2021-09-15 2021-12-17 上海电机学院 一种基于bcrls-ukf的锂电池荷电状态估计方法
CN117216482B (zh) * 2023-11-07 2024-03-01 南开大学 借助迭代策略增强卡尔曼滤波器抗野值干扰能力的方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050251328A1 (en) * 2004-04-05 2005-11-10 Merwe Rudolph V D Navigation system applications of sigma-point Kalman filters for nonlinear estimation and sensor fusion
CN105975747A (zh) * 2016-04-27 2016-09-28 渤海大学 一种基于无迹卡尔曼滤波算法的cstr模型参数辨识方法
CN108225337A (zh) * 2017-12-28 2018-06-29 西安电子科技大学 基于sr-ukf滤波的星敏感器和陀螺组合定姿方法
CN109388778A (zh) * 2018-09-11 2019-02-26 东南大学 一种迭代容积点无迹卡尔曼滤波方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050251328A1 (en) * 2004-04-05 2005-11-10 Merwe Rudolph V D Navigation system applications of sigma-point Kalman filters for nonlinear estimation and sensor fusion
CN105975747A (zh) * 2016-04-27 2016-09-28 渤海大学 一种基于无迹卡尔曼滤波算法的cstr模型参数辨识方法
CN108225337A (zh) * 2017-12-28 2018-06-29 西安电子科技大学 基于sr-ukf滤波的星敏感器和陀螺组合定姿方法
CN109388778A (zh) * 2018-09-11 2019-02-26 东南大学 一种迭代容积点无迹卡尔曼滤波方法

Also Published As

Publication number Publication date
CN109388778A (zh) 2019-02-26

Similar Documents

Publication Publication Date Title
WO2020052213A1 (zh) 一种迭代容积点无迹卡尔曼滤波方法
CN110659722B (zh) 基于AdaBoost-CBP神经网络的电动汽车锂离子电池健康状态估算方法
CN107045490A (zh) 一种非线性系统的状态估计方法
CN111537903B (zh) 一种基于hckf的电池soc估计方法
Hariz et al. Optimal rate of convergence for nonparametric change-point estimators for nonstationary sequences
CN114567288B (zh) 基于变分贝叶斯的分布协同非线性系统状态估计方法
Muntwiler et al. Learning-based moving horizon estimation through differentiable convex optimization layers
CN116595897A (zh) 一种基于消息传递的非线性动态系统状态估计方法和装置
CN109341690B (zh) 一种鲁棒高效的组合导航自适应数据融合方法
CN110222299A (zh) 针对双变量含有误差的直线拟合问题的方法和设备
CN110110711B (zh) 一种噪声信道下的迭代学习控制系统输入信号估计方法
Mattila et al. What did your adversary believeƒ Optimal filtering and smoothing in counter-adversarial autonomous systems
CN114614797B (zh) 基于广义最大非对称相关熵准则的自适应滤波方法和系统
Vladimirov et al. Directly coupled observers for quantum harmonic oscillators with discounted mean square cost functionals and penalized back-action
CN114413448B (zh) 空调所属建筑物一阶模型实时参数辨识方法
CN107421543B (zh) 一种基于状态扩维的隐函数量测模型滤波方法
CN115498980A (zh) 一种基于M估计的递归最小p阶自适应滤波定位方法
CN112636719A (zh) 数据丢失和信道噪声干扰下的ilc系统输入信号滤波方法
CN110765608A (zh) 一种用于微机电系统传感器的高精度交互两级估计算法
CN116340766B (zh) 基于滑动窗口的锂电池soc在线预测方法与相关设备
CN113269309B (zh) 适用于微弱信号提取的rbf神经网络改进ukf方法
CN117236060A (zh) 一种基于辅助模型的连续搅拌反应釜新型递推估计方法
CN113472318B (zh) 一种顾及观测模型误差的分级自适应滤波方法及系统
Kolås et al. State estimation IS the real challenge in NMPC
CN117150212A (zh) 一种基于小样本历史数据的一元时间序列预测方法及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19860316

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19860316

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 13.01.2022)

122 Ep: pct application non-entry in european phase

Ref document number: 19860316

Country of ref document: EP

Kind code of ref document: A1