Road Graph Extraction Using Longest Shortest-Path Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating road graphs from frame graphs are labor-intensive, time-consuming, resource-intensive, and prone to inaccuracies, particularly when dealing with complex road networks where roads are side-by-side or stacked.
Innovation Solution
A system and method that generates a road graph by identifying the longest path among shortest paths in a frame graph, using predetermined criteria to connect points and edges, and iteratively expanding a perimeter to include all relevant roadways, reducing resource and time consumption while enhancing accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional methods are used to process point maps into road graphs, then road network topology can be determined, but the process is labor-intensive, resource-intensive, and time-consuming
Solution Approach 1:
The patent replaces manual, mechanical processing methods with an automated computational system that uses graph theory algorithms. The system automatically generates shortest paths between points, identifies longest paths as roadways, and constructs road graphs without human intervention, thereby eliminating labor-intensive operations while maintaining topological accuracy.
Solution Approach 2:
The system performs self-service by automatically processing point map data through algorithmic operations. It independently generates shortest paths, selects longest paths representing roadways, and constructs the final road graph structure without requiring external manual processing, enabling the system to serve its own data processing needs efficiently.
2Measurement precision
If traditional methods are used to process point maps into road graphs, then road network topology can be determined, but the process is inaccurate particularly for side-by-side or stacked roads
Solution Approach 1:
The patent segments the complex road network problem into discrete graph theoretical operations: generating shortest paths between individual points, selecting longest paths to represent specific roadways, and constructing road graphs from these selected paths. This segmentation allows the system to handle complex scenarios like side-by-side or stacked roads by treating them as distinct path segments rather than attempting to process them as a monolithic structure.
3Loss of information
If manual processing is used to create road graphs, then detailed road network analysis is possible, but labor and resource requirements are excessive
Solution Approach 1:
The patent replaces manual labor with automated computational algorithms that process point map data through graph theory operations. The system preserves detailed road network information by generating shortest paths between all point pairs and selecting longest paths as roadways, while eliminating excessive labor and resource consumption through automation.
Solution Approach 2:
The system creates a computational copy of the road network topology by generating shortest paths between all point pairs and selecting longest paths to represent actual roadways. This copying process preserves detailed road network information in graph structure form without requiring physical manual processing, thereby reducing labor and resource requirements while maintaining information fidelity.
Data Source
AI summary
Systems, methods, and other embodiments described herein relate to generating a road graph from a frame graph. In one embodiment, a method includes receiving a frame graph of a region. The frame graph includes a plurality of points and a plurality of edges connecting the plurality of points based on at least one predetermined criterion. The method further includes generating a plurality of shortest paths. The plurality of shortest paths includes a shortest path between each two of the plurality of points connected by one or more of the plurality of edges. The method includes selecting the longest path from the plurality of shortest paths and generating a road graph based on at least the longest path. the road graph identifying one or more roadways in the region.