Routing System No-Outlet Link Elimination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing systems face inefficiencies in determining preferred routes due to the lack of effective methods for processing directed links and node information, particularly in handling no-outlet regions and varying road densities, which can lead to suboptimal route calculations.
Innovation Solution
A computer-implemented routing system that processes directed links by identifying no-outlet links and applying density-based factors to determine preferred routes, utilizing node information such as driveable links and intersection costs to optimize route determination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional routing methods (Dijkstra or A*) are used to determine optimal routes, then the route optimization is based on distance and time between nodes, but the system fails to account for no-outlet regions and road density variations, leading to suboptimal route calculations
Solution Approach 1:
The patent applies preliminary action by pre-identifying and marking no-outlet links in the routing graph before performing route determination. This preprocessing step allows the routing algorithm to avoid unnecessary exploration of paths that lead to dead ends, improving calculation accuracy without significantly increasing system complexity during actual route queries.
Solution Approach 2:
The patent implements local quality by applying density-based factors specifically to regions with varying road densities. Instead of treating all links uniformly, the system applies different cost factors to links in high-density versus low-density regions, allowing the routing algorithm to make more accurate local decisions while maintaining overall system manageability.
2Reliability
If the routing system processes all possible paths in the routing graph, then comprehensive route options are evaluated, but the time required to identify preferred routes increases significantly
Solution Approach 1:
The patent applies the taking out principle by extracting and removing no-outlet links from the routing graph before performing route determination. By eliminating these links that lead to dead ends, the system reduces the number of paths that need to be evaluated, significantly decreasing route determination time while maintaining reliability by ensuring that only viable paths are considered.
Solution Approach 2:
The patent implements partial action by applying density-based cost factors selectively to specific regions of the routing graph rather than uniformly to all links. This allows the system to focus computational effort on regions where density variations most impact route quality, reducing overall processing time while maintaining comprehensive evaluation where it matters most.
3Measurement precision
If density-based factors are applied to all directed links, then route preferences account for road density variations, but the computational overhead increases
Solution Approach 1:
The patent applies local quality by implementing density-based cost factors only for directed links that are not marked as no-outlet links. This selective application ensures that density considerations are applied where they can improve route preference accuracy without incurring the full computational overhead of evaluating density for every link in the graph, thus balancing precision with calculation speed.
Data Source
AI summary
A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.