Hostname: page-component-745bb68f8f-5r2nc Total loading time: 0 Render date: 2025-02-06T13:01:25.861Z Has data issue: false hasContentIssue false

A novel partial ambiguity resolution based on ambiguity dilution of precision- and convex-hull-based satellite selection for instantaneous multiple global navigation satellite systems positioning

Published online by Cambridge University Press:  08 February 2022

Xin Liu
Affiliation:
School of Environment and Spatial Informatics, China University of Mining and Technology, Jiangsu, China.
Shubi Zhang
Affiliation:
School of Environment and Spatial Informatics, China University of Mining and Technology, Jiangsu, China.
Qiuzhao Zhang*
Affiliation:
School of Environment and Spatial Informatics, China University of Mining and Technology, Jiangsu, China.
Nanshan Zheng
Affiliation:
School of Environment and Spatial Informatics, China University of Mining and Technology, Jiangsu, China.
Wenyuan Zhang
Affiliation:
School of Environment and Spatial Informatics, China University of Mining and Technology, Jiangsu, China.
Nan Ding
Affiliation:
School of Geography, Geomatics and Planning, Jiangsu Normal University, Jiangsu, China
*
*Corresponding author. E-mail: qiuzhaocumt@cumt.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Although multiple global navigation satellite systems (multi-GNSS) with more visible satellites have a high success rate, they make positioning time-consuming. Partial ambiguity resolution (PAR) can improve the efficiency of multi-GNSS; however, at present PAR cannot simultaneously achieve fast and high-precision positioning with a high success rate. Therefore, PAR based on ambiguity dilution of precision- and convex-hull-based satellite selection is proposed. The experimental results of the proposed PAR, its corresponding satellite selection algorithm, the classical PAR, and the low-cutoff-elevation-angle-based multi-GNSS show that the proposed PAR outperforms the classical PAR, i.e., it achieves fast and high-precision positioning with a success rate of 100⋅0%. Furthermore, in terms of R-ratio-test-based ambiguity validation, it improves the reliability of carrier-phase-based integrity monitoring of multi-GNSS and the corresponding satellite selection algorithms. In addition, its positioning accuracy is close to that of multi-GNSS and higher than that of the classical PAR, with maximum differences of 0⋅3 and 2⋅4 cm, respectively. The proposed single (dual) frequency-based PAR improves single/dual-frequency multi-GNSS efficiency by more than 54⋅9%/80⋅4% (42⋅0%/75⋅8%) when 14⋅4 (13⋅2) out of 24⋅4 satellites are selected.

Type
Research Article
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press on behalf of The Royal Institute of Navigation

1. Introduction

Global navigation satellite system (GNSS)-based instantaneous (single-epoch) and high-precision positioning has wide applications, such as in deformation monitoring, geological disaster monitoring, and unmanned driving (Han and Rizos, Reference Han and Rizos1999; Yi et al., Reference Yi, Li and Gu2013; Liu et al., Reference Liu, Zhang, Zhang, Ding and Yang2019). The key to these applications lies in fast, reliable, and correct determination of the integer ambiguity vector, which has long been a major challenge. Although single-epoch single satellite system can realise fast positioning, its ambiguity resolution success rate is low and its positioning is unreliable owing to its weak model (Deng et al., Reference Deng, Tang, Liu and Shi2014). With the development of the global positioning system (GPS), BeiDou navigation satellite system (BDS), and Galileo, multiple GNSS (multi-GNSS)-based single-epoch positioning has become feasible and its success rate can reach up to 100% for short baselines (Teunissen et al., Reference Teunissen, Odolinski and Odijk2014; Odolinski et al., Reference Odolinski, Teunissen and Odijk2015; Odolinski and Teunissen, Reference Odolinski and Teunissen2016). As of March 2021, the GPS has 31 operational satellites (GPS.GOV, 2021). Similarly, there are 26 Galileo satellites in orbit; however, only 22 of them are available for service (European GNSS Service Centre, 2021). Further, there are 15 regional and 29 global BDS satellites that provide positioning services (BeiDou Navigation Satellite System, 2021). Multi-GNSS can improve the geometric strength of the GNSS model, the probability of correct ambiguity estimation, and the reliability of the positioning system (Yang et al., Reference Yang, Li, Xu, Tang, Guo and He2011; Li et al., Reference Li, Yang, Xu, He and Gou2015). However, the large number of observed satellites in multi-GNSS makes positioning time-consuming.

Partial ambiguity resolution (PAR) can improve the computational efficiency by fixing a subset of ambiguities rather than a full set, which includes model- and data-driven PAR (Teunissen et al., Reference Teunissen, Joosten and Tiberius1999; Verhagen et al., Reference Verhagen, Teunissen, Marel and Li2011; Brack and Christoph, Reference Brack and Christoph2014; Brack, Reference Brack2017). Model-driven PAR includes classical PAR (Teunissen et al., Reference Teunissen, Joosten and Tiberius1999), sequential PAR (Liu et al., Reference Liu, Chen, Zhang and Zhang2017), iterative PAR (Parkins, Reference Parkins2011), and satellite-selection-based PAR (Mowlam, Reference Mowlam2004; Takasu and Yasuda, Reference Takasu and Yasuda2010). However, for the classical PAR, the integer bootstrapping success rate ${\textrm{P}_{\textrm{s,IB}}}$ of multi-GNSS can reach up to 100%; thus, ${\textrm{P}_{\textrm{s,IB}}}$ is no longer suitable as a threshold for selecting the ambiguity subset. Meanwhile, the conservative ${\textrm{P}_{\textrm{s,IB}}}$ sometimes causes the ambiguity vector to be fixed incorrectly and results in a low success rate. Because the sequential PAR resolves all ambiguities by fixing partial ambiguities in batches, it limits the improvement of the computational efficiency, which is not beneficial for multi-GNSS to achieve fast positioning. Furthermore, the unpredictable number of iterations of the iterative PAR may make positioning more time-consuming. The selected ambiguities of the classical, iterative, and satellite-selection-based PAR commonly correspond to high-elevation-angle satellites, which will result in low positioning accuracy. In addition, ambiguity decorrelation is required in the model- and data-driven PAR, and the higher the dimension of ambiguity vector, the more time-consuming is the decorrelation. Hence, for multi-GNSS, how to rapidly select an optimal subset of ambiguities to achieve fast and high-precision positioning with a high success rate is a critical problem.

Ambiguity dilution of precision (ADOP) is a scalar factor for measuring the ambiguity resolution success rate. To address the above-mentioned limitations of the present PAR, a novel PAR based on ADOP- and convex-hull-based satellite selection (ACPAR) is proposed. The feasibility of ADOP as a threshold of PAR to select partial ambiguities by selecting satellites before ambiguity decorrelation is analysed. Then, ambiguity selection strategies based on ADOP- and convex-hull-based satellite selection are proposed to rapidly determine the optimal ambiguity subset. Specifically, ambiguity selection based on convex-hull-based satellite selection is proposed to select the required ambiguities related to the evenly distributed low-elevation-angle satellites. Further, ambiguity selection based on ADOP-based satellite selection is proposed to select the least number of ambiguities corresponding to the high-elevation-angle satellites. The results of single-epoch GPS/BDS/Galileo relative positioning experiments indicate that ACPAR outperforms the classical PAR, i.e., it achieves fast and high-precision positioning with a success rate of 100⋅0%. Furthermore, its positioning accuracy is close to that of low-cutoff-elevation-angle-based multi-GNSS (L-multi-GNSS) and much higher than that of the classical PAR. Similar to ADOP- and convex-hull-based satellite selection, it can improve the computational efficiency of L-multi-GNSS considerably, which is higher than that of the classical PAR. Moreover, it can improve the R-ratio-test-based reliability of L-multi-GNSS and the corresponding satellite selection.

The remainder of this paper is organised as follows. Section 2 introduces the GNSS ambiguity resolution theory with the R-ratio test. Section 3 describes the ADOP and convex hull theories. Section 4 introduces the ACPAR. Section 5 discusses the positioning performance of ACPAR on the basis of single-epoch positioning experiments. Finally, Section 6 concludes the paper.

2. GNSS ambiguity resolution

2.1 Full and partial ambiguity resolution modes

The double-difference function and stochastic models of observed satellites are given by Equations (1) and (2), respectively (Teunissen et al., Reference Teunissen, Odolinski and Odijk2014):

(1)\begin{align}\boldsymbol{E}\left[ {\begin{matrix} \boldsymbol{p}\\ \emptyset \end{matrix}} \right] & = \left[ {\begin{matrix} {\begin{matrix} \boldsymbol{B}\\ \boldsymbol{B} \end{matrix}}& {\begin{matrix} {\bf 0}\\ {{\boldsymbol{B}_\mathrm{\lambda }}} \end{matrix}} \end{matrix}} \right] \cdot \left[ {\begin{matrix} \boldsymbol{b}\\ \boldsymbol{a} \end{matrix}} \right]\end{align}
(2)\begin{align}\boldsymbol{D}\left[ {\begin{matrix} \boldsymbol{p}\\ \emptyset \end{matrix}} \right]& =\left[ {\begin{matrix} {\begin{matrix} {{\boldsymbol{Q}_{\boldsymbol{p}}}}& {\bf 0} \end{matrix}}\\ {\begin{matrix} {\bf 0}& {{\boldsymbol{Q}_\emptyset }} \end{matrix}} \end{matrix}} \right]=\left[ {\begin{matrix} {\sigma_p^\textrm{2}\boldsymbol{Q}}& {\bf 0}\\ {\bf 0}& {\sigma_\emptyset^\textrm{2}\boldsymbol{Q}} \end{matrix}} \right],{\boldsymbol{D}^{ - \textrm{1}}}=\left[ {\begin{matrix} {\begin{matrix} {\boldsymbol{P}\textrm{/}\sigma_p^\textrm{2}}& {\bf 0} \end{matrix}}\\ {\begin{matrix} {\bf 0}& {\boldsymbol{P}\textrm{/}\sigma_\emptyset^\textrm{2}} \end{matrix}} \end{matrix}} \right],\boldsymbol{P}={\boldsymbol{Q}^{ - \textrm{1}}}\end{align}

where $\boldsymbol{E}[{\cdot} ]$ and $\boldsymbol{D}[{\cdot} ]$ denote the expectation and dispersion operators, respectively; $\boldsymbol{b}$ and $\boldsymbol{a}$ represent the baseline and double-difference ambiguity vectors, respectively; $\boldsymbol{B}$ is a coefficient matrix, and ${\boldsymbol{B}_\lambda }=\lambda \cdot {\boldsymbol{I}_{n\mathrm{\ \times }n}}$, where $\lambda$ is the carrier wavelength and n is the ambiguity vector dimension; $\boldsymbol{Q}$ is the covariance matrix of the double-difference observations with the elevation-dependent weighting model; and ${\sigma _p}$ and ${\sigma _\emptyset }$ are the undifferenced code and phase standard deviations, respectively.

Using the standard least-squares method, the float solutions $\hat{\boldsymbol{b}}$ and $\hat{\boldsymbol{a}}$ with variance-covariance matrices ${\boldsymbol{Q}_{\hat{b}}}$ and ${\boldsymbol{Q}_{\hat{a}}}$ can be obtained. The least-squares ambiguity decorrelation adjustment (LAMBDA) can be used to obtain the integer solution of the ambiguity vector in the full ambiguity resolution mode (Teunissen, Reference Teunissen1995):

(3)\begin{equation}\check{\bf z} = \mathop {\textrm{min}}\limits_{\boldsymbol{z} \in \tilde{\boldsymbol{Z}}} {({\hat{\boldsymbol{z}}-\boldsymbol{z}} )^\textrm{T}}Q_{\hat{z}}^{ - \textrm{1}}\textrm{(}\hat{\boldsymbol{z}}-\boldsymbol{z}\textrm{)}\end{equation}

where $\hat{\boldsymbol{z}}=\boldsymbol{Z\hat{a}}$, ${Q_{\hat{z}}}=\boldsymbol{Z}{Q_{\hat{a}}}{\boldsymbol{Z}^\textrm{T}}$, Z represents the decorrelation transform matrix, and $\tilde{\boldsymbol{Z}}$ represents the set of integers. If Z is set as ${\left[ {\begin{matrix} {\boldsymbol{Z}_\textrm{1}^\textrm{T}}& {\boldsymbol{Z}_\textrm{2}^\textrm{T}} \end{matrix}} \right]^\textrm{T}}$, Equation (3) can be expressed as follows (Li et al., Reference Li, Yang, Xu, He and Gou2015):

(4)\begin{equation}\begin{cases} \check{\boldsymbol{z}}_\textrm{1} = \mathop {\textrm{min}}\limits_{{\boldsymbol{z}_\textrm{1}} \in \tilde{\boldsymbol{Z}}} {{({{{\hat{\boldsymbol{z}}}_\textrm{1}}-{\boldsymbol{z}_\textrm{1}}} )}^\textrm{T}}\boldsymbol{Q}_{{{\hat{z}}_\textrm{1}}}^{ - \textrm{1}}({{{\hat{\boldsymbol{z}}}_\textrm{1}}-{\boldsymbol{z}_\textrm{1}}} )\\ \check{\boldsymbol{z}}_\textrm{2}=\mathop {\textrm{min}}\limits_{{\boldsymbol{z}_\textrm{2}} \in \tilde{\boldsymbol{Z}}} {{({{{\hat{\boldsymbol{z}}}_{\textrm{2}/\textrm{1}}}-{\boldsymbol{z}_\textrm{2}}} )}^\textrm{T}}\boldsymbol{Q}_{{{\hat{z}}_{\textrm{2}/\textrm{1}}}}^{ - \textrm{1}}({{{\hat{\boldsymbol{z}}}_{\textrm{2}/\textrm{1}}}-{\boldsymbol{z}_\textrm{2}}} ) \end{cases}\end{equation}

where ${\hat{\boldsymbol{z}}_\textrm{1}}={\boldsymbol{Z}_\textrm{1}}\hat{\boldsymbol{a}}$, ${\hat{\boldsymbol{z}}_{\textrm{2}/\textrm{1}}}={\hat{\boldsymbol{z}}_\textrm{2}}-{\boldsymbol{Q}_{{{\mathrm{\hat{z}}}_\textrm{2}}{{\mathrm{\hat{z}}}_\textrm{1}}}}\boldsymbol{Q}_{{{\mathrm{\hat{z}}}_\textrm{1}}}^{ - \textrm{1}}\textrm{(}{\hat{\boldsymbol{z}}_\textrm{1}}-{\boldsymbol{z}_\textrm{1}}\textrm{)}$, ${\hat{\boldsymbol{z}}_\textrm{2}}={\boldsymbol{Z}_\textrm{2}}\hat{\boldsymbol{a}}$, ${\boldsymbol{Q}_{{{\mathrm{\hat{z}}}_\textrm{1}}}}={\boldsymbol{Z}_\textrm{1}}{\boldsymbol{Q}_{\mathrm{\hat{a}}}}{\boldsymbol{Z}_\textrm{1}}^\textrm{T}$, ${\boldsymbol{Q}_{{{\hat{z}}_\textrm{2}}}}={\boldsymbol{Z}_\textrm{2}}{\boldsymbol{Q}_{\hat{a}}}{\boldsymbol{Z}_\textrm{2}}^\textrm{T}$, ${\boldsymbol{Q}_{{{\hat{\boldsymbol{z}}}_\textrm{1}}{{\hat{\boldsymbol{z}}}_\textrm{2}}}}=\boldsymbol{Q}_{{{\hat{z}}_\textrm{2}}{{\hat{z}}_\textrm{1}}}^\textrm{T}={\boldsymbol{Z}_\textrm{1}}{\boldsymbol{Q}_{\hat{a}}}{\boldsymbol{Z}_\textrm{2}}^\textrm{T}$, and ${\boldsymbol{Q}_{{{\hat{z}}_{\textrm{2}/\textrm{1}}}}}={\boldsymbol{Q}_{{{\hat{z}}_\textrm{2}}}}-{\boldsymbol{Q}_{{{\hat{z}}_\textrm{2}}{{\hat{z}}_\textrm{1}}}}\boldsymbol{Q}_{{{\hat{z}}_\textrm{1}}}^{ - \textrm{1}}{\boldsymbol{Q}_{{{\hat{z}}_\textrm{1}}{{\hat{z}}_\textrm{2}}}}$. In the PAR mode, only ambiguity subset ${\hat{\boldsymbol{z}}_\textrm{1}}$ is fixed as integer solution $\check{\boldsymbol{z}} _\textrm{1}$ by LAMBDA.

2.2 R-ratio-test-based ambiguity validation

The ambiguity validation that determines whether to accept the integer solution fixed in Section 2.1 is a non-trivial procedure for achieving high-precision positioning. The ratio test with an empirical threshold has been widely used for ambiguity validation. The most commonly used test is the R-ratio test, which can be defined as follows (Verhagen and Teunissen, Reference Verhagen and Teunissen2006, Reference Verhagen and Teunissen2013):

(5)\begin{equation}\frac{\left( \hat{\boldsymbol{a}}-\check{\boldsymbol{a}}_2 \right)^\textrm{T}\boldsymbol{Q}_{\hat{a}}^{ - \textrm{1}}\left( \hat{\boldsymbol{a}}-\check{\boldsymbol{a}}_\textrm{2} \right)}{\left( \hat{\boldsymbol{a}}-\check{\boldsymbol{a}}_\textrm{1} \right)^\textrm{T}\boldsymbol{Q}_{\hat{a}}^{ - \textrm{1}}\left( \hat{\boldsymbol{a}}-\check{\boldsymbol{a}}_\textrm{1} \right)}=\frac{\boldsymbol{R}_\textrm{2}}{\boldsymbol{R}_\textrm{1}} \ge \mu\end{equation}

where $\mu$ is the tolerance value and ${R_i}$ is the quadratic form of the ambiguity residuals of the best (i = 1) and second-best (i = 2) integer solutions, i.e., $\check{\boldsymbol{a}} _\textrm{1}$ and $\check{\boldsymbol{a}} _\textrm{2}$, respectively. Note that $\check{\boldsymbol{a}}_\textrm{1}$ can be accepted only when the ratio in Equation (5) is sufficiently large.

3. ADOP and two-dimensional convex hull theories

3.1 Single-epoch ADOP

The ADOP, first introduced by Teunissen (Reference Teunissen1997), is as an easy-to-compute scalar diagnostic for measuring the intrinsic model strength for successful ambiguity resolution. It can be defined as follows:

(6)\begin{equation}\textrm{ADOP = }{|{{\boldsymbol{Q}_{\hat{a}}}} |^{\textrm{1}/\textrm{2}n}}\end{equation}

The ADOP for the geometry-based single-epoch single-baseline mode is given as follows (Odijk and Teunissen, Reference Odijk and Teunissen2008):

(7)\begin{equation}\textrm{ADOP} \approx \frac{{\sqrt {\textrm 2} |{{{\mathrm{\bar{\sigma }}}_\phi }} |}}{{\mathrm{\bar{\lambda }}}} \cdot {\left[ {\frac{{\mathop \sum \nolimits_{s\textrm{ = 1}}^m {w_s}}}{{\mathop \prod \nolimits_{s\textrm{ = 1}}^m {w_s}}}} \right]^{1/\textrm{2}n}} \cdot {\left[ {\frac{{{{\mathrm{\bar{\sigma }}}_p}}}{{{{\mathrm{\bar{\sigma }}}_\emptyset }}}} \right]^{3/n}}={f_\textrm{1}} \cdot {f_\textrm{2}} \cdot {f_\textrm{3}}\end{equation}

where $|{\cdot} |$ denotes the determinant, $\bar{\lambda }=\prod\nolimits_{i\textrm{ = 1}}^j {\lambda _i^{\textrm{1}/j}}$, ${\mathrm{\bar{\sigma }}_\phi }\mathrm{\ =\ \Big(\Big(\sigma }_{{\phi _1}}^\textrm{2}+ \cdots \mathrm{\ +\ \sigma }_{{\phi _j}}^\textrm{2}{\Big)\Big/}j\Big)$, ${\mathrm{\bar{\sigma }}_p}\mathrm{\ =\ \Big(\Big(\sigma }_{{p_1}}^\textrm{2}+ \cdots \mathrm{\ +\ \sigma }_{{p_j}}^\textrm{2}{\Big)\Big/}j\Big)$, where j is the number of frequencies, and $w\textrm{ = (sin}\theta {\textrm{)}^\textrm{2}}$, where $\theta$ denotes the elevation angle. The ADOP also provides a good approximation to the integer least-squares success rate ${\textrm{P}_{\textrm{s,ILS}}}$ of the ambiguity resolution (Verhagen, Reference Verhagen2003; Odijk and Teunissen, Reference Odijk and Teunissen2008):

(8)\begin{equation}{\textrm{P}_{\textrm{s,IB}}} \le {\textrm{P}_{\textrm{s,ILS}}} \approx {\textrm{P}_{\textrm{s,ADOP}}}={\left[ {\mathrm{2\Phi }\left( {\frac{\textrm{1}}{{\textrm{2ADOP}}}} \right)-\textrm{1}} \right]^n}\end{equation}

where ${\textrm{P}_{\textrm{s,ADOP}}}$ represents the ADOP-based success rate. Note that ${\textrm{P}_{\textrm{s,ADOP}}}$ and ${\textrm{P}_{\textrm{s,ILS}}}$ increase as ADOP decreases; the more ambiguities are involved, the steeper the decrease will be (Odijk and Teunissen, Reference Odijk and Teunissen2008).

3.2 Two-dimensional convex hull

The smallest convex set containing the given finite point set $\boldsymbol{S}=\{{{\textrm{d}_\textrm{1}}, \cdots ,{\textrm{d}_\textrm{k}}} \}$ in Euclidean plane ${R^\textrm{2}}$ is called a two-dimensional convex hull whose vertices, called extreme points, belong to S. Graham's Scan algorithm (Figure 1) is a well-known algorithm that constructs a sequence ${\bf D}=\{{{\textrm{D}_\textrm{1}}, \cdots \textrm{,\;}{\textrm{D}_\textrm{5}}} \}$ for all points in a polar coordinate system with ${\textrm{D}_\textrm{0}}$ as a pole, ${\textrm{D}_\textrm{0}}\textrm{L}$ as the starting direction, and counter-clockwise as the positive direction (An, Reference An2007). If the interior angle ${\varphi _i}$ composed of the three adjacent points is not greater than $\mathrm{\pi }$, then ${\textrm{D}_i}$ is an extreme point. In Figure 1, ${\textrm{D}_\textrm{0}}$, ${\textrm{D}_\textrm{1}}$, ${\textrm{D}_\textrm{2}}$, ${\textrm{D}_\textrm{4}}$, and ${\textrm{D}_\textrm{5}}$ are extreme points.

Figure 1. Graham's scan algorithm for a convex hull

4. PAR based on ADOP- and convex-hull-based satellite selection

In this section, the feasibility of ADOP as a threshold of PAR is analysed. Then, a novel PAR, i.e., ACPAR, is proposed. ADOP is invariant for a class of admissible ambiguity transformations, which makes it possible for ADOP to serve as a threshold for determining the ambiguity subset before ambiguity decorrelation. Based on Equation (7), ADOP can be predicted precisely by observed satellites that have a definite relationship with double-difference ambiguities. Hence, the ambiguity subset can be determined by selecting the corresponding satellites.

4.1 Feasibility analysis of ADOP as a threshold factor

To analyse the feasibility of ADOP as a PAR threshold, the corresponding parameters in Equations (1) and (2) are set as follows: $\boldsymbol{p} = {\left[ {\begin{matrix} {\boldsymbol{p}_\textrm{1}^\textrm{T}}& {\boldsymbol{p}_\textrm{2}^\textrm{T}} \end{matrix}} \right]^\textrm{T}}$, $\boldsymbol{\phi } = {\left[ {\begin{matrix} {\boldsymbol{\phi }_\textrm{1}^\textrm{T}}& {\boldsymbol{\phi }_\textrm{2}^\textrm{T}} \end{matrix}} \right]^\textrm{T}}$, $\boldsymbol{B}={\left[ {\begin{matrix} {\boldsymbol{B}_\textrm{1}^\textrm{T}}& {\boldsymbol{B}_\textrm{2}^\textrm{T}} \end{matrix}} \right]^\textrm{T}}$, $\boldsymbol{a}={\left[ {\begin{matrix} {\boldsymbol{a}_\textrm{1}^\textrm{T}}& {\boldsymbol{a}_\textrm{2}^\textrm{T}} \end{matrix}} \right]^\textrm{T}}$, ${\boldsymbol{B}_\lambda }=\left[ {\begin{matrix} {{\boldsymbol{B}_{\textrm{1,}\lambda }}}& \textrm{0}\\ \textrm{0}& {{\boldsymbol{B}_{\textrm{2},\lambda }}} \end{matrix}} \right]$, $\boldsymbol{Q} = \left[ {\begin{matrix} {\begin{matrix} {{\boldsymbol{Q}_\textrm{1}}}& {{\boldsymbol{Q}_{\textrm{12}}}} \end{matrix}}\\ {\begin{matrix} {{\boldsymbol{Q}_{\textrm{21}}}}& {{\boldsymbol{Q}_\textrm{2}}} \end{matrix}} \end{matrix}} \right]$, and $\boldsymbol{P}=\left[ {\begin{matrix} {\begin{matrix} {\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}+\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}{\boldsymbol{Q}_{\textrm{12}}}{\boldsymbol{P}_\textrm{2}}{\boldsymbol{Q}_{\textrm{21}}}\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}}\\ { - {\boldsymbol{P}_\textrm{2}}{\boldsymbol{Q}_{\textrm{21}}}\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}} \end{matrix}}& {\begin{matrix} { - \boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}{\boldsymbol{Q}_{\textrm{12}}}{\boldsymbol{P}_\textrm{2}}}\\ {{\boldsymbol{P}_\textrm{2}}} \end{matrix}} \end{matrix}} \right]$, where ${\boldsymbol{P}_\textrm{2}}={[{{\boldsymbol{Q}_\textrm{2}}-{\boldsymbol{Q}_{\textrm{21}}}\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}{\boldsymbol{Q}_{\textrm{12}}}} ]^{ - \textrm{1}}}$. When the parameters with the subscript ‘1’ determined by satellite selection are used for positioning, the float ambiguity vector ${\hat{\boldsymbol{a}}_\textrm{1}}$ and its variance-covariance matrix are labelled as $\hat{\boldsymbol{a}}_\textrm{1}^\textrm{S}$ and $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{S}$, respectively. They are marked as $\hat{\boldsymbol{a}}_\textrm{1}^\textrm{P}$ and $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{P}$ with all the parameters used. The relationship between $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{S}$ and $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{P}$ can be expressed as follows (Liu et al., Reference Liu, Zhang, Zhang, Zheng, Zhang and Ding2021):

(9)\begin{equation}\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{P}=\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{S}-{\boldsymbol{A}_\textrm{1}}\end{equation}

where ${\boldsymbol{A}_\textrm{1}}=\boldsymbol{B}_{\textrm{1,}\lambda }^{ - \textrm{1}}{\boldsymbol{B}_\textrm{1}}{\boldsymbol{A}_\textrm{2}}\boldsymbol{B}_\textrm{1}^\textrm{T}\boldsymbol{B}_{\textrm{1,}\lambda }^{ - \textrm{1}}$ is a positive semidefinite matrix, ${\boldsymbol{A}_\textrm{2}}={\boldsymbol{Q}_{\hat{b}}}\boldsymbol{A}_\textrm{3}^\textrm{T}{({\boldsymbol{P}_\textrm{2}^{ - \textrm{1}}+{\boldsymbol{A}_\textrm{3}}{\boldsymbol{Q}_{\hat{b}}}\boldsymbol{A}_\textrm{3}^\textrm{T}} )^{ - \textrm{1}}}{\boldsymbol{A}_\textrm{3}}{\boldsymbol{Q}_{\hat{b}}}$, and ${\boldsymbol{A}_\textrm{3}}=\frac{\textrm{1}}{{{\mathrm{\sigma }_p}}}({{\boldsymbol{Q}_{\textrm{21}}}\boldsymbol{Q}_\textrm{1}^{ - \textrm{1}}{\boldsymbol{B}_\textrm{1}}-{\boldsymbol{B}_\textrm{2}}} )$. For positive definite matrices $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{S}$ and $\boldsymbol{Q}_{{{\hat{a}}_\textrm{1}}}^\textrm{P}$, Equation (10) holds on the basis of Weyl's theorem (Lancaster and Tismenetsky, Reference Lancaster and Tismenetsky1985) and Equations (6), (8), and (9):

(10)\begin{equation}{\begin{cases} {\textrm{ADO}{\textrm{P}^\textrm{P}}\mathrm{\ < ADO}{\textrm{P}^\textrm{S}}}\\ {\textrm{P}_{\textrm{s,ADOP}}^\textrm{S}\mathrm{\ < P}_{\textrm{s,ADOP}}^\textrm{P} \approx \textrm{P}_{\textrm{s,ILS}}^\textrm{P}} \end{cases}}\end{equation}

where $\textrm{ADO}{\textrm{P}^\textrm{P}}$ and $\textrm{ADO}{\textrm{P}^\textrm{S}}$ represent the ADOP values of $\hat{\boldsymbol{a}}_\textrm{1}^\textrm{P}$ and $\hat{\boldsymbol{a}}_\textrm{1}^\textrm{S}$, respectively, $\textrm{P}_{\textrm{s,ADOP}}^\textrm{P}$ and $\textrm{P}_{\textrm{s,ADOP}}^\textrm{S}$ denote their ADOP-based success rates, respectively, and $\textrm{P}_{\textrm{s,ILS}}^\textrm{P}$ denotes the integer least-squares success rate of $\hat{\boldsymbol{a}}_\textrm{1}^\textrm{P}$.

The relation $ \textrm{P}_{\textrm{s,ADOP}}^\textrm{S}\mathrm{\ < P}_{\textrm{s,ADOP}}^\textrm{P}$ indicates that it is feasible to use the ADOP as the PAR threshold to determine the ambiguity subset by selecting satellites. Equation (8) indicates that ${\textrm{P}_{\textrm{s,ADOP}}}$ can estimate ${\textrm{P}_{\textrm{s,ILS}}}$ more accurately than ${\textrm{P}_{\textrm{s,IB}}}$. Hence, from the analyses presented above, compared with the conservative ${\textrm{P}_{\textrm{s,IB}}}$, ADOP is more suitable as a threshold for selecting partial ambiguities.

4.2 ADOP- and convex-hull-based ambiguity selection method

Rapidly determining the optimal ambiguity subset is of the utmost importance for PAR to achieve instantaneous high-precision positioning. Based on the positioning dilution of precision theory (Phillips, Reference Phillips1984), the selected ambiguities should correspond to the low- and high-elevation-angle satellites evenly distributed around the receiver. Hence, fast ambiguity selection methods based on ADOP- and convex-hull-based satellite selection are proposed in Sections 4.2.1 and 4.2.2.

4.2.1 Ambiguity selection based on convex-hull-based satellite selection

Compared with other points, the polygon area formed by the extreme points of the convex hull is maximum. Hence, an ambiguity selection method based on convex-hull-based satellite selection is first proposed to select the required ambiguities corresponding to evenly distributed low-elevation-angle satellites. In this method, convex-hull-based satellite selection, including the equipartition rotation method based on the convex hull and the method of the minimum inscribed circle of a polygon with the largest radius, is proposed to rapidly select low-elevation-angle satellites.

For the convex-hull-based equipartition rotation method, all the visible satellites are projected onto the XY plane of the local Cartesian coordinates, as shown in Figure 2(a): the circle represents the cutoff elevation angle, ‘O’ represents the master station, and the points represent the observed satellites.

Figure 2. Convex-hull-based equipartition rotation method

Let us suppose that ${m_\textrm{L}}\textrm{ = 3}$ points evenly distributed around point O need to be selected from $m^{\prime}\textrm{ = 9}$ extreme points. The detailed strategy is as follows. (a) The starting line O1, together with the equipartition lines 1 and 2 in Figure 2(b), divides the circle evenly into ${m_\textrm{L}}$ parts; each part is evenly divided by the blue dotted lines, which makes the circle evenly divided into sectors ${\tilde{\varphi }_\textrm{1}}$, ${\tilde{\varphi }_\textrm{2}}$, and ${\tilde{\varphi }_\textrm{3}}$, with the red lines as their bisectors. (b) For each sector, the extreme point with the smallest angular distance from its angle bisector is selected, i.e., the points 1, 4, and 7 in sectors ${\varphi _\textrm{1}}$, ${\varphi _\textrm{2}}$, and ${\varphi _\textrm{3}}$ in Figure 2(b). (c) The red and blue lines are rotated clockwise with point O as the origin until the starting line coincides with line O2, as shown in Figure 2(c). Step (b) is repeated and the points 2, 5, and 9 are selected. Step (c) is repeated until all the extreme points have been executed and there are at most $m^{\prime}\textrm{ = 9}$ sets of extreme points selected finally.

The optimal set that is most evenly distributed around point O needs to be determined from the selected point sets. Hence, the method of the largest-radius-based minimum inscribed circle of a polygon is proposed, in which the minimum inscribed circle of the polygon is the circle with point O as the centre and the shortest distance from point O to each side of the polygon as the radius.

In Figure 3, the blue circle with radius d and the red circle with radius $d^{\prime}$ are the minimum inscribed circles of $\Delta \textrm{ABC}$ and $\Delta \mathrm{A^{\prime}B^{\prime}C^{\prime}}$, respectively, where $\Delta \textrm{ABC}$ is an equilateral triangle. The points of $\Delta \textrm{ABC}$ are more evenly distributed around point O than those of $\Delta \mathrm{A^{\prime}B^{\prime}C^{\prime}}$, and both the area and the radius of the blue circle of $\Delta \textrm{ABC}$ are larger than those of $\Delta \mathrm{A^{\prime}B^{\prime}C^{\prime}}$. Hence, it can be concluded that the more even the distribution of the points around point O, the larger is the radius of the minimum inscribed circle. The set of extreme points whose minimum inscribed circle has the largest radius is selected as the optimal point set. Hence, by the convex-hull-based satellite selection, the ambiguities corresponding to ${m_\textrm{L}}$ low-elevation-angle satellites are selected first.

Figure 3. Inscribed circle of a triangle with different radii

4.2.2 Ambiguity selection method based on ADOP-based satellite selection

The given ADOP ($\textrm{ADO}{\textrm{P}^\textrm{G}}$) can be achieved with the minimum number of high-elevation-angle satellites (Liu et al., Reference Liu, Zhang, Zhang, Ding and Yang2019). Therefore, to realise fast positioning with a high success rate, an ambiguity selection method based on ADOP-based satellite selection is proposed to select the remaining ambiguities corresponding to high-elevation-angle satellites in the optimal subset based on $\textrm{ADO}{\textrm{P}^\textrm{G}}$.

To facilitate the analysis, the equation $\textrm{ln}({\textrm{ADOP}/{f_\textrm{1}}} )=\alpha ({\beta \textrm{\; + \; }\xi } )$ is used, where $\alpha =\frac{\textrm{1}}{n}$, $\beta =\frac{\textrm{1}}{\textrm{2}}\textrm{ln}\left( {\mathop \sum \nolimits_{s\textrm{ = 1}}^m {w_s}/\mathop \prod \nolimits_{s\textrm{ = 1}}^m {w_s}} \right)\;$, and $\xi \textrm{ = ln}{({{{\mathrm{\bar{\sigma }}}_p}/{{\mathrm{\bar{\sigma }}}_\emptyset }} )^\textrm{3}}$, and $\textrm{ln}(\mathrm{\ast } )$ is the e-based logarithmic function. Further, $\beta$ is selected as the threshold because only $\beta$ is a variable for $\textrm{ADO}{\textrm{P}^\textrm{G}}$ with a known number of satellites for the determined system. From Equation (7), the theoretical $\tilde{\beta }$ and actual calculated $\bar{\beta }$ can be written as follows:

(11)\begin{equation} {\begin{cases} {\tilde{\beta }=\dfrac{{\textrm{ln}({\textrm{ADOP}/{f_\textrm{1}}} )}}{\alpha }-\xi }\\ {\bar{\beta } = \ln{{\left( {\dfrac{{\mathop \sum \nolimits_{i\textrm{ = 1}}^{{m_\textrm{L}}} w_i^\textrm{L}+\mathop \sum \nolimits_{s\textrm{ = 1}}^{{m_\textrm{H}}} w_s^\textrm{H}}}{{\mathop \prod \nolimits_{i\textrm{ = 1}}^{{m_\textrm{L}}} w_i^\textrm{L} \cdot \mathop \prod \nolimits_{s\textrm{ = 1}}^{{m_\textrm{H}}} w_s^\textrm{H}}}} \right)}^{1/2}}} \end{cases}}\end{equation}

where ${m_\textrm{H}}$ is the number of selected high-elevation-angle satellites and $n={m_\textrm{H}}+{m_\textrm{L}} - t$, where t denotes the number of reference satellites. When $\bar{\beta }$ is smaller than $\tilde{\beta }$, $\textrm{ADO}{\textrm{P}^\textrm{P}}\mathrm{\ < ADO}{\textrm{P}^\textrm{S}}\mathrm{\ < ADO}{\textrm{P}^\textrm{G}}$ and $\textrm{P}_{\textrm{s,ADOP}}^\textrm{G}\mathrm{\ < P}_{\textrm{s,ADOP}}^\textrm{S}\mathrm{\ < P}_{\textrm{s,ADOP}}^\textrm{P}$ hold on the basis of Equation (10), where $\textrm{P}_{\textrm{s,ADOP}}^\textrm{G}$ is the ADOP-based success rate calculated on the basis of $\textrm{ADO}{\textrm{P}^\textrm{G}}$.

The specific steps of the proposed method are as follows. First, ${m_\textrm{H}} \ge t$ satellites with the highest elevation angles are selected from the remaining visible satellites. For $\textrm{ADO}{\textrm{P}^\textrm{G}}$, if ${\bar{\beta }_\textrm{1}}$ of the selected ${m_\textrm{L}}+{m_\textrm{H}}$ satellites calculated by Equation (11) is smaller than $\tilde{\beta }$, then the ambiguities corresponding to the selected satellites are the optimal subset. Otherwise, the highest-elevation-angle satellite in the remaining satellites is continuously selected and ${\bar{\beta }_\textrm{2}}$ of all the selected satellites is calculated. The above-mentioned process is repeated until ${\bar{\beta }_\textrm{i}}$ of the selected satellites is smaller than the corresponding $\tilde{\beta }$. The ambiguity subset corresponding to the selected satellites is the optimal subset, which can be fixed by LAMBDA.

The method described in Section 4.2 is called ACPAR, and its flowchart is shown in Figure 4. The convex hull algorithm becomes more time-consuming as the number of satellites increases. To achieve fast positioning with more evenly distributed satellites, an elevation-angle-based layered processing strategy is proposed, as shown in the dotted box in Figure 4.

Figure 4. Flowchart of ACPAR

5. GPS/BDS/Galileo-based single-epoch positioning experiment

In this section, the GPS/BDS/Galileo systems are considered, as their signals are all based on the code-division multiple access technique. GLONASS was not considered, as the signals of most of its satellites are based on the frequency-division multiple access technique, which impedes straightforward integer resolution of the double-differenced ambiguities (Zaminpardaz et al., Reference Zaminpardaz, Teunissen and Nadarajah2017). Single-epoch static and low-dynamic positioning experiments based on GPS/BDS/Galileo L1/B1/E1 and L2/B2/E5b were conducted in terms of the success rate, positioning accuracy, time consumption, and R-ratio test to validate the performance of ACPAR. The models for comparison include the ADOP- and convex-hull-based satellite selection (ACSS) described in the three dotted boxes in Figure 4, the classical PAR (CPAR), and L-multi-GNSS with a cutoff elevation angle of $\textrm{1}{\textrm{0}^\mathrm{^\circ }}$. For CPAR, the float ambiguities with the highest accuracy were selected until ${\textrm{P}_{\textrm{s,IB}}}$ of the selected ambiguities was larger than the given threshold $\textrm{P}_{\textrm{s,IB}}^\mathrm{^\circ }$ and then fixed by LAMBDA. The above-mentioned data-processing algorithms were written in MATLAB R2016b based on goGPS (goGPS-project, 2021). The computer used for data processing was a Dell desktop with an Intel Core i7-7700 CPU (3⋅60 GHz) and 8⋅00 GB RAM. The baseline vector errors were obtained by subtracting the corresponding true values from the calculated baseline vectors. The empirical success rate ${\textrm{P}_{\textrm{s,E}}}$ was calculated as follows (Odolinski and Teunissen, Reference Odolinski and Teunissen2016):

(12)\begin{equation}{\textrm{P}_{\textrm{s,E}}} = \textrm{ }\frac{{\textrm{Number}\,\textrm{of}\,\textrm{successful}\,\textrm{epochs}}}{{\textrm{Number}\,\textrm{of}\,\textrm{total}\,\textrm{epochs}}}\end{equation}

where the successful epoch satisfied the following conditions: (i) the fixed ambiguities were the same as the reference ones that were determined by the multiple-frequency multi-GNSS with master and rover stations of known coordinates; (ii) the baseline vector deviations were all within certain ranges in the directions of East (E), North (N), and Up (U), the values of which were 10, 10, and 30 cm, respectively.

In this study, one pivot satellite between overlapping frequencies was used for double-difference observations. Hence, the L1/E1 parameters were labelled with the superscript ‘GE’ and they were labelled as ‘BE’ for B2/E5b. At B1/L1/E1, the average phase- and code-standard deviations were ${\mathrm{\sigma }_\emptyset }^{\textrm{GE + B}}\textrm{ = 3} \cdot \textrm{033\; }\,\textrm{mm}$ and ${\mathrm{\sigma }_p}^{\textrm{GE + B}}\textrm{ = 31} \cdot \textrm{0}\,\textrm{cm}$, respectively, and the parameters were $f_\textrm{1}^{\textrm{\; \; GE + B}} \approx \textrm{0} \cdot \textrm{02247}$, $f_\textrm{3}^{\textrm{\; \; GE + B}} \approx {({\textrm{102} \cdot \textrm{21}} )^{3/n}}$, and ${\xi ^{\textrm{GE + B}}} \approx \textrm{13} \cdot \textrm{88}$. At B2/L2/E5b, they were ${\mathrm{\sigma }_\emptyset }^{\textrm{G + BE}}\textrm{ = 3} \cdot \textrm{237}\,\textrm{mm}$, ${\mathrm{\sigma }_p}^{\textrm{G + BE}}\textrm{ = 25} \cdot \textrm{667}\,\textrm{cm}$, $f_\textrm{1}^{\textrm{\; \; G + BE}} \approx \textrm{0} \cdot \textrm{01854}$, $f_\textrm{3}^{\textrm{\; \; G + BE}} \approx {({\textrm{79} \cdot \textrm{29}} )^{3/n}}$, and ${\xi ^{\textrm{G + BE}}} \approx \textrm{13} \cdot \textrm{12}$. The above-mentioned results were estimated using the method proposed by Odolinski et al. (Reference Odolinski, Teunissen and Odijk2013); the data used were independent of those in the following sections.

5.1 GPS/BDS/Galileo-based static positioning

The 24 h and 5 km baseline data with a sampling interval of 1 s and 86,400 epochs from the Hong Kong base station were used in this section. The GPS/BDS/Galileo-based model settings are summarised in Table 1.

Table 1. Settings of different models

CPAR-DFi with given $\textrm{P}_{\textrm{s,IB}}^\mathrm{^\circ }$ can obtain the same average ${\textrm{P}_{\textrm{s,IB}}}$ as ACPAR-DFi (i = 1, 2). The $\textrm{ADO}{\textrm{P}^\textrm{G}}$ values of ACSS1-SFi, ACPAR1-SFi, and ACPAR-DFi are the maximum values for which the corresponding models can achieve ${\textrm{P}_{\textrm{s,E}}}\textrm{ = 100} \cdot \textrm{0\%}$. For ACPAR-DFi and CPAR-DFi, only the ambiguities corresponding to the ith frequency were selected as the ambiguity subset. In addition, the L1/B1/E1-, L2/B2/E5b-, and L1/2/B1/2/E1/5b-based L-multi-GNSS were labelled as L-SF1, L-SF2, and L-DF, respectively. The number of observations of L-DF was twice that of L-SFi (i = 1, 2). Note that the satellites used for positioning selected by ACSS and ACPAR were the same, with the same $\textrm{ADO}{\textrm{P}^\textrm{G}}$, based on Figure 4.

5.1.1 GPS/BDS/Galileo-based positioning performance

The results of the different models are presented in Table 2 and Figures 5–8. The values before and after ‘/’ in Table 2 denote the improvements in time consumption of the corresponding model relative to L-SFi and L-DF, respectively. The average time consumption is defined by the total time divided by the total epochs, where the numerator is the period from the time at which the observation data were obtained to the time at which all the integer solutions of b were obtained. It should be emphasised that the positioning accuracy in the following tables is three-dimensional accuracy.

Table 2. Positioning results of different models

Figure 5. Number of satellites of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Figure 6. ADOP of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Figure 7. ENU deviations of (a) ACPAR-DF1, (b) CPAR-DF1, and (c) L-SF1, (d) L-DF

Figure 8. ENU deviations of (a) ACPAR-DF2, (b) CPAR-DF2, and (c) L-SF2

As shown in Table 2 and Figures 5 and 6, to achieve ${\textrm{P}_{\textrm{s,E}}}\textrm{ = 100} \cdot \textrm{0\%}$, both the $\textrm{ADO}{\textrm{P}^\textrm{G}}$ values and the numbers of required satellites of ACSS1-SFi, ACPAR1-SFi, and ACPAR-DFi ($i\textrm{ = 1,\; 2}$) decreased, whereas the ADOP values of ACPAR1-SFi and ACPAR-DFi were slightly larger than that of ACSS1-SFi. Hence, compared with ACSS, ACPAR could achieve ${\textrm{P}_{\textrm{s,E}}}\textrm{ = 100} \cdot \textrm{0\%}$ with larger $\textrm{ADO}{\textrm{P}^\textrm{G}}$ and fewer satellites, although its ADOP was slightly larger. The above-mentioned phenomenon becomes more obvious with more observations. Based on Figure 6, the ADOP fluctuation of CPAR was larger than that of ACPAR, while the large ADOP values at some epochs denote a low success rate. Hence, the ${\textrm{P}_{\textrm{s,E}}}$ of CPAR-DFi was slightly smaller than that of ACPAR-DFi, although both its average ${\textrm{P}_{\textrm{s,IB}}}$ and ADOP were the same as those of ACPAR-DFi. This indicates that the ambiguity vectors fixed by CPAR were incorrect at some epochs albeit with large $\textrm{P}_{\textrm{s,IB}}^\mathrm{^\circ }$. Therefore, it can be concluded that ADOP is more suitable than ${\textrm{P}_{\textrm{s,IB}}}$ as a threshold for selecting the ambiguity subset.

According to Table 2, L-SFi and L-DF were most time-consuming owing to a large number of visible satellites. ACPAR, similarly to ACSS, could improve the computational efficiency of L-multi-GNSS considerably. The ACPAR1-SFi could improve the efficiency of L-SFi/L-DF by more than 54⋅9%/80⋅4% by selecting 14⋅4 out of 24⋅4 satellites. The corresponding improvement caused by ACPAR-DFi with 13⋅2 selected satellites was greater than 42⋅0%/75⋅8%, but it was smaller than that of ACPAR1-SFi owing to the large number of float parameters required to be calculated. However, the above-mentioned improvements were all larger than those of CPAR, although the number of satellites of CPAR was minimum; one reason was the similarity to ACPAR-DFi, while the other was the ambiguity decorrelation.

According to Table 2, ACSS1-SFi, ACPAR1-SFi, and ACPAR-DFi had similar positioning accuracies close to L-SFi and L-DF with a maximum difference of 0⋅3 cm. Owing to the selected ambiguities corresponding only to the high-elevation-angle satellites, the positioning accuracy of CPAR-DFi was lower than that of ACPAR-DFi with a maximum difference of 1⋅1 cm. Based on the positioning accuracy results, Figures 7 and 8 show only the baseline vector errors of ACPAR-DFi, CPAR-DFi, L-SFi, and L-DF. The same trend of the positioning accuracy can be observed for the baseline vector accuracy according to Figures 7 and 8. Specifically, the baseline vector deviations in the E, N, and U (ENU) directions of ACPAR-DFi were slightly larger than those of L-SFi and L-DF but smaller than those of CPAR-DFi.

In summary, for single-epoch positioning, compared with L-multi-GNSS, ACSS, and CPAR, ACPAR could simultaneously achieve high positioning accuracy, success rate, and computational efficiency, which also implies that ADOP is more suitable than ${\textrm{P}_{\textrm{s,IB}}}$ as a PAR threshold.

5.1.2 GPS/BDS/Galileo-based R-ratio test

In this section, $\mu$ is set to 1⋅5, 2⋅0, 2⋅5, and 3⋅0 (Verhagen and Teunissen, Reference Verhagen and Teunissen2013). The results of ACSS2-SFi, ACPAR2-SFi, ACPAR-DFi, and L-DF ($i\textrm{ = 1,\; 2}$) are presented in Table 3 and Figure 9.

Figure 9. Ratio values of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Table 3. R-ratio test results of different models

Here, the acceptance rate ${\textrm{P}_{\textrm{a,R}}}$ is defined as the number of accepted epochs divided by 86,400, where an accepted epoch satisfies Equation (5). The successfully fixed rate ${\textrm{P}_{\textrm{sf,R}}}$ is defined as the ratio of the number of successfully fixed epochs satisfying Equation (5) to the number of accepted epochs, where the epochs in the numerator should meet conditions (i) and (ii) given after Equation (12). The false alarm rate ${\textrm{P}_{\textrm{fa,R}}}$ is defined as the ratio of the number of false alarm epochs to the number of successfully fixed epochs, where the number of false alarm epochs is equal to the number of successfully fixed epochs minus the number of accepted epochs. In this section, the success rate refers to the R-ratio-test-based success rate ${\textrm{P}_{\textrm{s,R}}}$ equal to ${\textrm{P}_{\textrm{sf,R}}} \cdot {\textrm{P}_{\textrm{a,R}}}$.

The results presented in Table 3 indicate that with a certain $\mu$, ${\textrm{P}_{\textrm{a,R}}}$ of L-DF, ACSS2-SFi, ACPAR2-SFi, and ACPAR-DFi increased, which is consistent with the ratio values in Table 3 and Figure 9. When i = 1, for ${\textrm{P}_{\textrm{a,R}}}$, the maximum difference between ACSS2 and L-DF was around 36⋅1%, that between ACSS2 and ACPAR2 was around 6⋅4%, and that between ACSS2 and ACPAR-DF1 was around 11⋅0%. For i = 2, they were 43⋅7%, 3⋅6%, and 5⋅1%, respectively. Hence, both ACSS and ACPAR could improve ${\textrm{P}_{\textrm{a,R}}}$ of L-DF, while ACPAR could further improve ${\textrm{P}_{\textrm{a,R}}}$ of ACSS. Hence, the improvement caused by ACPAR increases with more satellite observations and ${\textrm{P}_{\textrm{a,R}}}$ of ACPAR could be up to 98⋅4%. Based on ${\textrm{P}_{\textrm{sf,R}}}$ equal or close to 100⋅0% and the relation of ${\textrm{P}_{\textrm{s,R}}}={\textrm{P}_{\textrm{a,R}}} \cdot {\textrm{P}_{\textrm{sf,R}}}$, the same results and conclusion as those of ${\textrm{P}_{\textrm{a,R}}}$ could be obtained for ${\textrm{P}_{\textrm{s,R}}}$.

However, ${\textrm{P}_{\textrm{fa,R}}}$ showed opposite behavior: both ACSS and ACPAR could reduce ${\textrm{P}_{\textrm{fa,R}}}$ of L-DF, while ACPAR could further reduce ${\textrm{P}_{\textrm{fa,R}}}$ of ACSS. With i = 1, ACSS2 could reduce ${\textrm{P}_{\textrm{fa,R}}}$ of L-DF by up to 36⋅4%, while ACPAR2-SF1 and ACPAR-DF1 could reduce ${\textrm{P}_{\textrm{fa,R}}}$ of ACSS2 by up to 6⋅1% and 10⋅8%, respectively. For i = 2, they were 44⋅6%, 2⋅8%, and 4⋅2%, respectively. Further, ${\textrm{P}_{\textrm{fa,R}}}$ of ACPAR could reach 1⋅6%.

Ambiguity validation falls under carrier-phase-based integrity monitoring (Feng et al., Reference Feng, Ochieng, Moore, Hill and Hide2009). Hence, in terms of the R-ratio-test-based ambiguity validation of single-epoch positioning, ACPAR could improve the reliabilities of the carrier-phase-based integrity monitoring of L-DF and ACSS: both ACPAR and ACSS could improve the ratio, ${\textrm{P}_{\textrm{a,R}}}$, and ${\textrm{P}_{\textrm{s,R}}}$ of L-DF, and reduce its ${\textrm{P}_{\textrm{fa,R}}}$, whereas the ACPAR could further improve the corresponding results of ACSS; these results become more obvious with more observations. The accuracy of low-elevation-angle satellite observations is easily and severely affected by ionospheric, tropospheric, and multipath errors, which will degrade the precision of the corresponding float ambiguities and affect the validation reliability of the entire ambiguity vector. Hence, the above-mentioned results of L-DF might be due to its large number of low-elevation-angle satellites.

5.2 L2/B2/E5b-based low-dynamic positioning

In this section, 1⋅5  h low-dynamic data with a sampling interval of 1 s, 5,218 epochs, and average speed of 30 km/h were collected using Trimble R10 from Xuzhou, China. As shown in Figure 10, one receiver was installed on the vehicle roof and another as the base station was placed on top of a building. The red line represents the movement trajectory with a maximum distance from the base station of around 8⋅0 km. The yellow directional lines and the numbers from small to large represent the driving direction and sequence of the vehicle, respectively. For urban canyon conditions, the experimental settings shown in Figure 4 were adjusted as follows: the step ‘Ambiguities related to middle-elevation-angle satellites’ was abandoned; $\theta$ in ‘Ambiguities related to low-elevation-angle satellites’ was set to $\textrm{1}{\textrm{0}^\mathrm{^\circ }} \le \mathrm{\theta } \le \textrm{5}{\textrm{0}^\mathrm{^\circ }}$. According to the results presented in the previous section, L2/B2/E5b-based positioning can achieve smaller ADOP with a similar number of satellites compared with L1/B1/E1. Hence, ACSS2-SF2, ACPAR-DF2, CPAR-DF2, and L-DF were used, for which $\textrm{P}_{\textrm{s,IB}}^\mathrm{^\circ }$ and $\textrm{ADO}{\textrm{P}^\textrm{G}}$ were set to 99⋅995% and 0⋅105, respectively.

Figure 10. (a) Experimental device and (b) movement trajectory

5.2.1 L2/B2/E5b-based positioning performance

Table 4, together with Figures 11 and 12, presents the positioning accuracy, ADOP, ${\textrm{P}_{\textrm{s,E}}}$, time consumption, and corresponding improvement results of the different models.

Table 4. Positioning results of different models

Figure 11. (a) Number of satellites and (b) ADOP of different models

Figure 12. ENU deviations of (a) ACPAR-DF2, (b) CPAR-DF2, and (c) L-DF

As shown in Table 4, the ${\textrm{P}_{\textrm{s,E}}}$ values of both ACPAR-DF2 and L-DF were up to 100⋅00% larger than that of ACSS2-SF2, while the ADOP of ACPAR-DF2 was smaller than that of ACSS2-SF2, although the same satellites were used for positioning. Hence, compared with ACSS, ACPAR could achieve higher ${\textrm{P}_{\textrm{s,E}}}$ and smaller ADOP with the same satellites and $\textrm{ADO}{\textrm{P}^\textrm{G}}$. According to the ADOP and ${\textrm{P}_{\textrm{s,E}}}$ results shown in Table 4 and Figure 11, the similar relationship between CPAR-DF2 and ACPAR-DF2 compared with that described in Section 5.1.1 indicates that the conclusion drawn in the previous section is still valid.

Table 4 and Figures 11 and 12 show that the trends in the time consumption and positioning accuracy between ACSS2-SF2, ACPAR-DF2, CPAR-DF2, and L-DF are similar to those in Section 5.1.1. Hence, in the above-mentioned aspects, the same conclusions as those in the previous section can be obtained in this section. However, there were some discrepancies. By selecting 13⋅3, 13⋅3, and 9⋅8 out of 20⋅0 satellites, respectively, ACSS-SF2, ACPAR-DF2, and CPAR-DF2 could improve the efficiency of L-DF by more than 80⋅0%, 72⋅5%, and 66⋅0%, respectively. In terms of the positioning accuracy, similar to ACSS-SF2, the positioning accuracy of ACPAR-DF2 was up to 1⋅6 cm, which was higher than those of L-DF and CPAR-DF2 with differences of around 0⋅3 and 2⋅4 cm, respectively. The positioning accuracy of L-DF was lower than that of ACPAR-DF2, which may be due to the large number of low-elevation-angle satellites in L-DF. Compared with high-elevation-angle satellites, low-elevation-angle satellite signals are severely affected by ionospheric and tropospheric delay errors, and are vulnerable to multipath errors, which will adversely affect the positioning accuracy and ambiguity resolution success rate.

In summary, in terms of L2/B2/E5b-based low-dynamic single-epoch positioning, compared to L-multi-GNSS, ACSS, and CPAR, ACPAR could simultaneously achieve fast and high-precision positioning with a high success rate, which again proves that ADOP is more suitable than ${\textrm{P}_{\textrm{s,IB}}}$ as a PAR threshold.

5.2.2 L2/B2/E5b-based R-ratio test

In this section, the same values were used for $\mu$ as those in Section 5.1.2; here, the success rate refers to ${\textrm{P}_{\textrm{s,R}}}$. The R-ratio test results of L-DF, ACSS2-SF2, and ACPAR-DF2 are presented in Table 5 and Figure 13.

Table 5. R-ratio test results of different models

Figure 13. Ratio values of different models

Table 5 and Figure 13 show that in terms of the ratio, ${\textrm{P}_{\textrm{a,R}}}$, ${\textrm{P}_{\textrm{sf,R}}}$, and ${\textrm{P}_{\textrm{fa,R}}}$, the relationships between ACSS2-SF2, ACPAR-DF2, and L-DF are the same as those in Section 5.1.2. Hence, in terms of ${\textrm{P}_{\textrm{s,R}}}$ and the above-mentioned aspects, the same conclusions as those in Section 5.1.2 can be drawn in this section with some changes. The maximum difference of ${\textrm{P}_{\textrm{a,R}}}$ between ACSS-SF2 and L-DF was around 42.6% and that between ACSS-SF2 and ACPAR-DF2 was around 6⋅4%. For ${\textrm{P}_{\textrm{fa,R}}}$, the maximum differences between ACSS-SF2 and L-DF and between ACPAR-DF2 and ACSS-SF2 were around 42⋅5% and 6.5%, respectively. Further, ${\textrm{P}_{\textrm{a,R}}}$, ${\textrm{P}_{\textrm{s,R}}}$, and ${\textrm{P}_{\textrm{fa,R}}}$ of ACPAR could reach 99⋅79%, 99⋅79%, and 0⋅21%, respectively.

Therefore, in terms of R-ratio-test-based ambiguity validation of L2/B2/E5b-based low-dynamic single-epoch positioning, ACPAR has the same advantages as the statistic positioning experiments in Section 5.1.2.

6. Conclusion

Owing to the wide applications of fast positioning, GNSS-based single-epoch positioning has long been a research hotspot. Although multi-GNSS can improve the success rate, its large number of visible satellites make positioning time-consuming. PAR can improve the efficiency of multi-GNSS by selecting partial ambiguities. However, the present PAR cannot simultaneously achieve fast and high-precision positioning with a high success rate. To address this issue, this paper proposed a novel PAR, i.e., ACPAR. The feasibility of ADOP as the PAR threshold was analysed theoretically. Further, ambiguity selection based on ACSS was proposed to determine the optimal ambiguity subset by rapidly and adaptively selecting the corresponding satellites satisfying $\textrm{ADO}{\textrm{P}^\textrm{G}}$. The following conclusions can be drawn from the static and low-dynamic single-epoch positioning results of ACPAR, ACSS, the classical PAR, and L-multi-GNSS:

  1. (a) ACPAR can achieve a higher success rate and more stable ADOP than the classical PAR with the same ${\textrm{P}_{\textrm{s,IB}}}$, which indicates that ADOP is more suitable than ${\textrm{P}_{\textrm{s,IB}}}$ as a threshold for determining the ambiguity subset; compared to ACSS, ACPAR can achieve a higher success rate and smaller ADOP with the same satellites and $\textrm{ADO}{\textrm{P}^\textrm{G}}$.

  2. (b) Similar to ACSS, ACPAR can achieve high positioning accuracy close to that of L-multi-GNSS and higher than that of the classical PAR with maximum differences of 0⋅3 and 2⋅4 cm, respectively. ACPAR outperforms the classical PAR and it improves the efficiency of L-multi-GNSS considerably. The improvements caused by single (dual) frequency-based ACPAR are greater than 54⋅9%/80⋅4% (42⋅0%/75⋅8%) when 14⋅4 (13⋅2) out of 24⋅4 single/dual-frequency L-multi-GNSS satellites are selected.

  3. (c) From the perspective of R-ratio-test-based ambiguity validation, ACPAR can improve the reliabilities of the carrier-phase-based integrity monitoring of L-multi-GNSS and ACSS: ACSS can improve ${\textrm{P}_{\textrm{a,R}}}$ and ${\textrm{P}_{\textrm{s,R}}}$ and reduce ${\textrm{P}_{\textrm{fa,R}}}$ of L-multi-GNSS by up to 43⋅7%, 43⋅7%, and 44⋅6%, respectively; ACPAR can further improve the corresponding results of ACSS by up to 11⋅0%, 11⋅0%, and 10⋅8%, respectively.

In the future, the large number of visible satellites in GPS, BDS, GLONASS, and Galileo will make positioning more time-consuming. By then, the advantages of ACPAR will be more obvious. Focus areas for further research include the mechanism of float ambiguity vector precision affecting the reliability of ambiguity validation and how to further improve the acceptance rate and reduce the false alarm rate of ACPAR.

Acknowledgments

The authors are very grateful for the comments and remarks of the reviewers who helped to improve the manuscript. This work was supported by the Fundamental Research Funds for the Central Universities (Grant No. 2019XKQYMS52).

References

An, P. (2007). A modification of Graham's algorithm for determining the convex hull of a finite planar set. Annales Mathematicae et Informaticae, 34, 38.Google Scholar
BeiDou Navigation Satellite System. (2021). BDS Ephemeris 2021-082. Available at: http://en.beidou.gov.cn/SYSTEMS/Ephemeris/ [Accessed 23 March 2021].Google Scholar
Brack, A. (2017). Reliable GPS+BDS RTK positioning with partial ambiguity resolution. GPS Solutions, 21, 10831092.CrossRefGoogle Scholar
Brack, A. and Christoph, G. (2014). Generalized integer aperture estimation for partial GNSS ambiguity fixing. Journal of Geodesy, 88, 479490.CrossRefGoogle Scholar
Deng, C., Tang, W., Liu, J. and Shi, C. (2014). Reliable single-epoch ambiguity resolution for short baselines using combined GPS/Beidou system. GPS Solutions, 18, 375386.CrossRefGoogle Scholar
European GNSS Service Centre. (2021). Constellation Information. Available at: https://www.gsc-europa.eu/system-service-status/constellation-information [Accessed 23 March 2021].Google Scholar
Feng, S., Ochieng, W., Moore, T., Hill, C. and Hide, C. (2009). Carrier phase-based integrity monitoring for high-accuracy positioning. GPS Solutions, 13, 1322.CrossRefGoogle Scholar
goGPS-project. (2021). goGPS_MATLAB. Available at: https://github.com/goGPS-Project/ [Accessed 23 March 2021].Google Scholar
GPS.GOV. (2021). Current and Future Satellite Generations. Available at: https://www.gps.gov/systems/gps/space/#generations [Accessed 23 March 2021].Google Scholar
Han, S. and Rizos, C. (1999). Single-epoch ambiguity resolution for real-time GPS attitude determination with the aid of one-dimensional optical fiber gyro. GPS Solutions, 3, 512.CrossRefGoogle Scholar
Lancaster, P. and Tismenetsky, M. (1985). The Theory of Matrices with Applications. San Diego: Academic Press.Google Scholar
Li, J., Yang, Y., Xu, J., He, H. and Gou, H. (2015). GNSS multi-carrier fast partial ambiguity resolution strategy tested with real BDS/GPS dual- and triple-frequency observations. GPS Solutions, 19, 513.CrossRefGoogle Scholar
Liu, X., Chen, G., Zhang, Q. and Zhang, S. (2017). Improved single-epoch single-frequency PAR LAMBDA algorithm with baseline constraints for the BeiDou navigation satellite system. IET Radar, Sonar & Navigation, 11, 15491557.CrossRefGoogle Scholar
Liu, X., Zhang, S., Zhang, Q., Ding, N. and Yang, W. (2019). A fast satellite selection algorithm with floating high cut-off elevation angle based on ADOP for instantaneous multi-GNSS single-frequency relative positioning. Advances in Space Research, 63, 12341252.CrossRefGoogle Scholar
Liu, X., Zhang, S., Zhang, Q., Zheng, N., Zhang, W. and Ding, N. (2021). Theoretical analysis of the multi-GNSS contribution to partial ambiguity estimation and R-ratio test-based ambiguity validation. GPS Solutions, 25, 52.CrossRefGoogle Scholar
Mowlam, A. (2004). Baseline Precision Results Using Triple Frequency Partial Ambiguity Sets. Proceedings of the 17th International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS 2004), Long Beach, CA.Google Scholar
Odijk, D. and Teunissen, P. (2008). ADOP in closed form for a hierarchy of multi-frequency single-baseline GNSS models. Journal of Geodesy, 82, 473492.CrossRefGoogle Scholar
Odolinski, R. and Teunissen, P. (2016). Single-frequency, dual-GNSS versus dual-frequency, single-GNSS: A low-cost and high-grade receivers GPS-BDS RTK analysis. Journal of Geodesy, 90, 12551278.CrossRefGoogle Scholar
Odolinski, R., Teunissen, P. and Odijk, D. (2013). An Analysis of Combined COMPASS/BeiDou-2 and GPS Single- and Multiple-Frequency RTK Positioning. Proceedings of the ION 2013 Pacific PNT Meeting, Honolulu, Hawaii.Google Scholar
Odolinski, R., Teunissen, P. and Odijk, D. (2015). Combined BDS, Galileo, QZSS and GPS single-frequency RTK. GPS Solutions, 19, 151163.CrossRefGoogle Scholar
Parkins, A. (2011). Increasing GNSS RTK availability with a new single-epoch batch partial ambiguity resolution algorithm. GPS Solutions, 15, 391402.CrossRefGoogle Scholar
Phillips, A. (1984). Geometrical determination of PDOP. Navigation, 31, 329337.CrossRefGoogle Scholar
Takasu, T. and Yasuda, A. (2010). Kalman-filter-based integer ambiguity resolution strategy for long-baseline RTK with ionosphere and troposphere estimation. Proceedings of the 23rd International Technical Meeting of the Satellite Division of the Institute of Navigation (ION GNSS 2010), Portland, OR.Google Scholar
Teunissen, P. (1995). The least-squares ambiguity decorrelation adjustment: A method for fast GPS integer ambiguity estimation. Journal of Geodesy, 70, 6582.CrossRefGoogle Scholar
Teunissen, P. (1997). A canonical theory for short GPS baselines. Part IV: Precision versus reliability. Journal of Geodesy, 71, 513525.CrossRefGoogle Scholar
Teunissen, P., Joosten, P. and Tiberius, C. (1999). Geometry-free Ambiguity Success Rates in Case of Partial Fixing. Proceedings of the 1999 National Technical Meeting of the Institute of Navigation, San Diego, CA.Google Scholar
Teunissen, P., Odolinski, R. and Odijk, D. (2014). Instantaneous BeiDou + GPS RTK positioning with high cut-off elevation angles. Journal of Geodesy, 88, 335350.CrossRefGoogle Scholar
Verhagen, S. (2003). On the approximation of the integer least-squares success rate: Which lower or upper bound to use? Journal of Global Position Systems, 2, 117124.CrossRefGoogle Scholar
Verhagen, S. and Teunissen, P. (2006). New global navigation satellite system ambiguity resolution method compared to existing approaches. Journal of Guidance, Control, and Dynamics, 29, 981991.CrossRefGoogle Scholar
Verhagen, S. and Teunissen, P. (2013). The ratio test for future GNSS ambiguity resolution. GPS Solutions, 17, 535548.CrossRefGoogle Scholar
Verhagen, S., Teunissen, P., Marel, H. and Li, B. (2011). GNSS Ambiguity Resolution: Which Subset to Fix. Proceedings of International Global Navigation Satellite Systems Society, IGNSS Symposium 2011, Sydney, NSW, Australia.Google Scholar
Yang, Y., Li, J., Xu, J., Tang, J., Guo, H. and He, H. (2011). Contribution of the compass satellite navigation system to global PNT users. Chinese Science Bulletin, 56, 28132819.CrossRefGoogle Scholar
Yi, T., Li, H. and Gu, M. (2013). Experimental assessment of high-rate GPS receivers for deformation monitoring of bridge. Measurement, 46, 420432.CrossRefGoogle Scholar
Zaminpardaz, S., Teunissen, P. and Nadarajah, N. (2017). GLONASS CDMA l3 ambiguity resolution and positioning. GPS Solutions, 21, 535549.CrossRefGoogle Scholar
Figure 0

Figure 1. Graham's scan algorithm for a convex hull

Figure 1

Figure 2. Convex-hull-based equipartition rotation method

Figure 2

Figure 3. Inscribed circle of a triangle with different radii

Figure 3

Figure 4. Flowchart of ACPAR

Figure 4

Table 1. Settings of different models

Figure 5

Table 2. Positioning results of different models

Figure 6

Figure 5. Number of satellites of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Figure 7

Figure 6. ADOP of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Figure 8

Figure 7. ENU deviations of (a) ACPAR-DF1, (b) CPAR-DF1, and (c) L-SF1, (d) L-DF

Figure 9

Figure 8. ENU deviations of (a) ACPAR-DF2, (b) CPAR-DF2, and (c) L-SF2

Figure 10

Figure 9. Ratio values of different models based on (a) L1/B1/E1 and (b) L2/B2/E5b

Figure 11

Table 3. R-ratio test results of different models

Figure 12

Figure 10. (a) Experimental device and (b) movement trajectory

Figure 13

Table 4. Positioning results of different models

Figure 14

Figure 11. (a) Number of satellites and (b) ADOP of different models

Figure 15

Figure 12. ENU deviations of (a) ACPAR-DF2, (b) CPAR-DF2, and (c) L-DF

Figure 16

Table 5. R-ratio test results of different models

Figure 17

Figure 13. Ratio values of different models