G PS 伪距差分非迭代与迭代算法比较

摘要

Aiming at the problem of the least square iterative algorithm with low positio‐ning efficiency w hen it has no initial coordinates or it has poor initial coordinates in the global positioning system ,the Pseudo range double differential non iterative algorithm was pro‐posed .In this paper ,the principle of these two kinds of location algorithms was discussed u‐sing Pseudo range double differential positioning and tested using observed date .According to the results ,the positioning accuracy and efficiency of these two algorithms were analyzed and compared .It concluded that using the approximate coordinates of the receiver calculated by the non iterative algorithm as the initial value of the least square iterative algorithm can improve the positioning accuracy and running efficiency of the iterative algorithm w hen there are no initial coordinates or the initial coordinates are poor .%针对卫星定位系统中非迭代算法在无初始坐标或初始坐标较差时可以解决最小二乘迭代算法定位效率较低的问题，本文在详细论述这两种定位算法原理的基础上，通过编程实现这两种算法并应用于伪距双差定位中。对这两种算法进行数据测试，根据测试结果分析比较这两种算法的定位精度和运行效率，得出在无初始坐标或初始坐标较差时的情况下，将非迭代算法计算出的接收机近似坐标作为最小二乘迭代算法的初始值可以提高迭代算法的定位精度和运行效率。