An Algorithm for Micro-localization in Large Public Buildings

R. Ivanov
{"title":"An Algorithm for Micro-localization in Large Public Buildings","authors":"R. Ivanov","doi":"10.1145/3134302.3134315","DOIUrl":null,"url":null,"abstract":"This paper presents an algorithm for people localization in large public buildings using Bluetooth Low Energy (BLE) beacons, Near-Field Communication (NFC) passive tags and information from specially designed Building Information Model (BIM). The proposed algorithm does not require any pre-data collection. An adaptive Kalman filter is used to decrease the noise in Received Signal-Strength Index (RSSI) raw measurements from beacons. To calculate a fine-grained user's position we find intersection points between rings, which inner and outer radiuses depends on fluctuations in RSSI signals from beacons. Then, for calculated intersection points, we obtain the optimal number of clusters using ANN clustering and inter-clusters entropy. These cluster canters are potential candidates for the position of the visitor. Using dead reckoning, we find a circle-shaped area in which the visitor is expected to be. Only clusters with centres located within this area are taken into account. If several points are in this area, the winner point is one, which belongs to clustering process that gives minimum inter-cluster entropy. The tests show that the localization error is below 1.5 m for all simulated and real world test scenarios.","PeriodicalId":131196,"journal":{"name":"Proceedings of the 18th International Conference on Computer Systems and Technologies","volume":"294 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th International Conference on Computer Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3134302.3134315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents an algorithm for people localization in large public buildings using Bluetooth Low Energy (BLE) beacons, Near-Field Communication (NFC) passive tags and information from specially designed Building Information Model (BIM). The proposed algorithm does not require any pre-data collection. An adaptive Kalman filter is used to decrease the noise in Received Signal-Strength Index (RSSI) raw measurements from beacons. To calculate a fine-grained user's position we find intersection points between rings, which inner and outer radiuses depends on fluctuations in RSSI signals from beacons. Then, for calculated intersection points, we obtain the optimal number of clusters using ANN clustering and inter-clusters entropy. These cluster canters are potential candidates for the position of the visitor. Using dead reckoning, we find a circle-shaped area in which the visitor is expected to be. Only clusters with centres located within this area are taken into account. If several points are in this area, the winner point is one, which belongs to clustering process that gives minimum inter-cluster entropy. The tests show that the localization error is below 1.5 m for all simulated and real world test scenarios.
大型公共建筑微定位算法研究
本文提出了一种基于蓝牙低功耗(BLE)信标、近场通信(NFC)无源标签和专门设计的建筑信息模型(BIM)信息的大型公共建筑中人员定位算法。该算法不需要任何预数据收集。采用自适应卡尔曼滤波来降低信标接收信号强度指数(RSSI)原始测量中的噪声。为了计算细粒度用户的位置,我们找到环之间的交叉点,其内部和外部半径取决于信标RSSI信号的波动。然后,对计算出的相交点,利用人工神经网络聚类和簇间熵获得最优簇数。这些集群中心是游客职位的潜在候选人。使用航位推算,我们找到一个圆形的区域,游客预计在其中。只考虑中心位于这一区域内的集群。如果该区域内有多个点,则获胜点为一个,该点属于聚类间熵最小的聚类过程。测试结果表明,在所有模拟和真实测试场景下,定位误差都在1.5 m以下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信