A Novel Robust Algorithm Attenuating Non-Line-of-Sight Errors in Indoor Localization
Bo,You; Xueen,Li; Xudong,Zhao; Yijun.Gao
2015-06
会议名称The 7th IEEE International Conference on Communication Software and Networks
会议录名称Proceedings of 2015 IEEE International Conference on Communication Software and Networks
会议日期June 6,2015-June 7,2015
会议地点Chengdu
摘要
In time of arrival (TOA) based indoor personnel positioning system, the human body mounted with positioning devices could cause non-line-of-sight (NLOS) propagation and further give rise to large ranging errors, thus reducing the accuracy of localization. A novel NLOS identification and mitigation method based on UWB signal power is proposed in this paper, which solves the problem that the performance of classical least squares (LS) algorithm severely degrades in NLOS environments. An improved self-learning LS localization algorithm is also introduced, overcoming the drawbacks of LS estimator that it requires at least three range estimates for an unambiguous solution. Furthermore, we demonstrate the proposed approach outperforms traditional LS algorithm with an increasing localization accuracy by 50% in NLOS scenarios.
关键词Indoor Localization Nlos Identification And Mitigation Self-learning Ls Algorithm
收录类别EI
文献类型会议论文
条目标识符http://ir.ia.ac.cn/handle/173211/11541
专题智能制造技术与系统研究中心_无线传感网络与智能感知团队
通讯作者Bo,You
作者单位Institute of Automation, Chinese Academy of Sciences
推荐引用方式
GB/T 7714
Bo,You,Xueen,Li,Xudong,Zhao,et al. A Novel Robust Algorithm Attenuating Non-Line-of-Sight Errors in Indoor Localization[C],2015.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
(final version)A Nov(573KB)会议论文 开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Bo,You]的文章
[Xueen,Li]的文章
[Xudong,Zhao]的文章
百度学术
百度学术中相似的文章
[Bo,You]的文章
[Xueen,Li]的文章
[Xudong,Zhao]的文章
必应学术
必应学术中相似的文章
[Bo,You]的文章
[Xueen,Li]的文章
[Xudong,Zhao]的文章
相关权益政策
暂无数据
收藏/分享
文件名: (final version)A Novel Robust Algorithm Attenuating Non-Line-of-Sight Errors in Indoor Localization.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。