计算机与现代化 ›› 2022, Vol. 0 ›› Issue (04): 79-85.

• 网络与通信 • 上一篇    下一篇

基于阈值筛选的室内定位优化算法

  

  1. (中北大学信息与通信工程学院,山西太原030051)
  • 出版日期:2022-05-07 发布日期:2022-05-07
  • 作者简介:柴晨境(1996—),男,山西临汾人,硕士研究生,研究方向:基于超宽带的室内定位算法,工业上位机操作系统设计,E-mail: 664388303@qq.com; 刘宾(1979—),男,山东济宁人,教授,硕士生导师,博士,研究方向:光电检测及图像处理,光场成像,嵌入式及动态测试,E-mail: liubin414605032@163.com; 潘晋孝(1966—),男,山西万荣人,教授,硕士生导师,博士,研究方向:矩阵理论,随机过程,小波理论,现代优化理论,泛函分析,图像信息处理及增强,E-mail: panjx@nuc.edu.cn。
  • 基金资助:
    山西省科技重大专项(20191102010)

Indoor Positioning Optimization Algorithm Based on Threshold Filtering

  1. (School of Information and Communication Engineering, North University of China, Taiyuan 030051, China)
  • Online:2022-05-07 Published:2022-05-07

摘要: 针对室内超宽带(Ultra-Wide Band, UWB)的定位技术在复杂遮挡的环境下定位效果不好、定位不精确的缺陷,本文提出一种在Chan算法的基础上对粒子群算法进行优化的混合算法定位方法。首先利用Chan算法求出定位标签初始估计位置坐标,并在非视距(NLOS)环境下通过设置阈值θ以对Chan算法计算出的位置坐标进行筛选;将已知的基站接收到的距离差与用Chan算法求出的标签位置信息求出的不同基站间的距离差做差值和,若差值和小于该阈值则直接输出位置坐标,反之则将位置坐标作为粒子群算法的初始值,通过迭代优化不断追踪个体极值和局部极值,更新个体的位置和速度,寻找到全局最优解再进行输出。仿真结果与实际场地实验结果表明,与单一算法相比,本文提出的混合定位算法在非视距环境下的定位精度可提高27%~31%;收敛速度快,算法复杂度低,满足室内定位的要求。

关键词: 室内定位, 非视距, TDOA, Chan算法, 阈值筛选, 粒子群算法, 协同定位算法

Abstract: Aiming at the defects of indoor ultra-wide band (UWB) positioning technology, such as poor positioning effect and inaccurate positioning in complex occlusion environment, this paper proposes a hybrid positioning method based on Chan algorithm and particle swarm optimization algorithm. First, the Chan algorithm is used to obtain the initial estimated position coordinates of the positioning tag, and in a non-line-of-sight (NLOS) environment, a threshold θ is set to filter the position coordinates calculated by the Chan algorithm. The distance difference received by the known base station is summed with the distance difference between different base stations obtained by the tag position information calculated by Chan algorithm. If the sum of the differences is less than the threshold, the position coordinates are directly output. Otherwise, the position coordinates are used as the initial value of the particle swarm algorithm for iteration. Optimization keeps track of individual extreme values and local extreme values, updates individual positions and speeds, and finds the global optimal solution before outputting. The simulation results and the actual field experiment results show that compared with a single algorithm, the hybrid positioning algorithm proposed in this paper improves the positioning accuracy of 27%~31% in the non-line-of-sight environment. The convergence speed is fast, the algorithm complexity is low, and it meets the requirements of indoor positioning.

Key words: indoor positioning, non-line-of-sight, TDOA, Chan algorithm, threshold filtering, particle swarm algorithm, co-location algorithm