Route Generation Using Threshold-Based Delay Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route planning methods on electronic maps are inefficient in generating accurate routes that account for traffic delays, as they often require extensive processing time and consider irrelevant delay data, leading to suboptimal route calculations.
Innovation Solution
A computerized method that sets a predetermined threshold for considering delay data based on driving time and area, using a Directed Acyclic Graph (DAG) and routing acceleration data to optimize route generation, switching between A* search and routing acceleration data methods to reduce processing burden and improve accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If delay data from the entire electronic map is considered for route planning, then route accuracy accounting for traffic delays is improved, but processing time increases significantly
Solution Approach 1:
The electronic map is divided into multiple regions, and delay data is processed region by region rather than all at once. The route planning algorithm segments the map into manageable portions, calculating routes for each region separately and combining results, which reduces the processing burden while maintaining comprehensive delay data consideration.
Solution Approach 2:
Delay data is pre-processed and stored in an optimized format before route planning occurs. The system pre-calculates delay information for each region and stores it in a readily accessible structure, eliminating the need to process raw delay data during actual route planning, thus reducing processing time while preserving accuracy.
2Reliability
If delay data from distant areas is considered, then comprehensive route planning is improved, but irrelevant data processing increases
Solution Approach 1:
The system applies different processing qualities to different regions based on their relevance to the origin and destination. Regions closer to the route corridor receive more detailed delay data processing, while distant regions use simplified or pre-aggregated delay information. This local differentiation reduces processing of irrelevant data while maintaining comprehensive coverage where needed.
Solution Approach 2:
The system processes delay data to a sufficient degree rather than exhaustive detail. For regions far from the planned route, only summary delay statistics are processed rather than detailed incident data, providing adequate information for route planning without the computational burden of complete data processing everywhere.
3Productivity
If a simple routing algorithm is used, then processing speed is improved, but route accuracy accounting for delays deteriorates
Solution Approach 1:
The routing process is segmented into multiple passes: a first pass using a simple fast algorithm to establish a baseline route, followed by refinement passes that incorporate delay data specifically for regions along that baseline route. This segmentation maintains high processing speed while progressively improving accuracy through targeted delay data integration.
Solution Approach 2:
A regional delay summary structure serves as an intermediary between the simple routing algorithm and detailed delay data. The algorithm first generates a route using basic speed data, then the intermediary regional summaries provide filtered delay information for refinement, avoiding direct processing of all raw delay data while still improving accuracy through delay-aware adjustments.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
A computerised method of generating a route (1000) from an origin position F1 to a destination position (706) across an electronic map (700) comprising a plurality of vectors representing segments of a navigable route in the area covered by the electronic map (700), the method comprising: (1) obtaining delay data indicating delays on vectors within the area covered by the electronic map (700); (2) calculating a first portion (1002) of a route from origin position toward the destination position (706) using a first routing method up to a predetermined threshold (1006) from the origin position F1, such that the first routing method uses the delay data so that the first portion (1002) of the route takes into account delays; and (3) calculating a second portion (1004) of the route beyond the predetermined threshold (1006) to the destination position (706) using a second routing method to further calculate the route to the destination position (1006).