Recent Developments in Precise Point Positioning

GEOMATICA ◽  
2012 ◽  
Vol 66 (2) ◽  
pp. 103-111 ◽  
Author(s):  
S. Bisnath ◽  
P. Collins

In standard Precise Point Positioning (PPP), the carrier phase ambiguities are estimated as real-valued constants, so that the carrier-phases can provide similar information as the pseudoranges. As a consequence, it can take tens of minutes to several hours for the ambiguities to converge to suitably precise values. Recently, new processing methods have been identified that permit the ambiguities to be estimated more appropriately as integer-valued constants, as they are in relative Real-Time Kinematic (RTK) positioning. Under these conditions, standard ambiguity resolution techniques can be applied to strengthen the PPP solution. The result can be a greatly reduced solution convergence and re-convergence period, representing a significant step toward improving the performance of PPP with respect to that of RTK processing. This paper describes the underlying principles of the method, why the enhancements work, and presents some results.

2011 ◽  
Vol 47 (10) ◽  
pp. 1664-1673 ◽  
Author(s):  
J. Geng ◽  
F.N. Teferle ◽  
X. Meng ◽  
A.H. Dodson

2015 ◽  
Vol 5 (1) ◽  
pp. 53-60 ◽  
Author(s):  
S. Nistor ◽  
A. S. Buda

Abstract Because of the dynamics of the GPS technique used in different domains like geodesy, near real-time GPS meteorology, geodynamics, the precise point positioning (PPP) becomes more than a powerful method for determining the position, or the delay caused by the atmosphere. The main idea of this method is that we need only one receiver – preferably that have dual frequencies pseudorange and carrier-phase capabilities – to obtain the position. Because we are using only one receiver the majority of the residuals that are eliminated in double differencing method, we have to estimate them in PPP. The development of the PPP method allows us, to use precise satellite clock estimates, and precise orbits, resulting in a much more efficient way to deal with the disadvantages of this technique, like slow convergence time, or ambiguity resolution. Because this two problem are correlated, to achieve fast convergence we need to resolve the problem of ambiguity resolution. But the accuracy of the PPP results are directly influenced by presence of the uncalibrated phase delays (UPD) originating in the receivers and satellites. In this article we present the GPS errors and biases, the zenith wet delay and the necessary time for obtaining the convergence. The necessary correction are downloaded by using the IGS service.


Measurement ◽  
2017 ◽  
Vol 100 ◽  
pp. 183-193 ◽  
Author(s):  
Raquel M. Capilla ◽  
José Luis Berné-Valero ◽  
Antonio Hermosilla-Rodrigo

Sensors ◽  
2020 ◽  
Vol 20 (11) ◽  
pp. 3220
Author(s):  
Honglei Qin ◽  
Peng Liu ◽  
Li Cong ◽  
Xia Xue

Although precise point positioning (PPP) is a well-established and promising technique with the use of precise satellite orbit and clock products, it costs a long convergence time to reach a centimeter-level positioning accuracy. The PPP with ambiguity resolution (PPP-AR) technique can improve convergence performance by resolving ambiguities after separating the fractional cycle bias (FCB). Now the FCB estimation is mainly realized by the regional or global operating reference station network. However, it does not work well in the areas where network resources are scarce. The contribution of this paper is to realize an ambiguity residual constraint-based PPP with partial ambiguity resolution (PPP-PARC) under no real-time network corrections to speed up the convergence, especially when the performance of the float solution is poor. More specifically, the update strategy of FCB estimation in a stand-alone receiver is proposed to realize the PPP-PAR. Thereafter, the solving process of FCB in a stand-alone receiver is summarized. Meanwhile, the influencing factors of the ambiguity success rate in the PPP-PAR without network corrections are analyzed. Meanwhile, the ambiguity residual constraint is added to adapt the particularity of the partial ambiguity-fixing without network corrections. Moreover, the positioning experiments with raw observation data at the Global Positioning System (GPS) globally distributed reference stations are conducted to determine the ambiguity residual threshold for post-processing and real-time scenarios. Finally, the positioning performance was verified by 22 GPS reference stations. The results show that convergence time is reduced by 15.8% and 26.4% in post-processing and real-time scenarios, respectively, when the float solution is unstable, compared with PPP using a float solution. However, if the float solution is stable, the PPP-PARC method has performance similar to the float solution. The method shows the significance of the PPP-PARC for future PPP applications in areas where network resource is deficient.


2014 ◽  
Vol 52 (10) ◽  
pp. 6165-6180 ◽  
Author(s):  
Xingxing Li ◽  
Maorong Ge ◽  
Cuixian Lu ◽  
Yong Zhang ◽  
Rongjiang Wang ◽  
...  

2020 ◽  
Vol 66 (4) ◽  
pp. 810-825 ◽  
Author(s):  
Tianjun Liu ◽  
Weiping Jiang ◽  
Denis Laurichesse ◽  
Hua Chen ◽  
Xuexi Liu ◽  
...  

Author(s):  
A. A. Povalyaev ◽  
◽  
A. A. Baburin ◽  
A. A. Podkorytov ◽  
◽  
...  

The paper considers the use of the lattice packing theory for Integer Precise Point Positioning (Integer PPP) with the errors usually not exceeding 1–3 cm based on GNSS signals with code division multiple access (CDMA). Positioning is carried out by processing ionosphere-free linear combinations of code and phase measurements with ambiguity resolution employing satellite corrections. The main issue of PPP algorithms is overcoming the rank deficiency problem of the linear equation system obtained by linearization of nonlinear mathematical models of measurements. Nowadays Float PPP is quite well developed, where rank deficiency is tackled by combining systematic biases in measurement models with integer carrier phase ambiguities. As a result, the number of unknowns is reduced to the rank of design matrix, which allows unambiguous estimation of precise user coordinates and values of new variables generated by the performed combinations. However, under such conditions the information about integer nature of carrier phase ambiguities is lost, and this leads to a significant increase in convergence time to obtain user coordinates estimates with the errors of 1–3 cm. It is possible to involve the information on the integer nature of phase ambiguities into processing by applying ambiguity resolution algorithms. Though, as a result of the conducted combinations, the integer nature is destroyed, which makes it impossible to apply these algorithms. In Integer PPP rank deficiency is overcome by projecting the state space of the initial linear equation system onto a so-called S-space, whose dimension is equal to the rank of this system. The orientation of the S-space and the direction of projecting are chosen so that the variables of the initial system corresponding to user coordinates are not changed during the projecting and the projections of integer variables remain integer. This makes it possible to estimate precise user coordinates involving information on the integer nature of phase ambiguities. In the literature on Integer PPP based on CDMA GNSS signals processing the description of the S-space orientation with the desired properties is given, but there is no description of the method to determine this orientation. This paper based on the notions of the lattice packing theory considers an algorithm for determining the S-space with the desired properties. It is shown that there exists an infinite set of such S-spaces connected by unimodular transformations, and a technique is proposed to enable selection from this set the S-space, which requires minimal computational cost. The use of the lattice packing theory to the Integer PPP network solution with CDMA GNSS signals will be considered in the following publication of the authors.


Sign in / Sign up

Export Citation Format

Share Document