Research On Position Algorithm Based On Compass

Along with the development of aerospace industry of C hina and the gradually maturation of the Beidou satellite navigation system,more and more attentio n of scholars is attracted by the Beidou satellite navigation system which is the autonomous system construction in C hina.In this paper,the real-time kinematic positioning algorithm(RTK)of compass is studied.But there is a problem of integer ambiguity resolut ion in the solut ion.At present,the more popular method of ambiguity resolut ion is the least-squares ambiguity decorrelated adjustment(LAMBDA),which includes two steps that is ambiguity decorrelation and ambiguity search.In order to decorrelate of ambiguity,two algorithms,which is LLL(A.K.Lenstra,H.W.Lenstra,L.Lovasz)algorithm and inverse integer C holesky algorithm,are analyzed.In order to solve the problem of long time consuming in LLL algorithm,the LLL algorithm is improved.And the improved LLL algorithm is compared with the two previous algorithms.The experimental results show that the decorrelate result by the improved LLL algorithm and the LLL algorithm is significantly better than that by the inverse integer C holesky algorithm.But in terms of time-consuming,the improved LLL algorithm and inverse integer C holesky algorithm optimization.Based on the above experimental results,the improved LLL algorithm is used to ambiguity decorrelated.In the ambiguity search,this paper uses the Artificial Fish Swarm Algorithm(AFSA)for the search of ambiguity,and according to the characteristics of integer ambiguity for the improvement.For the same set of observational data,this paper used respectively the LAMBDA algorithm and the improved AFSA to position calculation.The experimental result show that the improved AFSA proposed to search integer ambiguity has higher success rate than LAMBDA,and the computation time is shorter than LAMBDA.