On Suboptimal Kalman Filtering In Case Of Cluttered Observations
39TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY (IECON 2013)(2013)
摘要
This paper examines Kalman filtering and three suboptimal methods in the case of delayed and out-of-sequence measurements in networked or wireless systems. The motivation for suboptimality for Kalman filtering stems from the low computational resources of wireless devices. Optimality is reduced by using a history of a finite horizon. It is shown that the suboptimal filtering with full iteration within the update window performs very similar to the optimal filter, even with a short history window.
更多查看译文
关键词
Kalman filter,clutter,low computation complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要