检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京航空航天大学电子信息工程学院,北京100191
出 处:《北京航空航天大学学报》2015年第2期273-282,共10页Journal of Beijing University of Aeronautics and Astronautics
基 金:国防科工局航天民用专项资助项目;北京市重点学科基金资助项目(XK100070525)
摘 要:分析了选星数目与几何精度因子(GDOP,Geometry Dilution of Precision)及导航运算量的关系,基于遗传算法提出了一种以满足用户定位精度需求为条件的快速选星方法——快速遗传选星法.根据用户需求确定选星数目初值、选星数目最大值和GDOP阈值,构造选星方案的初始种群,在进化代数上限为1的条件下对种群进行选择、交叉和变异运算,获得初始选星解,根据初始解的GDOP与阈值的关系确定是否依据GDOP最小原则对初始解进行优化,直至满足算法终止条件,输出选星解.仿真结果表明,该算法可以在一次进化之内以不低于92.45%的概率满足GDOP阈值在2.5-6的要求,同时可有效降低54.75%以上的导航运算量.On the basis of the relationship between the number of the selected satellites and geometry dilution of precision( GDOP) and navigation computation,a genetic algorithm( GA)-based fast satellite selection method named fast genetic satellite selection method( FGSSM) was proposed. In this method,firstly the initial number of selecting satellites and GDOP threshold was decided according to the precision of user's requirement. And then the initial population of satellite selection solutions was constructed. Under the condition that evolution algebra limit is less than 1,the initial solution was obtained by selection,crossover and mutation operation. Whether the initial solution was optimized based on the principles of GDOP minimum was determined by the relationship between the GDOP of the initial solution and the GDOP threshold. The optimization terminates until the termination condition was satisfied and final solution was obtained. The experiment results show that,the method can satisfy GDOP of the solution at the request of 2. 5 to 6 within an evolutionary,with no less than 92. 45% probability,at the same time it can effectively reduce more than 54. 75% of the navigation computation.
关 键 词:卫星导航 遗传算法 几何精度因子 选星 GDOP阈值
分 类 号:TN967.1[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28