颗粒过滤器
有界函数
计算
数学
重采样
协方差
卡尔曼滤波器
杠杆(统计)
西格玛
算法
控制理论(社会学)
扩展卡尔曼滤波器
转化(遗传学)
李群
无味变换
计算机科学
调度(生产过程)
财产(哲学)
滤波器(信号处理)
计算复杂性理论
数学优化
国家(计算机科学)
辅助粒子过滤器
上下界
网络数据包
应用数学
离散时间和连续时间
不确定性传播
作者
Tao Li,Jun Yu,Yuqiang Jin,Chao Wang,Ling Pei,Wen‐An Zhang,Trieu‐Kien Truong
标识
DOI:10.1109/tcyb.2026.3663164
摘要
This article proposes two types of unscented particle filters (UPFs) that leverage unscented transformation (UT) from a geometric perspective to compute the proposal distribution. An UPF on Lie groups is first developed. Specifically, both the propagation of the sigma points and the computation of the mean and covariance are performed on the Lie groups, while the weight update and resampling are conducted on the Lie algebra. Second, we introduce the log-linear property of group elements to streamline particle propagation by reducing redundant operations, thereby optimizing the proposed UPF framework. In the update process, intermittent measurements that are caused by factors such as packet dropouts and stochastic sensor scheduling are considered. While lowering computational demands, these measurements pose challenges to filter stability. To this end, the introduced property is used to prove that the estimation error remains bounded under certain assumptions. We further establish a critical threshold for the arrival rate of intermittent measurements and derive an upper bound for the expected state error covariance. Moreover, a detailed computational complexity analysis is conducted to evaluate the efficiency of the proposed method. Finally, with the original method serving as a benchmark, simulation and real-world GNSS/INS integrated navigation experiments confirm that the redesigned approach delivers comparable performance and significantly improved computational efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI