A Partial Ambiguity Resolution Algorithm Based on New-Breadth-First Lattice Search in High-Dimension Situations.

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. [ABSTRACT FROM AUTHOR]