Bancroft算法应用于GPS/BDS/GLONASS三系统伪距单点定位

Bancroft Algorithm Applied to GPS/BDS/GLONASS Pseudo-range Singe-Point Positioning

为了提高多系统组合单点定位的运算效率,将Bancroft算法推广应用于GPS/BDS/GLONASS三系统伪距单点定位,并推导了该方法的详细计算流程,比较了Bancroft算法、最小二乘算法和组合两种算法的精度、迭代次数以及运算时间。利用实测数据进行实验,结果表明,3种算法精度相当,Bancroft算法比最小二乘算法迭代次数少,运算效率提高了38%,利用Bancroft为最小二乘算法提供初值,收敛速度加快,运算效率提高了36%。最终得出结论,Bancroft算法应用于GPS/BDS/GLONASS三系统伪距单点定位满足精度要求,且Bancroft算法对于减少迭代次数,提高运算效率有重要意义。

To improve the calculation efficiency of multiple system combined single-point positioning,the Bancroft algorithm has been applied to GPS/BDS/GLONASS pseudo-range single-point positioning,the detailed calculation process has been deduced,and the accuracy,number of iteration and time of calculation of Bancroft algorithm,Least-squares algorithm and combined these two algorithm have been compared in this paper.An experiment is designed using the data obtained from field surveying,and it shows that these three algorithm get relatively same accuracy,but Bancroft algorithm has less number of iteration than Least-Squares algorithm,and its calculation efficiency has been improved by 38%,when least-square algorithm has the initial coordinates provided by Bancroft algorithm,its number of iteration has been reduced and its calculation efficiency has been improved by 36%.In conclusion,Bancroft algorithm meets the accuracy requirement in triple-system single-point positioning,meanwhile,it can reduce the time of iteration,which has significant meaning in the improvement of calculation efficiency.