捷联惯导系统学习5.2(递归最小二乘法 )

采用递推方式求解最小二乘法(Recursive Least Square RLS)可以有效减小数据存储量。

测量方程

Z ‾ k = H ‾ k X + V ‾ k \overline Z_k=\overline H_kX+\overline V_k Zk=HkX+Vk
Z ‾ k = [ Z 1 Z 2 Z 3 . . . Z i ] , H ‾ k = [ H 1 H 2 H 3 . . . H i ] , V ‾ k = [ V 1 V 2 V 3 . . . V i ] E [ V ‾ i ] = 0 , E [ V ‾ i V ‾ i T ] = R ‾ i = d i a g ( R 1 , R 2 , R 3 , . . . ) \overline Z_k=\left[\begin{matrix}Z_1\\Z_2\\Z_3\\...\\Z_i \end{matrix}\right],\overline H_k=\left[\begin{matrix}H_1\\H_2\\H_3\\...\\H_i \end{matrix}\right],\overline V_k=\left[\begin{matrix}V_1\\V_2\\V_3\\...\\V_i \end{matrix}\right] \\ E[\overline V_i]=0,E[\overline V_i\overline V_i^T]=\overline R_i=diag(R_1,R_2,R_3,...) Zk=Z1Z2Z3...Zi,Hk=H1H2H3...Hi,Vk=V1V2V3...ViE[Vi]=0,E[ViViT]=Ri=diag(R1,R2,R3,...)
最小二乘估计
X ^ W L S = ( H T W H ) − 1 H T W Z \hat X_{WLS}=(H^TWH)^{-1}H^TWZ X^WLS=(HTWH)1HTWZ
对测量方程做最小二乘估计
k − 1 k-1 k1时最小二乘估计
X ^ k − 1 = ( H ‾ k − 1 T R ‾ k − 1 − 1 H ‾ k − 1 ) − 1 H ‾ k − 1 T R ‾ k − 1 − 1 Z ‾ k − 1 = P k − 1 H ‾ k − 1 T R ‾ k − 1 − 1 Z ‾ k − 1 P k − 1 = ( H ‾ k − 1 T R ‾ k − 1 − 1 H ‾ k − 1 ) − 1 \hat X_{k-1}=(\overline H_{k-1}^T\overline R^{-1}_{k-1}\overline H_{k-1})^{-1}\overline H_{k-1}^T\overline R^{-1}_{k-1}\overline Z_{k-1}=P_{k-1} \overline H_{k-1}^T\overline R^{-1}_{k-1}\overline Z_{k-1} \\ P_{k-1} =(\overline H_{k-1}^T\overline R^{-1}_{k-1}\overline H_{k-1})^{-1} X^k1=(Hk1TRk11Hk1)1Hk1TRk11Zk1=Pk1Hk1TRk11Zk1Pk1=(Hk1TRk11Hk1)1
k k k时最小二乘估计
X ^ k = ( H ‾ k T R ‾ k − 1 H ‾ k ) − 1 H ‾ k T R ‾ k − 1 Z ‾ k = P k ( [ H ‾ k − 1 T H k T ] [ R ‾ k − 1 − 1 0 0 R k − 1 ] [ Z ‾ k − 1 Z k ] ) = P k ( H ‾ k − 1 T R ‾ k − 1 − 1 Z ‾ k − 1 + H k T R k − 1 Z k ) = X ^ k − 1 + P k H k T R k − 1 ( Z k − H k X ^ k − 1 ) = X ^ k − 1 + K k ( Z k − H k X ^ k − 1 ) \hat X_{k}=(\overline H_{k}^T\overline R^{-1}_{k}\overline H_{k})^{-1}\overline H_{k}^T\overline R^{-1}_{k}\overline Z_{k}\\ =P_k(\left[\begin{matrix} \overline H_{k-1}^T&H_k^T\\ \end{matrix}\right]\left[\begin{matrix} \overline R_{k-1}^{-1}&0\\0&R_k^{-1}\\ \end{matrix}\right]\left[\begin{matrix} \overline Z_{k-1}\\Z_k\\ \end{matrix}\right])\\ =P_k(\overline H_{k-1}^T\overline R^{-1}_{k-1}\overline Z_{k-1} +H_k^TR_k^{-1}Z_k)\\ =\hat X_{k-1}+P_{k}H_{k}^TR_k^{-1}(Z_k-H_k\hat X_{k-1}) \\ =\hat X_{k-1}+K_k(Z_k-H_k\hat X_{k-1}) X^k=(HkTRk1Hk)1HkTRk1Zk=Pk([Hk1THkT][Rk1100Rk1][Zk1Zk])=Pk(Hk1TRk11Zk1+HkTRk1Zk)=X^k1+PkHkTRk1(ZkHkX^k1)=X^k1+Kk(ZkHkX^k1)
P k = H ‾ k T R ‾ k − 1 H ‾ k = ( [ H ‾ k − 1 T H k T ] [ R ‾ k − 1 − 1 0 0 R k − 1 ] [ Z ‾ k − 1 Z k ] ) − 1 = ( P k − 1 − 1 + H k T R k − 1 H k ) − 1 P_k=\overline H_{k}^T\overline R^{-1}_{k}\overline H_{k}=(\left[\begin{matrix} \overline H_{k-1}^T&H_k^T\\ \end{matrix}\right]\left[\begin{matrix} \overline R_{k-1}^{-1}&0\\0&R_k^{-1}\\ \end{matrix}\right]\left[\begin{matrix} \overline Z_{k-1}\\Z_k\\ \end{matrix}\right])^{-1}=(P_{k-1}^{-1}+H_k^TR_k^{-1}H_k)^{-1} Pk=HkTRk1Hk=([Hk1THkT][Rk1100Rk1][Zk1Zk])1=(Pk11+HkTRk1Hk)1
K k = P k H k T R k − 1 K_k=P_{k}H_{k}^TR_k^{-1} Kk=PkHkTRk1
最小二乘估计递推公式
P k − 1 P_{k}^{-1} Pk1左乘 P k P_k Pk右乘 P k − 1 P_{k-1} Pk1
P k P k − 1 P k − 1 = P k ( P k − 1 − 1 + H k T R k − 1 H k ) P k − 1 P_kP_k^{-1}P_{k-1}=P_k(P_{k-1}^{-1}+H_k^TR_k^{-1}H_k)P_{k-1} PkPk1Pk1=Pk(Pk11+HkTRk1Hk)Pk1
得到 P k P_k Pk
P k = P k − 1 − P k H k T R k − 1 H k P k − 1 P_k=P_{k-1}^{}-P_kH_k^TR_k^{-1}H_kP_{k-1} Pk=Pk1PkHkTRk1HkPk1
再将 P k P_k Pk右乘 H k T H_k^T HkT整理可得:
K k = P k H k T R k − 1 = P k − 1 H k T ( H k P k − 1 H k T + R k ) − 1 K_k=P_kH_k^TR_k^{-1}=P_{k-1}H_k^T(H_kP_{k-1}H_k^T+R_k)^{-1} Kk=PkHkTRk1=Pk1HkT(HkPk1HkT+Rk)1
得到递推公式为:
{ K k = P k − 1 H k T ( H k P k − 1 H k T + R k ) − 1 P k = P k − 1 − P k H k T R k − 1 H k P k − 1 X ^ k = X ^ k − 1 + K k ( Z k − H k X ^ k − 1 ) \begin{cases} K_k=P_{k-1}H_k^T(H_kP_{k-1}H_k^T+R_k)^{-1}\\ P_k=P_{k-1}^{}-P_kH_k^TR_k^{-1}H_kP_{k-1}\\ \hat X_{k}=\hat X_{k-1}+K_k(Z_k-H_k\hat X_{k-1})\\ \end{cases} Kk=Pk1HkT(HkPk1HkT+Rk)1Pk=Pk1PkHkTRk1HkPk1X^k=X^k1+Kk(ZkHkX^k1)

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值