检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:高莉 胡延军 张雷 赵彤 GAO Li;HU Yanjun;ZHANG Lei;ZHAO Tong(School of Electrical Engineering & Automation,Jiangsu Normal University,Xuzhou 221116,China;School of Information and Control Engineering,China University of Mining and Technology,Xuzhou 221116,China)
机构地区:[1]江苏师范大学电气工程及自动化学院,江苏徐州221116 [2]中国矿业大学信息与控制工程学院,江苏徐州221116
出 处:《工矿自动化》2018年第8期39-45,共7页Journal Of Mine Automation
基 金:国家重点研发计划项目(2017YFC0804401);江苏省现代教育技术研究课题(2016-R-47695)
摘 要:针对现有多边定位算法在定位基站布置稀疏的情况下定位精度低、鲁棒性差的问题,提出了基于节点协作的无线精确定位算法,给出了未知节点误差和最小的加权非凸定位模型,并提出相应的非迭代式定位算法。仿真和实验结果表明,在典型巷道定位布置、未知节点均匀随机的情景中,采用所提算法得到的未知节点平均定位误差随节点数增加而降低,且下降趋势随节点数增加变缓;该定位算法可实现总体上的定位鲁棒性和定位精度的提高,其代价为个别节点定位精度的降低及定位时间复杂度的上升。In view of problems that existing multilateral location algorithms had low location accuracy and poor robustness in the case of sparse location base station,a wireless accurate location algorithm based on node cooperation was proposed.Weighted non-convex location model with the minimum error sum of unknown nodes,and corresponding non-iterative location algorithm was proposed.The simulation and experimental results show that average location error of unknown nodes obtained by the proposed algorithm decreases with the increasing of the number of nodes in typical roadway location arrangement and uniform random nodes,and downward trend slows down as the number of nodes increases.The location algorithm can achieve overall improvement of location robustness and location accuracy,which is at the cost of lowering the location accuracy of individual nodes and increasing the complexity of location time.
关 键 词:煤矿井下无线精确定位 节点协作 加权非凸定位模型 非迭代式定位算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28