Road Graph Merging via Edge Scoring and Node Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing map tiling systems face challenges in accurately merging adjacent road graphs due to computational constraints, requiring precise and efficient merging of road graphs created from small images to cover wide areas.
Innovation Solution
A computer-implemented method for merging road graphs involves selecting overlapping edges and nodes, scoring edges based on distance and length, and determining node mergability to ensure accurate merging, with parallel processing enabling efficient combination of road graphs over large areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If road graphs are merged from small images to cover wide areas, then the coverage area is improved, but the merging accuracy deteriorates due to computational constraints
Solution Approach 1:
The patent divides the large-area road graph merging task into smaller sub-tasks by processing overlapping regions between adjacent images. Each overlapping region is handled independently with focused attention on edge and node matching, allowing high precision in each segment while covering large areas collectively.
Solution Approach 2:
The patent applies different processing strategies to different parts of the road graph based on their characteristics. Overlapping regions receive specialized handling with edge scoring and node merging operations, while non-overlapping regions are processed differently. This localized approach ensures high merging accuracy in critical overlap zones.
2Manufacturing precision
If detailed edge and node processing is performed to improve merging accuracy, then the merging precision is improved, but the computational time increases
Solution Approach 1:
The patent performs detailed processing only where necessary - specifically in overlapping regions between adjacent road graphs. Non-overlapping regions are processed more simply. This partial application of detailed processing maintains high merging accuracy in critical areas while reducing overall computational time.
Solution Approach 2:
The patent uses scoring mechanisms that assign different weights to edge attributes (distance, length, orientation) based on their importance for merging accuracy. By dynamically adjusting which parameters are emphasized in different contexts, the system achieves high accuracy without uniformly applying computationally expensive processing to all edges.
3Manufacturing precision
If multiple edges and nodes are processed individually to ensure accurate merging, then the merging precision is improved, but the device complexity increases
Solution Approach 1:
The patent combines multiple processing operations into unified algorithms. Edge scoring integrates distance, length, and orientation considerations into a single scoring mechanism. Node merging operations are consolidated into systematic procedures that handle multiple nodes through standardized processes, reducing overall system complexity while maintaining precision.
Solution Approach 2:
The patent creates universal processing routines that handle different types of edges and nodes through the same fundamental algorithms. The edge scoring function works consistently across all overlapping regions, and the node merging process follows a unified approach, reducing the need for multiple specialized processing components.
Data Source
AI summary
A computer-implemented method for merging a first road graph corresponding to a first area and a second road graph corresponding to a second area that partially overlaps with the first area, the method comprising: a selection step of selecting one edge from a plurality of edges overlapping each other in the first road graph and the second road graph and deleting non-selected edge; and a merging step of determine whether or not to merge a first node, that is a node connected to the deleted edges, and in response to determination to merge the first node, selecting a second node to be merged with the first node, and merge the first node and the second node.