Extended and unscented Kalman filters for the identification of uncertainties in a process

M. Nasri, W. Kinsner
{"title":"Extended and unscented Kalman filters for the identification of uncertainties in a process","authors":"M. Nasri, W. Kinsner","doi":"10.1109/ICCI-CC.2013.6622242","DOIUrl":null,"url":null,"abstract":"This paper describes the application of extended and unscented Kalman filters for the identification of uncertainties in a process. The extended Kalman filter (EKF) is an optimal linear recursive algorithm that offers a solution to the filtering problem. The EKF is based on a first-order Taylor expansion to approximate the measurement and process models. This approach may cause the estimation process to diverge. Consequently, alternatives (e.g., the unscented Kalman filter, UKF) based on a fixed number of points to represent a Gaussian distribution have been introduced. The EKF and UKF have been applied for the identification of uncertainty in the attitude determination process for small satellites based on noisy measurements collected from Sun sensors and three-axis magnetometers. Simulation results indicate that the EKF and UKF perform equally well when small initial errors are present. However, when large errors are introduced, the UKF leads to a faster convergence and achieves a higher more accurate estimate of the state of the system.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCI-CC.2013.6622242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper describes the application of extended and unscented Kalman filters for the identification of uncertainties in a process. The extended Kalman filter (EKF) is an optimal linear recursive algorithm that offers a solution to the filtering problem. The EKF is based on a first-order Taylor expansion to approximate the measurement and process models. This approach may cause the estimation process to diverge. Consequently, alternatives (e.g., the unscented Kalman filter, UKF) based on a fixed number of points to represent a Gaussian distribution have been introduced. The EKF and UKF have been applied for the identification of uncertainty in the attitude determination process for small satellites based on noisy measurements collected from Sun sensors and three-axis magnetometers. Simulation results indicate that the EKF and UKF perform equally well when small initial errors are present. However, when large errors are introduced, the UKF leads to a faster convergence and achieves a higher more accurate estimate of the state of the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
扩展和无气味卡尔曼滤波器用于识别过程中的不确定性
本文介绍了扩展无气味卡尔曼滤波器在过程不确定性辨识中的应用。扩展卡尔曼滤波(EKF)是一种解决滤波问题的最优线性递归算法。EKF基于一阶泰勒展开来近似测量和过程模型。这种方法可能导致估计过程发散。因此,已经引入了基于固定数量的点来表示高斯分布的替代方法(例如,unscented卡尔曼滤波器,UKF)。基于太阳传感器和三轴磁强计收集的噪声测量数据,EKF和UKF已被应用于小卫星姿态确定过程中的不确定度识别。仿真结果表明,当初始误差较小时,EKF和UKF的性能相当。然而,当引入较大的误差时,UKF导致更快的收敛,并实现对系统状态的更高更准确的估计。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Ordering: A reliable qualitative information for the alignment of sketch and metric maps Visual words sequence alignment for image classification Survey of measures for the structural dimension of ontologies An emotional regulation model with memories for virtual agents Visual words selection based on class separation measures
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1