Conditional Contraction Hierarchies for Real-Time Road Edit Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current contraction hierarchy techniques for vehicle navigation consume significant computing resources and fail to provide accurate real-time navigational routes due to resource-intensive preprocessing stages required for handling road network changes.
Innovation Solution
A routing system that implements a conditional customizable contraction hierarchy (CCCH) to efficiently handle road edits by generating a node-based graph, identifying affected arcs, constructing new arc configurations, and updating a lookup table, thereby reducing the need for extensive recalculation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional contraction hierarchy preprocessing is performed to handle road network changes, then routing accuracy is improved, but computing resource consumption increases significantly
Solution Approach 1:
The patent segments the road network into hierarchical levels (original arcs, CCH arcs, and lower-level arcs) and processes only the affected segments when road edits occur. Instead of reprocessing the entire contraction hierarchy, the system identifies and updates only the specific arcs impacted by road changes, thereby maintaining routing accuracy while significantly reducing computing resource consumption.
Solution Approach 2:
The patent applies partial action by performing incomplete preprocessing - specifically, it skips the full contraction hierarchy preprocessing stage and instead performs selective updates only on affected arcs. This partial preprocessing approach maintains sufficient routing accuracy for real-time applications while avoiding the excessive computing resources required for complete preprocessing.
2Reliability
If complete reprocessing of contraction hierarchy is performed due to road network changes, then routing accuracy is maintained, but time consumption increases
Solution Approach 1:
The patent performs preliminary identification of affected arcs before road edits are applied. By pre-identifying which arcs will be impacted by upcoming road changes and preparing their update structures in advance, the system minimizes the actual processing time required when changes occur, while still maintaining routing accuracy through systematic updates.
Solution Approach 2:
The patent performs partial preprocessing by selectively updating only the necessary arc configurations rather than reprocessing the entire contraction hierarchy. This approach maintains routing accuracy for affected routes while dramatically reducing the preprocessing time compared to complete reprocessing.
3Reliability
If traditional contraction hierarchy methods are used, then optimal routes are found, but the system fails to provide real-time updates due to resource intensity
Solution Approach 1:
The patent introduces dynamic adaptability by implementing a system that automatically detects road edits and triggers selective updates to the contraction hierarchy. The system dynamically adjusts the preprocessing level based on the nature and scope of road changes, enabling real-time route updates while maintaining optimality through conditional reprocessing of affected arcs only.
Solution Approach 2:
The patent segments the update process into identification, construction, and integration phases, allowing real-time handling of road edits. By dividing the complex update operation into manageable segments that process only affected portions of the network, the system maintains route optimality while achieving real-time update capability that traditional methods cannot provide.
Data Source
AI summary
A device may generate, based on traffic data associated with a vehicle, a CCCH that includes a node-based graph, a priority order of links, original arcs, CCH arcs, and arc configurations for the CCH arcs. The device may receive a road edit associated with one of the roads, may identify a set of the original arcs affected by the road edit, and may construct new arc configurations for the set of the original arcs. The device may generate a lookup table mapping identifiers of the CCH arcs, corresponding to the set of the original arcs, with the new arc configurations, and may add the identifiers of the CCH arcs to a priority queue. The device may update the lookup table based on the priority queue to generate a final lookup table, and may implement the CCCH and the final lookup table for the vehicle.