Intersection Road Network Data Generation Using Centerline Extension

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods for generating road network data in intersection areas result in excessively large quantities of nodes and links, leading to increased path planning delays and inefficiencies, particularly in multi-way intersections where existing traversal and extension methods fail to meet real-time requirements.

Innovation Solution

A method and apparatus for generating road network data that calculates intersection nodes and intra-intersection links based on road link data, using extension lines aligned with the course of each road, reducing the number of nodes and links, and employing a path planning algorithm with O((m+n)log n) time complexity to improve efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If existing traversal connection method and extension method are used for multi-way intersections, then road network data can be generated, but the quantity of intersection nodes and intra-intersection links increases sharply, increasing path planning time

Engineering Contradiction:
Improvequantity of intersection nodes and intra-intersection linksVSAvoidpath planning time
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The patent extracts and removes unnecessary nodes and links from the road network data by using road centerline extension methods that directly connect entry and exit links without generating excessive intra-intersection elements. This extraction principle reduces the quantity of nodes and links while preserving the essential road network topology for path planning.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent segments the intersection area into entry links and exit links based on road centerline extensions, creating a simplified representation that divides the complex intersection into manageable segments. This segmentation approach avoids generating excessive nodes by focusing only on the necessary connection points between road segments.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If existing methods are used to generate road network data for multi-way intersections, then complete coverage is achieved, but the volume of road network data increases

Engineering Contradiction:
Improvevolume of road network dataVSAvoidcompleteness of road network data
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The patent extracts only the essential road network elements needed for path planning by extending road centerlines to define entry and exit links. This extraction method removes redundant data while preserving the complete topological relationships necessary for accurate path planning, thereby reducing data volume without sacrificing completeness.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Instead of generating road network data by traversing all possible connections within an intersection (which creates excessive data), the patent inverts the approach by extending road centerlines outward from the intersection to define links. This inversion generates only the necessary connectivity information without creating redundant intra-intersection elements.

Inventive Principle:
Principle #13The other way round (Inversion)

3Measurement precision

If quantity of intra-intersection links is excessively large, then positioning point matching becomes complex, but calculation complexity increases and positioning delay increases

Engineering Contradiction:
Improvepositioning point matching accuracyVSAvoidcalculation complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent extracts and eliminates excessive intra-intersection links by using road centerline extensions to define only the necessary entry and exit links. This reduction in link quantity simplifies the positioning point matching process while maintaining matching accuracy, as the essential geometric relationships are preserved without the computational burden of redundant elements.

Inventive Principle:
Principle #2Taking out (Extraction)

4Productivity

If existing extension method is used for intersections, then road network data can be generated, but response delay exceeds 500 ms requirement

Engineering Contradiction:
Improvemap data generation efficiencyVSAvoidresponse delay
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent segments the road network data generation process into efficient operations by extending road centerlines to directly define entry and exit links. This segmentation approach processes only the necessary geometric elements rather than traversing all possible connections, significantly improving generation efficiency and reducing response delay to meet the 500 ms requirement.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent extracts only the essential geometric information needed for path planning by extending road centerlines. This extraction method generates road network data with minimal processing overhead, improving generation efficiency and ensuring response delay remains within the 500 ms threshold for real-time path planning requirements.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS11454513B2Method and apparatus for generating road network data of intersection area
Publication Date: 2022.09.27 HUAWEI TECH CO LTD
  • US11454513B2 patent drawing
  • US11454513B2 patent drawing
  • US11454513B2 patent drawing

AI summary

This application provides a method and an apparatus for generating road network data of an intersection area, and the intersection area connects a plurality of roads. The method includes: obtaining data of a road link of each of the plurality of roads, where the road link includes an entry link and an exit link; calculating coordinates of an intersection point of an extension line of the entry link of each road and an extension line of an exit link of a neighboring road based on the data of the road link of each of the plurality of roads, where the coordinates of the intersection point are coordinates of an intersection node; and the neighboring road is a road counterclockwise adjacent to the road; or the neighboring road is a road clockwise adjacent to the road, where two intersection nodes in sequence are endpoints of an intra-intersection link.