Reliability of partial ambiguity fixing with multiple GNSS constellations

Reliable ambiguity resolution (AR) is essential to real-time kinematic (RTK) positioning and its applications, since incorrect ambiguity fixing can lead to largely biased positioning solutions. A partial ambiguity fixing technique is developed to improve the reliability of AR, involving partial ambiguity decorrelation (PAD) and partial ambiguity resolution (PAR). Decorrelation transformation could substantially amplify the biases in the phase measurements. The purpose of PAD is to find the optimum trade-off between decorrelation and worst-case bias amplification. The concept of PAR refers to the case where only a subset of the ambiguities can be fixed correctly to their integers in the integer least squares (ILS) estimation system at high success rates. As a result, RTK solutions can be derived from these integer-fixed phase measurements. This is meaningful provided that the number of reliably resolved phase measurements is sufficiently large for least-square estimation of RTK solutions as well. Considering the GPS constellation alone, partially fixed measurements are often insufficient for positioning. The AR reliability is usually characterised by the AR success rate. In this contribution, an AR validation decision matrix is firstly introduced to understand the impact of success rate. Moreover the AR risk probability is included into a more complete evaluation of the AR reliability. We use 16 ambiguity variance–covariance matrices with different levels of success rate to analyse the relation between success rate and AR risk probability. Next, the paper examines during the PAD process, how a bias in one measurement is propagated and amplified onto many others, leading to more than one wrong integer and to affect the success probability. Furthermore, the paper proposes a partial ambiguity fixing procedure with a predefined success rate criterion and ratio test in the ambiguity validation process. In this paper, the Galileo constellation data is tested with simulated observations. Numerical results from our experiment clearly demonstrate that only when the computed success rate is very high, the AR validation can provide decisions about the correctness of AR which are close to real world, with both low AR risk and false alarm probabilities. The results also indicate that the PAR procedure can automatically chose adequate number of ambiguities to fix at given high-success rate from the multiple constellations instead of fixing all the ambiguities. This is a benefit that multiple GNSS constellations can offer.     

Integer estimation in the presence of biases

 Carrier phase ambiguity resolution is the key to fast and high-precision GNSS (Global Navigation Satellite System) kinematic positioning. Critical in the application of ambiguity resolution is the quality of the computed integer ambiguities. Unsuccessful ambiguity resolution, when passed unnoticed, will too often lead to unacceptable errors in the positioning results. Very high success rates are therefore required for ambiguity resolution to be reliable. Biases which are unaccounted for will lower the success rate and thus increase the chance of unsuccessful ambiguity resolution. The performance of integer ambiguity estimation in the presence of such biases is studied. Particular attention is given to integer rounding, integer bootstrapping and integer least squares. Lower and upper bounds, as well as an exact and easy-to-compute formula for the bias-affected success rate, are presented. These results will enable the evaluation of the bias robustness of ambiguity resolution. Received: 28 September 2000 / Accepted: 29 March 2001     

Influence of ambiguity precision on the success rate of GNSS integer ambiguity bootstrapping

In this contribution, we study the dependence of the bootstrapped success rate on the precision of the GNSS carrier phase ambiguities. Integer bootstrapping is, because of its ease of computation, a popular method for resolving the integer ambiguities. The method is however known to be suboptimal, because it only takes part of the information from the ambiguity variance matrix into account. This raises the question in what way the bootstrapped success rate is sensitive to changes in precision of the ambiguities. We consider two different cases. (1) The effect of improving the ambiguity precision, and (2) the effect of using an approximate ambiguity variance matrix. As a by-product, we also prove that integer bootstrapping is optimal within the restricted class of sequential integer estimators.     

载波相位差分接收机自主完好性监测研究

首先提出了浮点变换完全去相关法,该方法能够在单历元动态确定整周模糊度。研究了基于载波相位测量的完好性监测方法。利用最小二乘残差构造统计检验量,对整周模糊度进行检测。分析了定位误差保护限与卫星构型、漏警概率的关系。实测数据表明,整周模糊度在单历元动态求解的成功率为100%,增加1颗卫星将使垂直定位误差保护限减少约0.2 m,统计检验量检测周跳的正确率为100%。     

The success rate and precision of GPS ambiguities

 An application of a theorem on the optimality of integer least-squares (LS) is described. This theorem states that the integer LS estimator maximizes the ambiguity success rate within the class of admissible integer estimators. This theorem is used to show how the probability of correct integer estimation depends on changes in the second moment of the ambiguity `float' solution. The distribution of the `float' solution is considered to be a member of the broad family of elliptically contoured distributions. Eigenvalue-based bounds for the ambiguity success rate are obtained. Received: 11 January 1999 / Accepted: 2 November 1999     

一种改进的宽巷引导整周模糊度固定算法

一般卫星导航接收机的伪距测量误差大于宽巷波长。根据宽巷引导模型,直接使用双差伪距取整固定双差宽巷整周模糊度有很大概率会产生一周固定错误。基于此,提出了一种改进的宽巷引导整周模糊度固定算法,针对宽巷整周模糊度一周固定错误进行探测和修复。利用整周模糊度为整数的特质构造理论探测量,并将该探测量与载噪比所确定的门限相比较,判断是否出现宽巷整周模糊度一周固定错误;利用双差整周模糊度自由度为3的特点,修复错误宽巷整周模糊度。对该算法在高斯噪声条件下的可行性进行了理论分析,结果表明正常载噪比的观测数据均可分辨出一周宽巷整周模糊度的估计错误。同时,分析了考虑多径等误差后该算法所能接受的载波相位最大误差。计算了不同伪距误差下宽巷整周模糊度一周固定错误出现的概率。使用GPS实测短基线数据对算法进行验证,该算法可将基于宽巷引导的整周模糊度固定算法的固定率从原来的只有不到1/3提升至接近100%。     

用遗传算法搜索GPS单频单历元整周模糊度

介绍了短基线利用单频单历元双差载波相位定位时模糊度固定的基本理论，探讨了利用遗传算法快速搜索GPS单频单历元整周模糊度的一些理论和实现的方法．提出了用改进的正则化方法改善浮动解来提高搜索成功率的新思路。算例分析表明，在一定的条件下．应用遗传算法搜索整周模糊度成功率高、稳键性较好。     

评价GPS相位模糊度整数解正确性的严密方法

针对如何评价模糊度整数解的正确性，指出了基于传统的假设检验理论的三步法存在的理论缺陷，介绍了模糊度归整域的概念和可容许整数估计的定义，并在Teunissen关于可容许整数估计原定义的基础上给出了更为严密的新定义。基于这个新定义，讨论了模糊度成功率的概念及其计算公式。     

Integer least-squares theory for the GNSS compass

Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to high-precision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) theory for the GNSS compass model, together with efficient integer search strategies. It extends current unconstrained ILS theory to the nonlinearly constrained case, an extension that is particularly suited for precise attitude determination. As opposed to current practice, our method does proper justice to the a priori given information. The nonlinear baseline constraint is fully integrated into the ambiguity objective function, thereby receiving a proper weighting in its minimization and providing guidance for the integer search. Different search strategies are developed to compute exact and approximate solutions of the nonlinear constrained ILS problem. Their applicability depends on the strength of the GNSS model and on the length of the baseline. Two of the presented search strategies, a global and a local one, are based on the use of an ellipsoidal search space. This has the advantage that standard methods can be applied. The global ellipsoidal search strategy is applicable to GNSS models of sufficient strength, while the local ellipsoidal search strategy is applicable to models for which the baseline lengths are not too small. We also develop search strategies for the most challenging case, namely when the curvature of the non-ellipsoidal ambiguity search space needs to be taken into account. Two such strategies are presented, an approximate one and a rigorous, somewhat more complex, one. The approximate one is applicable when the fixed baseline variance matrix is close to diagonal. Both methods make use of a search and shrink strategy. The rigorous solution is efficiently obtained by means of a search and shrink strategy that uses non-quadratic, but easy-to-evaluate, bounding functions of the ambiguity objective function. The theory presented is generally valid and it is not restricted to any particular GNSS or combination of GNSSs. Its general applicability also applies to the measurement scenarios (e.g. single-epoch vs. multi-epoch, or single-frequency vs. multi-frequency). In particular it is applicable to the most challenging case of unaided, single frequency, single epoch GNSS attitude determination. The success rate performance of the different methods is also illustrated.     

Integer aperture bootstrapping: a new GNSS ambiguity estimator with controllable fail-rate

In this contribution, we introduce a new bootstrap-based method for Global Navigation Satellite System (GNSS) carrier-phase ambiguity resolution. Integer bootstrapping is known to be one of the simplest methods for integer ambiguity estimation with close-to-optimal performance. Its outcome is easy to compute due to the absence of an integer search, and its performance is close to optimal if the decorrelating Z-transformation of the LAMBDA method is used. Moreover, the bootstrapped estimator is presently the only integer estimator for which an exact and easy-to-compute expression of its fail-rate can be given. A possible disadvantage is, however, that the user has only a limited control over the fail-rate. Once the underlying mathematical model is given, the user has no freedom left in changing the value of the fail-rate. Here, we present an ambiguity estimator for which the user is given additional freedom. For this purpose, use is made of the class of integer aperture estimators as introduced in Teunissen (2003). This class is larger than the class of integer estimators. Integer aperture estimators are of a hybrid nature and can have integer outcomes as well as non-integer outcomes. The new estimator is referred to as integer aperture bootstrapping. This new estimator has all the advantages known from integer bootstrapping with the additional advantage that its fail-rate can be controlled by the user. This is made possible by giving the user the freedom over the aperture of the pull-in region. We also give an exact and easy-to-compute expression for its controllable fail-rate.     

An optimality property of the integer least-squares estimator

A probabilistic justification is given for using the integer least-squares (LS) estimator. The class of admissible integer estimators is introduced and classical adjustment theory is extended by proving that the integer LS estimator is best in the sense of maximizing the probability of correct integer estimation. For global positioning system ambiguity resolution, this implies that the success rate of any other integer estimator of the carrier phase ambiguities will be smaller than or at the most equal to the ambiguity success rate of the integer LS estimator. The success rates of any one of these estimators may therefore be used to provide lower bounds for the LS success rate. This is particularly useful in case of the bootstrapped estimator. Received: 11 January 1999 / Accepted: 9 July 1999     

BDS/GPS组合单历元基线解算方法

阐述了BDS/GPS单历元解算函数模型的相关理论,并进行了相应的公式推导。在此基础上,利用基于正则化的载波相位解算模型,解算宽巷模糊度。首先将BDS卫星宽巷模糊度值作为约束固定出IGSO和MEO卫星的模糊度;然后再将IGSO和MEO卫星模糊度值作为约束来固定GEO卫星模糊度。通过实测数据对该方法进行测试和分析,结果表明:BDS/GPS组合系统单历元宽巷模糊度成功率为100%;基频模糊度成功率90%以上;N、E、U方向定位精度达到了毫米至厘米级。     

北斗观测量时间相关随机模型构建及评估

传统多历元累积观测量随机模型通常忽略各历元间观测量的时间相关性,导致其对观测量整体随机特性刻画不准确。考虑北斗系统中GEO卫星观测量的时间相关性较强,本文提出一种适用于多历元下北斗观测量的时间相关随机模型构建方法。在传统多历元随机模型的基础上,将时间相关系数直接引入随机模型,通过观测量站间差分残差计算各历元间观测量的时间相关系数,生成多历元下北斗观测量时间相关随机模型,并利用实际试验数据对其在整周模糊度解算中的表现进行评估。试验结果表明,时间相关随机模型在一定程度上解决了传统随机模型存在的整周模糊度PCF下限估值虚高的问题,提高了整周模糊度Ratio值,有助于整周模糊度顺利通过检验。此外,相比于传统随机模型,时间相关随机模型有效减少了整周模糊度漏检及误警的情况出现,提高了整周模糊度解算的可靠性。     

The probability distribution of the ambiguity bootstrapped GNSS baseline

 The purpose of carrier phase ambiguity resolution is to improve upon the quality of the estimated global navigation satellite system baseline by means of the integer ambiguity constraints. However, in order to evaluate the quality of the ambiguity resolved baseline rigorously, its probability distribution is required. This baseline distribution depends on the random characteristics of the estimated integer ambiguities, which in turn depend on the chosen integer estimator. In this contribution is presented an exact and closed-form expression for the baseline distribution in the case that use is made of integer bootstrapping. Also presented are the bootstrapped probability mass function and easy-to-compute measures for the bootstrapped baseline's probability of concentration. Received: 28 September 2000 / Accepted: 11 January 2001     

An alternative approach to calculate the posterior probability of GNSS integer ambiguity resolution

When precise positioning is carried out via GNSS carrier phases, it is important to make use of the property that every ambiguity should be an integer. With the known float solution, any integer vector, which has the same degree of freedom as the ambiguity vector, is the ambiguity vector in probability. For both integer aperture estimation and integer equivariant estimation, it is of great significance to know the posterior probabilities. However, to calculate the posterior probability, we have to face the thorny problem that the equation involves an infinite number of integer vectors. In this paper, using the float solution of ambiguity and its variance matrix, a new approach to rapidly and accurately calculate the posterior probability is proposed. The proposed approach consists of four steps. First, the ambiguity vector is transformed via decorrelation. Second, the range of the adopted integer of every component is directly obtained via formulas, and a finite number of integer vectors are obtained via combination. Third, using the integer vectors, the principal value of posterior probability and the correction factor are worked out. Finally, the posterior probability of every integer vector and its error upper bound can be obtained. In the paper, the detailed process to calculate the posterior probability and the derivations of the formulas are presented. The theory and numerical examples indicate that the proposed approach has the advantages of small amount of computations, high calculation accuracy and strong adaptability.     

GNSS模糊度整数估计方法图形可视化软件设计与应用分析

模糊度快速准确估计是全球卫星导航系统(GNSS)高精度定位的关键,整数取整、序贯取整和整数最小二乘估计是模糊度常用的三类整数估计方法.尽管从程序上较易实现三类估计方法,但是如何根据模糊度浮点解和精度构建整数估值的几何图形却缺乏较多的研究,不利于我们对整数估计过程的直观认知.因此,本文从理论上分别给出三类估计方法的一般形式,然后基于MATLAB GUI设计了一套三类估计方法二维几何图形构建的可视化分析软件,其功能包括三类估计方法的归整域构建、映射图构建和蒙特卡洛模拟及成功率计算.实验测试结果表明,本文设计的软件能够从几何图形角度较直观地表达出三类整数估计过程及其解算性能.      

改进的ARCE方法及其在单频 GPS快速定位中的应用

基于TIKHONOV正则化原理，设计了一种正则化矩阵的构造方法，将ARCE(ambiguity resolution using constraint equation)方法进行了改进。通过新的正则化矩阵的作用，减弱了GPS快速定位中少数历元情形下法矩阵的病态性，得到了比较准确的模糊度浮动解，大大减小了模糊度的搜索范围，利用ARCE方法固定模糊度的成功率高。并结合一个算例，验证了本文改进方法的效果。     

一种北斗非差非组合长距离基准站模糊度解算方法

为了充分利用各频率观测值信息,提出了一种非差非组合的北斗卫星导航系统长距离基准站间整周模糊度解算方法。首先,直接利用不同频率的观测值建立误差观测方程,并采用随机游走策略估计相对天顶对流层湿延迟误差和电离层延迟误差,增加历元间的约束;然后,采用一种非差整周模糊度实时线性计算方法,依次得到基准站网当前历元所有卫星的非差整周模糊度,解决了在基准星变换时,模糊度需要承接或者重新进行法方程叠加的问题;最后,使用实测数据进行方法验证,结果表明,各基准站模糊度平均固定速度为20个历元（采样间隔1 s）,可快速实现基准站载波相位整周模糊度解算。由于所提方法充分利用了各频率观测值信息,避免了线性组合放大噪声对整周模糊度固定的影响,其模糊度固定成功率与无电离层组合法相比有较大的提高。     

Fast integer least-squares estimation for GNSS high-dimensional ambiguity resolution using lattice theory

GNSS ambiguity resolution is the key issue in the high-precision relative geodetic positioning and navigation applications. It is a problem of integer programming plus integer quality evaluation. Different integer search estimation methods have been proposed for the integer solution of ambiguity resolution. Slow rate of convergence is the main obstacle to the existing methods where tens of ambiguities are involved. Herein, integer search estimation for the GNSS ambiguity resolution based on the lattice theory is proposed. It is mathematically shown that the closest lattice point problem is the same as the integer least-squares (ILS) estimation problem and that the lattice reduction speeds up searching process. We have implemented three integer search strategies: Agrell, Eriksson, Vardy, Zeger (AEVZ), modification of Schnorr–Euchner enumeration (M-SE) and modification of Viterbo-Boutros enumeration (M-VB). The methods have been numerically implemented in several simulated examples under different scenarios and over 100 independent runs. The decorrelation process (or unimodular transformations) has been first used to transform the original ILS problem to a new one in all simulations. We have then applied different search algorithms to the transformed ILS problem. The numerical simulations have shown that AEVZ, M-SE, and M-VB are about 320, 120 and 50 times faster than LAMBDA, respectively, for a search space of dimension 40. This number could change to about 350, 160 and 60 for dimension 45. The AEVZ is shown to be faster than MLAMBDA by a factor of 5. Similar conclusions could be made using the application of the proposed algorithms to the real GPS data.     

整周模糊度解正确性的评价方法

首先指出了基于传统的假设检验理论的三步法在评价模糊度整数解正确性时存在的理论缺陷，然后介绍了模糊度归整域的概念和可容许整数估计的定义，并在可容许整数估计原定义的基础上给出了更为严密的新定义。最后，基于这个可容许整数估计的新定义，讨论了模糊度成功率的概念及其计算公式。从理论上讲，只有模糊度的成功率才是评价模糊度整数解正确性的严密尺度。