In the face of a complex observation environment, the solution of the reference station of the ambiguity of network real-time kinematic (RTK) will be affected. The joint solution of multiple systems makes the ambiguity dimension increase steeply, which makes it difficult to estimate all the ambiguity. In addition, when receiving satellite observation signals in the environment with many occlusions, the received satellite observation values are prone to gross errors, resulting in obvious deviations in the solution. In this paper, a new network RTK fixation algorithm for partial ambiguity among the reference stations is proposed. It first estimates the floating-point ambiguity using the robust extended Kalman filtering (EKF) technique based on mean estimation, then finds the optimal ambiguity subset by the optimized partial ambiguity solving method. Finally, fixing the floating-point solution by the least-squares ambiguity decorrelation adjustment (LAMBDA) algorithm and the joint test of ratio (R-ratio) and bootstrapping success rate index solver. The experimental results indicate that the new method can significantly improve the fixation rate of ambiguity among network RTK reference stations and thus effectively improve the reliability of positioning results.
With the development and integration of GNSS systems in the world, the positioning accuracy and reliability of GNSS navigation services are increasing in various fields. Because the current multisystem fusion leads to an increase in the ambiguity dimension and the ambiguity parameters have discrete characteristics, the current conventional search algorithm leads to low search efficiency when the ambiguity dimension is large. Therefore, this paper describes a new algorithm that searches the optimal lattice points by lattice theory through the breadth-first algorithm and reduces the search space of ambiguity by calculating and judging the Euclidean distance between each search variable and the target one so as to propose a new lattice ambiguity search algorithm based on the breadth-first algorithm. The experimental results show that this method can effectively improve the search efficiency of ambiguity in high-dimension situations.