Multiple integer candidates ambiguity resolution: a unification ambiguity resolution algorithm

Shengfeng Gu

doi:10.1186/s43020-024-00141-w

2024-07-08

Shengfeng Gu *

Weiping Jiang

DOI：10.1186/s43020-024-00141-w

原文链接

原文求助

摘要

En 中文

Among all the ambiguity resolution techniques, the Full Ambiguity Resolution (FAR), Partial Ambiguity Resolution (PAR) and Best Integer Equivariant (BIE) estimator are widely used. Although the researches have been done on the different classes of ambiguity resolution, we still hope to find the relationships among these specific algorithms. In this work, we unify the PAR and FAR algorithms under a whole framework of BIE by applying multiple integer candidates. A concise estimation formula of the variance of Gaussian BIE estimator based on the variance of float solution and the probability distribution of the candidates is first derived. Then, we propose an algorithm named Multiple Integer Candidates Ambiguity Resolution (MICAR) to discover as many ambiguities in the BIE as possible that can be estimated more precisely by PAR (FAR) algorithm instead of BIE. In the experiments, we utilize the simulated data of GPS (Global Positioning System) + BDS (BeiDou Navigation Satellite System) + Galileo (Galileo navigation satellite system) to contrast the effects of MICAR and single candidate estimator, i.e., FAR. By taking the threshold of 5 cm at 95% confidence level as an example, MICAR accelerates the convergence process by about 3.0 min. When the positioning sequence converges, MICAR reduces the root mean square of the positioning error by 9.8% in horizontal directions and 3.5% in vertical direction, which is attributed to more fixed NL.

Keyword:

GNSS

Ambiguity resolution

Best integer equivariant estimator

Covariance matrix

MICAR