CALCULATION METHOD FOR NETWORK-SPECIFIC FACTORS IN A NETWORK OF REFERENCE STATIONS FOR A SATELLITE-BASED POSITIONING SYSTEM
1 Assignment
0 Petitions
Accused Products
Abstract
A correction calculation method for a satellite based positioning system with a network of receiving units as reference stations comprises a partitioning of the network into groups of reference stations, calculation of group-specific correction factors, amalgamation of the group-specific correction factors and subsequently, derivation of network-specific correction parameters. In this partitioning, the reference stations are represented by nodes in a connected, edge-weighted graph, in the generation of which an edge respectively connecting two nodes is only generated if it satisfies a distance-dependent connectivity condition, whereby the distance between the nodes connected by this edge is input into the weighting function of this edge. From the graph a minimum spanning tree is derived and subsequently partitioned for establishing the groups, by eliminating the edge with the highest weight for each tree, the elimination of which leads to partial trees which in each case either satisfy a cardinality condition for the number of the nodes in the two resulting partial trees, or consist of a number of nodes greater than the cardinality condition.
12 Citations
22 Claims
-
1-10. -10. (canceled)
-
11. A correction calculation method for a satellite-based positioning system including a network of receiving units as reference stations, the method comprising:
-
partitioning the network into groups of reference stations; calculating group-specific correction variables; combining the group-specific correction variables; and deriving network-specific correction parameters, wherein during partitioning; the reference stations are represented by nodes in a cohesive, edge-weighted graph, in the generation of which the removal of the nodes connected by this edge being input into the weighting function; a minimum spanning tree is derived from the graph; and the minimum spanning tree is partitioned for establishing the groups by eliminating from a tree in each case the edge which has the highest weight and the elimination of which leads to partial trees which in each case either; satisfy a cardinality condition for the number of nodes having a lower limit nmin and an upper limit nmax in both the resulting partial trees;
orhave a number of nodes which is greater than the cardinality condition. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
Specification