The presence of None-line-of-sight (NLOS) is one of the major challenging issues in time of arrival (TOA) based source localization, especially for the sparse anchor scenarios. Sparse anchors can reduce the system deployment cost, so this has become increasingly popular in the source location. However, fewer anchors bring new challenges to ensure localization precision and reliability, especially in NLOS environments. The maximum likelihood (ML) estimation is the most popular location estimator for its simplicity and efficiency, while it becomes extremely difficult to reliably identify the NLOS measurements when the redundant observations are not enough. In this study, we proposed an NLOS detection algorithm called misclosure check (MC) to overcome this issue, which intends to provide a more reliable location in the sparse anchor environment. The MC algorithm checks the misclosure of different triangles and then obtains the possible NLOS from these misclosures. By forming multiple misclosure conditions, the MC algorithm can identify NLOS measurements reliably, even in a sparse anchor environment. The performance of the MC algorithm is evaluated in a typical sparse anchor environment and the results indicate that the MC algorithm achieves promising NLOS identification capacity without abundant redundant measurements. The real data test also confirmed that the MC algorithm achieves better position precision than other three robust location estimators in an NLOS environment since it can correctly identify more NLOS measurements.

Global navigation satellite system (GNSS) integer ambiguity acceptance test is one of the open problems in GNSS data processing. A number of ambiguity acceptance tests have been proposed from different perspectives and then unified into the integer aperture estimation framework. The existing comparative studies indicate that the impact of test statistics form on the test performance is less critical, while how to construct an efficient, practical test threshold is still challenging. Based on the likelihood ratio test theory, a new computationally efficient ambiguity acceptance test with controllable success fix rate, namely the fixed likelihood ratio (FL-) approach is proposed, which does not require Monte Carlo simulation. The study indicates that the fixed failure rate (FF-) approach can only control the overall failure rate of the acceptance region, but the local failure rate is not controllable. The proposed FL-approach only accepts the fixed solution meeting the likelihood ratio requirement. With properly chosen likelihood ratio threshold, the FL-approach achieves comparable success rate as the FF-approach and even lower failure rate than the FF-approach for the strong underlying model cases. The fixed success fix rate of the FL-approach is verified with both simulation data and real GNSS data. The numerical results indicate that the success fix rate of the FL-approach achieves >98% while the failure rate is <1.5%. The real-time kinematic (RTK) positioning with ambiguities tested by the FL-approach achieved 1–2cm horizontal precision and 2–4 cm vertical precision for all tested baselines, which confirms that the FL-approach can serve as a reliable and efficient threshold determination method for the GNSS ambiguity acceptance test problem.

The network real-time kinematic (RTK) technique can provide centimeter-level real time positioning solutions and play a key role in geo-spatial infrastructure. With ever-increasing popularity, network RTK systems will face issues in the support of large numbers of concurrent users. In the past, high-precision positioning services were oriented towards professionals and only supported a few concurrent users. Currently, precise positioning provides a spatial foundation for artificial intelligence (AI), and countless smart devices (autonomous cars, unmanned aerial-vehicles (UAVs), robotic equipment, etc.) require precise positioning services. Therefore, the development of approaches to support large-scale network RTK systems is urgent. In this study, we proposed a self-organizing spatial clustering (SOSC) approach which automatically clusters online users to reduce the computational load on the network RTK system server side. The experimental results indicate that both the SOSC algorithm and the grid algorithm can reduce the computational load efficiently, while the SOSC algorithm gives a more elastic and adaptive clustering solution with different datasets. The SOSC algorithm determines the cluster number and the mean distance to cluster center (MDTCC) according to the data set, while the grid approaches are all predefined. The side-effects of clustering algorithms on the user side are analyzed with real global navigation satellite system (GNSS) data sets. The experimental results indicate that 10 km can be safely used as the cluster radius threshold for the SOSC algorithm without significantly reducing the positioning precision and reliability on the user side.

In Global navigation satellite system (GNSS) data processing, integer ambiguity acceptance test is considered as a challenging problem. A number of ambiguity acceptance tests have been proposed from different perspective and then unified into the integer aperture estimation (IA) framework. Among all the IA estimators, the optimal integer aperture (OIA) achieves the highest success rate with the fixed failure rate tolerance. However, the OIA is of less practical appealing due to its high computation complexity. On the other hand, the popular discrimination tests employ only two integer candidates, which are the essential reason for their sub-optimality. In this study, a generalized difference test (GDT) is proposed to exploit the benefit of including three or more integer candidates to improve their performance from theoretical perspective. The simulation results indicate that the third best integer candidates contribute to more than 70% success rate improvement for integer bootstrapping success rate higher than 0.8 case. Therefore, the GDT with three integer candidates (GDT3) achieves a good trade-off between the performance and computation burden. The threshold function is also applied for rapid determination of the fixed failure rate (FF)-threshold for GDT3. The performance improvement of GDT3 is validated with real GNSS data set. The numerical results indicate that GDT3 achieves higher empirical success rate while the empirical failure rate remains comparable. In a 20 km baseline test, the success rate GDT3 increase 7% with almost the same empirical failure rate.