Route Search Apparatus Using Composite Link Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route search techniques are inadequate in accurately avoiding heavy traffic congestion across multiple road districts, particularly during right-turn and left-turn scenarios, and face inefficiencies in processing, cost, resource utilization, and user convenience.
Innovation Solution
A route search apparatus that utilizes road information storage and a route searcher to extend a search tree based on single and composite link information, accurately reflecting traffic costs across multiple districts, allowing for efficient route optimization even during congested conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If different costs are set for single road districts between intersections, then right-turn congestion in one region can be avoided, but traffic congestion across multiple road districts cannot be effectively addressed
Solution Approach 1:
The patent segments the road network into multiple road districts with distinct boundaries, allowing independent cost assignment for each district. This enables the system to handle congestion in one district without affecting cost calculations in other districts, thereby resolving the limitation of single-district approaches while maintaining search accuracy.
Solution Approach 2:
The patent combines multiple single-district cost structures into a unified multi-district cost model. By merging the cost information from individual districts while preserving their distinct characteristics, the system can simultaneously address congestion across multiple road districts while maintaining the precision needed for accurate route search.
2Ease of operation
If correction links are set in advance for right-turn congestion, then some congestion can be avoided, but the system lacks flexibility for dynamic traffic conditions and complex multi-district scenarios
Solution Approach 1:
The patent introduces dynamic cost adjustment mechanisms that allow cost values to change based on real-time traffic conditions, time of day, and congestion levels. This dynamic approach maintains ease of operation through automated adjustments while significantly improving reliability by adapting to changing traffic patterns and complex multi-district congestion scenarios.
Solution Approach 2:
The patent changes the cost parameters dynamically based on traffic conditions, allowing the same road segment to have different costs at different times or under different congestion conditions. This enables the system to maintain simple operation through automated parameter adjustment while achieving high reliability in route optimization even in complex scenarios.
3Measurement precision
If detailed link information is stored for each road segment, then route search accuracy improves, but data storage requirements and processing complexity increase
Solution Approach 1:
The patent applies local quality by storing detailed link information only where necessary - specifically at road district boundaries and for links affected by congestion. Internal links within non-congested districts can use simplified representations, reducing overall data complexity while maintaining the precision needed for accurate cost calculation at critical decision points.
Data Source
AI summary
A route search apparatus comprises a road information storage part configured to store road information including link information comprised of single link information and composite link information; and a route searcher configured to search a recommended route between two different points using the link information. The single link information includes information regarding an approach link that is a link approaching to a node at one end of a target link, an exit link that is a link exiting from a node at the other end of the target link, and a cost of the target link for entering from the approach link and exiting to the exit link. The composite link information includes information regarding an approach link that is a link approaching to a node at one end of a target link array, an exit link that is a link exiting from a node at the other end of the target link array, and a cost of the target link array for entering from the approach link and exiting to the exit link.