HD Map Route Translation Through Graph-Based Waypoint Alignment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Autonomous vehicles face challenges in navigating with high-definition (HD) map data due to synchronization issues with navigational maps, leading to potential obstacles and collision risks, as HD maps and navigational maps may not be precisely aligned, and may not cover the same geographic locations.
Innovation Solution
A method is disclosed to translate route information between data structures by generating a graph from HD map data, selecting nodes and edges that correspond to waypoints from navigational maps, and using a matching algorithm to align routes, enabling precise navigation and reduced computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If HD map data is used for autonomous vehicle navigation, then navigation precision is improved, but synchronization issues with navigational maps cause misalignment and collision risks
Solution Approach 1:
The patent introduces a graph data structure as an intermediary representation that bridges HD map data and navigational map waypoints. The graph nodes represent locations and edges represent paths, serving as a common language that both map types can be translated into, thereby resolving the synchronization and alignment issues between the two different map representations
Solution Approach 2:
The patent transforms route information between different data structures by changing the parameters and format of representation. HD map data is converted into graph-based path representations, and navigational waypoints are translated into corresponding graph nodes and edges, enabling precise matching and alignment through parameter transformation rather than direct comparison
2Reliability
If HD map data with high precision is used, then collision risks are reduced, but computational overhead increases
Solution Approach 1:
The patent segments the continuous HD map data into discrete graph nodes and edges, and divides the navigation problem into matching waypoints to specific graph nodes. This segmentation reduces the computational complexity by transforming a continuous space problem into a discrete graph matching problem, while maintaining collision avoidance capability through precise node-based positioning
3Measurement precision
If complete route matching between HD maps and navigational maps is performed, then navigation accuracy is improved, but processing time increases
Solution Approach 1:
The patent performs preliminary translation of HD map data into graph representations before actual navigation occurs. By pre-processing the map data into a structured graph format with nodes and edges, the system eliminates the need for complex real-time matching during navigation, significantly reducing processing time while maintaining route alignment accuracy
Data Source
AI summary
Embodiments of the present disclosure relate to a method of translating routes between maps. The method may include obtaining a graph based on data of an area. The graph may include one or more nodes representing different locations along one or more navigable paths as defined by the map. The method may also include obtaining one or more waypoints that define a route to traverse in the area and selecting, from the nodes, one or more path nodes based on locations of the path nodes corresponding to locations of the way points. The selected path nodes may define a path in the data that corresponds to the route.