Navigation Path Data Decoding via Topological Link Expansion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation systems face inefficiencies in encoding and decoding spatial data, particularly in transferring detailed spatial information efficiently and accurately, especially with limited computational resources.
Innovation Solution
A computer-implemented method and apparatus for decoding path data using a start identifier, link count, and exit numbers, which iteratively expands paths in a navigation database, reducing data size and computational resources required, and providing precise location referencing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If spatial information is encoded using traditional methods (TMC or OpenLR), then location referencing can be achieved, but the data size increases and computational resources are consumed
Solution Approach 1:
The path is segmented into a sequence of road links, where each link is identified by a unique identifier. Instead of encoding the entire path as a single complex spatial reference, the path is broken down into discrete, manageable segments (road links) that can be efficiently encoded and transmitted. This segmentation allows for compact representation while maintaining detailed spatial information.
Solution Approach 2:
The patent transitions from encoding spatial information in traditional coordinate-based dimensions to a topological dimension based on road network structure. By representing locations as sequences of road link identifiers rather than coordinates, the system achieves more efficient encoding. The exit numbers add another dimension by specifying which road to take at junctions, creating a multi-dimensional encoding scheme that is more compact than traditional methods.
2Measurement precision
If detailed spatial information is transferred with high precision, then location referencing accuracy improves, but computational resources required increase
Solution Approach 1:
The navigation database itself is used to decode the path data. The system leverages its own internal road network data structure to interpret the encoded path, eliminating the need for separate, computationally intensive decoding algorithms. The database's inherent topological information about road links and junctions is directly utilized to reconstruct the path, making the decoding process efficient and self-contained.
Solution Approach 2:
The road network data is pre-processed and organized in the navigation database with road links and junctions already identified and numbered. This preliminary organization allows for efficient decoding of path data without requiring complex real-time computations. The exit numbers and road link identifiers are pre-established, enabling quick path reconstruction when navigation information is received.
3Reliability
If path data is decoded by searching for locations in the navigation database, then accurate path reconstruction is achieved, but decoding time and computational load increase
Solution Approach 1:
The path decoding process is segmented into iterative steps, where the path is built link by link rather than searching for the entire path at once. Each iteration extends the current path by one road link using the exit number to identify the next link. This step-by-step segmentation transforms a complex search problem into a series of simple, efficient lookups that can be quickly executed using the pre-organized database structure.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
The invention is directed to a computer-implemented method for decoding path data. The method comprises providing a navigation database for storing topological information of a road network. The navigation database comprises a plurality of road links, each road link having a start point and an end point, and a plurality of link nodes, each link node defining a topological connection between two or more of the road links and an order of the two or more connected road links. The method further comprises receiving path data indicative of a path within the road network, wherein the path data comprises a start identifier, a link count and at least one exit number. The method further comprises selecting, from the navigation database, one road link of the plurality of the road links as a start road link of the path based the start identifier. Moreover, the method comprises iteratively expanding the path with selected road links until the link count is equal to the number of road links of the path. An iteration of the expanding comprises determining whether more than one road link of the plurality of road links is connected to the selected road link based on the plurality of link nodes. An iteration of the expanding further comprises selecting one of the road links connected to the selected road link based on the at least one exit number and the order of connected road links, if more than one road link is connected to the selected road link. Furthermore, if exactly one road link is connected to the selected road link, an iteration of the expanding comprises selecting the exactly one connected road link.