GPS Phase Integer Ambiguity Resolution Based on Eliminating Coordinate Parameters and Ant Colony Algorithm

doi:10.3390/s25020321

2025-01-08

DOI：10.3390/s25020321

原文链接

查看原文

摘要

En 中文

Correctly fixing the integer ambiguity of GNSS is the key to realizing the application of GNSS high-precision positioning. When solving the float solution of ambiguity based on the double-difference model epoch by epoch, the common method for resolving the integer ambiguity needs to solve the coordinate parameter information, due to the influence of limited GNSS phase data observations. This type of method will lead to an increase in the ill-posedness of the double-difference solution equation, so that the fixed success rate of the integer ambiguity is not high. Therefore, a new integer ambiguity resolution method based on eliminating coordinate parameters and ant colony algorithm is proposed in this paper. The method eliminates the coordinate parameters in the observation equation using QR decomposition transformation, and only estimates the ambiguity parameters using the Kalman filter. On the basis that the Kalman filter will obtain the float solution of ambiguity, the decorrelation processing is carried out based on continuous Cholesky decomposition, and the optimal solution of integer ambiguity is searched using the ant colony algorithm. Two sets of static and dynamic GPS experimental data are used to verify the method and compared with conventional least squares and LAMBDA methods. The results show that the new method has good decorrelation effect, which can correctly and effectively realize the integer ambiguity resolution.

Keyword:

integer ambiguity

QR decomposition transformation

Kalman filter

Cholesky decomposition

ant colony algorithm

decorrelation processing