摘要
为解决传统选星算法在定位精度与运算复杂度之间的矛盾,提出了一种基于行列式值的改进选星算法,并从运算量的复杂度、消耗时间的长短、定位精度的高低3个方面与传统最小几何精度因子(GDOP)算法相比较。仿真结果表明:改进选星算法80%以上的GDOP相对比值小于10%,所需计算时间明显小于传统最小GDOP方法,且避免了大量的矩阵乘法和求逆运算,证明了该改进选星算法具有计算复杂度低、耗时短、精度较高的优点。
In order to overcome the contradiction between positioning accuracy and the computational complexity in using traditional optimal GDOP method, an improved satellite selection algorithm is proposed based on the determinant. The simulation results indicate that the algorithm has more than 809 of relative ratio lower than 109 and need less computation time than the traditional optimal GDDP method, and also can avoid matrix inversion and matrix multiplication. All this proves that the improved satellite selection algorithm has such advantages as lower computational complexity, shorter computation time and higher positioning accuracy.
出处
《海军工程大学学报》
CAS
北大核心
2014年第2期45-48,共4页
Journal of Naval University of Engineering
基金
云南省自然科学基金资助项目(2013Y017)
曲靖师范学院校级青年基金资助项目(2012QN022
2012QN023)
关键词
选星算法
几何精度因子
实时导航
加权行列式值
计算复杂度
satellite selection algorithm
geometry dilution of precision
real time navigation
weigh- ted determinant value
computational complexity
