Hierarchical Navigation Database Link Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation systems are unable to efficiently determine an optimal route between a starting point and a destination due to their reliance on exploring all links on routing levels and using heuristics, which results in lengthy computation times and suboptimal route calculations.
Innovation Solution
The navigation database is compiled by organizing links into layers based on their position relative to higher-level tiles, allowing for the propagation of minor links to higher levels and connection across tile borders, reducing the number of links explored and improving runtime by calculating optimal routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If all links on routing levels are explored to determine the optimal route, then route accuracy is improved, but computation time increases significantly
Solution Approach 1:
The navigation database is segmented into a hierarchical multi-level structure where links are organized into different routing levels based on their importance and geographic scope. This segmentation allows the system to explore only relevant links at appropriate levels rather than all links, significantly reducing computation time while maintaining route accuracy for optimal path determination.
Solution Approach 2:
The patent introduces a hierarchical dimension to the routing structure by organizing links into multiple levels (e.g., local, regional, national levels). This dimensional organization enables the system to navigate through levels strategically, exploring links only when necessary, thereby reducing the search space and computation time while still guaranteeing optimal route calculation.
2Productivity
If a hierarchical graph structure with multiple levels is used, then route calculation speed is improved, but database complexity increases
Solution Approach 1:
The database is segmented into a hierarchical structure with multiple routing levels, where each level contains links appropriate to its geographic and functional scope. This segmentation improves route calculation speed by enabling strategic exploration at different levels, while the structured organization manages complexity through clear hierarchical relationships and defined level transitions.
3Loss of time
If heuristics are used to determine when to switch routing levels, then computation time is reduced, but route optimality is compromised
Solution Approach 1:
The system dynamically adjusts the routing level based on real-time exploration progress and geographic context rather than using static heuristics. The level switching is determined by dynamic conditions such as current position, destination, and explored links, allowing the system to maintain route optimality while adapting the exploration strategy to reduce computation time for each specific query.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A database for providing an optimal route may be provided. First and second levels of a navigation database may be defined. The first level is divided into a plurality of first tiles. The second level is divided into a plurality of second tiles that are larger than the first tiles. A plurality of link data records may be stored in the first level. The plurality of link data records are representative of a plurality of road segments in a geographic region. One or more link data records of the plurality of link data records to be stored in the second level may be determined. The determining is based on a position of the plurality of link data records relative to the plurality of second tiles. The determined one or more link data records may be stored in the second level.