Within this 23-record dataset, the leading assignee holds 3 records, and the top 5 of 20 ranked assignees together hold 14 records, or 60.9% of the field. The leaders include Chinese positioning-service providers, a major telecom equipment maker, and a US survey-equipment incumbent. Below the top 10, which together reach 91.3% of records, the remaining assignees hold a single record each, so concentration is heavy at the top with a thin long tail beneath it.

Network RTK uses a network of reference stations to generate correction data that lets a rover receiver achieve centimetre-level positioning accuracy, rather than relying on a single base station. It shows up heavily in this dataset because the search scope specifically targets claims on reference station networks, correction broadcast and PPP-RTK convergence, all of which are network RTK's core technical problems. The representative record in this landscape, Huawei's method for updating a network RTK reference station network, is a direct example of this claim type.

Not clearly. Filings in this dataset ran at 2 in 2017, sat at 2 by the 2022 midpoint, peaked at 4 in 2024, and fell to 1 in the still-partial 2026 year. Recent-year momentum tracked by assignee shows zero filings in the latest year for every leading name, though publication lag of roughly 18 months means the most recent year always understates true activity. The overall shape reads as flat to declining rather than accelerating.

The clearest gap sits between positioning claims and wireless-delivery claims: G01S (positioning) covers 100.0% of the 23 records in scope, while H04W (wireless communication networks) appears in only 13.0% and G01B (length measurement) in just 4.3%. That imbalance suggests correction-broadcast protocols, PPP-RTK convergence acceleration and cross-domain integration with wireless network claims are comparatively under-claimed relative to core positioning inventions. A first claim there would likely combine an augmentation correction step with a specific wireless transport or scheduling mechanism, rather than restating a positioning algorithm alone.

US10834660B2 claims a method for updating a network RTK reference station network when a new node is added: it determines the new node's position relative to existing nodes, selects target nodes under a preset rule, identifies nodes connected to those targets, and reconstructs the network topology using a Delaunay triangulation approach. This blocks straightforward implementations of dynamic reference-network reconfiguration that follow the same node-selection-and-triangulation sequence. Designing around it generally means using a different topology-update rule, such as a distance-threshold or clustering method instead of Delaunay triangulation, or updating the network at fixed intervals rather than reactively on node addition.