首页 /研究 /Decreasing the Computational Demand of Unscented Kalman Filter based Methods
PERCEPTION

Decreasing the Computational Demand of Unscented Kalman Filter based Methods

József Kuti, Péter Galambos

发表年份
2021
引用次数
6

摘要

Computational load is a critical factor in sensor fusion applications especially in mobile devices (e.g., robots, drones, etc.) with limited resources onboard. The paper proposes a computational relaxation for the Unscented Transformation (UT) that is an essential part of the Unscented Kalman-filter based applications. The derivation for the most commonly used UT variant is presented and it is shown how the number of necessary sigma points is reduced. The practical merit of the proposed relaxation is demonstrated through a mobile robot localization example that clearly shows the benefit in terms of CPU time.

关键词

Kalman filterComputer scienceMobile robotRobotTransformation (genetics)Sensor fusionExtended Kalman filterRelaxation (psychology)Computational complexity theoryControl theory (sociology)

相关论文

查看 PERCEPTION 分类全部论文