Network RTK Reference Station Updating via Delaunay Triangulation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for updating Network Real-Time Kinematic (NRTK) reference station networks are inefficient, particularly when new stations are added or faulty stations need to be deleted, as they often require complex global network reconstruction and resource wastage.
Innovation Solution
Implementing a visualized multi-tree structure based on the position relationship between new or faulty stations and the existing network, using Delaunay triangulated network construction to perform local network updates, and employing interpolation for initial parameter calculation to ensure continuous service.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If global network construction is performed when a new reference station is added, then the reference station network can be updated, but resources are wasted
Solution Approach 1:
The patent divides the reference station network into multiple triangular areas formed by adjacent reference stations. When a new station is added, only the triangular areas that may be affected are identified and updated, rather than performing global network construction. This segmentation allows selective updating of only the necessary portions of the network, reducing computational resource waste while maintaining update completeness.
2Reliability
If Delaunay network construction is re-performed on all stations when a new station is added outside the network, then the network can be updated, but the process is complex
Solution Approach 1:
The patent applies local quality by determining the position relationship between the new reference station and existing triangular areas, then selectively performing Delaunay network construction only on affected triangular areas. Instead of uniformly re-performing construction on all stations, the method identifies and processes only the local regions that require updates based on the new station's position, simplifying the overall process while maintaining accuracy.
3Productivity
If circumcircle determination is performed to select network reconstruction range, then the reconstruction can be targeted, but the process is relatively complex
Solution Approach 1:
The patent extracts the essential geometric relationship by using the circumcircle property of triangular areas to determine whether a new reference station falls within a triangle's coverage area. By leveraging this geometric property, the method efficiently identifies affected triangular areas without requiring complex multi-step calculations, thus improving update efficiency while keeping the process relatively simple.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
Embodiments of this application disclose a method and an apparatus for updating a network RTK reference station network. The method includes: if there is a newly added node in a current reference station network, determining a position relationship between the newly added node and each node in the current reference station network; determining N target nodes in the current reference station network according to a preset rule based on the position relationship; determining, based on the N target nodes, M nodes connected to each of the N target nodes, where the M nodes belong to the current reference station network; and performing network construction on the M nodes and the newly added node according to a Delaunay triangulated network construction rule, where M is a positive integer and N is a positive integer. According to the method and the apparatus for updating a network RTK reference station network provided in the embodiments of this application, fast networking can be implemented and efficiency can be improved.