蓝牙有界定位问题

Bounded Positioning Problem via Bluetooth

基于蓝牙beacon的室内定位方案在谷歌、苹果等公司的力推下得以广泛应用,但高效解决大规模、高精度的定位问题仍是研究难点。出于信息安全、抗干扰等因素考虑,限制定位信号辐射范围且满足定位精度的"有界"定位方案具有广阔的应用前景。详细阐释有界定位问题的整数线性规划求解方法,证明大型定位问题可分解为多个独立求解的有界定位问题并快速获得次优解,最后通过仿真验证解在beacon个数、耗时等方面的性能。

Indoor positioning via Bluetooth beacon has been widely applied under the promotion of Google,Apple,and other companies,but it is still difficult to solve large-scale and high-precision positioning problems efficiently.Due to information security,anti-interference and other concerns,bounded positioning which keeps the positioning signals in range and achieves desired accuracy is promising in application.The integer linear programming method for solving bounded positioning problems is investigated in detail in this paper.It is proved that the large-scale positioning problem can be decomposed into several independent bounded positioning problems and the sub-optimal solutions can be obtained quickly.Finally,the performance of the solutions in terms of beacon consumption and running time is verified by simulation.