CAJ | 학술논문

为解决传统选星算法在定位精度与运算复杂度之间的矛盾，提出了一种基于行列式值的改进选星算法，并从运算量的复杂度、消耗时间的长短、定位精度的高低3个方面与传统最小几何精度因子（GDOP）算法相比较。仿真结果表明：改进选星算法80％以上的G DO P相对比值小于10％，所需计算时间明显小于传统最小GDOP方法，且避免了大量的矩阵乘法和求逆运算，证明了该改进选星算法具有计算复杂度低、耗时短、精度较高的优点。
위해결전통선성산법재정위정도여운산복잡도지간적모순，제출료일충기우행렬식치적개진선성산법，병종운산량적복잡도、소모시간적장단、정위정도적고저3개방면여전통최소궤하정도인자（GDOP）산법상비교。방진결과표명：개진선성산법80％이상적G DO P상대비치소우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 80% of relative ratio lower than 10% 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 .