检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李浩 郑睿[1,2] Li Hao;Zheng Rui(School of Physics and Electronic Information,Anhui Normal University,Wuhu 241002,China;Anhui Provincial Engineering Laboratory on Information Fusion and Control of Intelligent Robot(Anhui Normal University),Wuhu 241002,China)
机构地区:[1]安徽师范大学物理与电子信息学院,安徽芜湖241002 [2]安徽省智能机器人信息融合与控制工程实验室(安徽师范大学),安徽芜湖241002
出 处:《网络安全与数据治理》2023年第6期90-96,共7页CYBER SECURITY AND DATA GOVERNANCE
基 金:安徽省高校优秀青年支持计划项目(gxyq202002);安徽省高校协同创新项目(GXXT-2019-031)。
摘 要:北斗卫星导航系统是我国自主建设运行的卫星系统,向全球用户提供高精度定位服务是其重要功能之一。为提高北斗系统的定位精度,一类可行的方法是伪距定位算法。针对常见的伪距算法存在依赖模型、计算复杂等问题,提出一种基于粒子群优化的北斗卫星定位方法。首先筛选出大气折射误差大、对定位贡献小的冗余卫星,由此获取多颗可利用的北斗卫星;在此基础上,研究粒子群的初始群体和适应度函数,通过粒子群算法得到优化后的接收机位置。实验结果表明,该方法可以快速搜索出优化的位置;与常用的最大四面体法解算出的接收机位置相比较,定位精度可提高大约1.5 m。The Beidou navigation satellite system is a satellite system independently constructed and operated by China.Providing high-precision positioning services to global users is one of its important functions.In order to improve the positioning accuracy of the Beidou system,a kind of feasible method is pseudo range location algorithm.In this paper,a Beidou satellite positioning method based on particle swarm optimization is proposed.Firstly,redundant satellites with large atmospheric refraction errors and small contribution to positioning are selected,so as to obtain several available Beidou satellites.On this basis,the initial population and fitness function of particle swarm optimization are studied,and the optimal receiver position is obtained by particle swarm optimization algorithm.The experimental results show that this method can quickly search the optimal position.Compared with the receiver position calculated by the maximum tetrahedron method,the positioning accuracy can be improved by about 1.5 m.
分 类 号:TN967.1[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15