Navigation Devices Core Network Route Planning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current route planning methods using electronic maps are time-consuming due to the complexity of processing large map data sets, which include numerous navigable segments, and existing acceleration techniques are inefficient for larger map sizes.
Innovation Solution
A method that reduces the number of navigable segments by forming a core network, categorizes segments into hierarchical regions, and uses time-varying functions to determine minimum cost routes, generating search acceleration data to accelerate route planning.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If route planning is performed using complete electronic map data with all navigable segments, then route accuracy is maintained, but processing time increases significantly
Solution Approach 1:
The patent applies segmentation by dividing the electronic map into a core network of important navigable segments and a set of less important segments. The routing algorithm processes only the core network segments, which are segmented based on their importance to route planning. This segmentation allows the system to maintain route accuracy by preserving all critical routing paths while eliminating unnecessary processing of non-essential segments, thereby resolving the contradiction between maintaining completeness and reducing processing time.
Solution Approach 2:
The patent extracts and removes navigable segments from the complete map data to form a reduced core network. By taking out only the essential segments needed for accurate route planning and excluding redundant segments, the system achieves faster processing while maintaining routing accuracy. This extraction process directly addresses the contradiction by separating necessary data from unnecessary data.
2Adaptability or versatility
If all navigable segments are processed in route planning, then complete route options are considered, but memory footprint increases
Solution Approach 1:
The patent extracts only the essential navigable segments required for complete route planning from the full map data, creating a compact core network representation. This extraction maintains the ability to consider all necessary route options by preserving critical connectivity information while removing redundant segments that consume memory. The result is a reduced data structure that fits in available memory while preserving route planning completeness.
Solution Approach 2:
Instead of starting with complete map data and trying to include everything needed for routing, the patent inverts the approach by starting with an empty core network and selectively adding only the essential segments required for complete route planning. This inverted construction method ensures that memory footprint is minimized while still achieving route option completeness, as only necessary segments are retained.
Data Source
AI summary
A method of creating map data including search acceleration data arranged to increase the speed at which a route can be planned across an electronic map comprising a plurality of navigable segments, each navigable segment representing a segment of a navigable route in the area covered by the map, wherein the method comprises:a) reducing the number of navigable segments to be considered in the creation of the search acceleration data by removing navigable segments to form a core network of navigable segments;b) dividing the electronic map into a set of hierarchical regions such that the or each navigable segment is categorized into at least one region in each level of the hierarchy;c) using a time varying function associated with at least some, and generally each, navigable segment of the core network to determine whether that navigable segment is part of minimum cost route to at least one of the regions and recording this determination in the search acceleration data.