Route Determination System Using Pre-calculated Estimation Values
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current route determination methods in navigation systems are inefficient due to high computational time and storage space requirements, especially when determining multiple routes or accommodating user preferences, as they often rely on complex algorithms like Dijkstra's and A* that require extensive graph exploration.
Innovation Solution
A method that calculates estimation function values for a first graph representing a lower bound on costs from vertices to a destination, allowing for a more efficient route search on a second graph, potentially with different cost models, and automatically initiates new searches based on changes in the current position or costs, using a processor and storage units to manage graph data and estimation values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If standard algorithms like Dijkstra's and A* are used for route determination, then accurate routes can be found, but computational time and storage space requirements increase significantly
Solution Approach 1:
The patent pre-calculates and stores estimation function values for all vertices in the graph before actual route queries are processed. This preliminary computation allows the system to avoid expensive graph explorations during runtime, significantly reducing computational time while maintaining route accuracy through the use of these pre-computed estimation values in the A* algorithm
2Reliability
If complex algorithms like Dijkstra's and A* are used for route determination, then accurate routes can be found, but storage space requirements increase significantly
Solution Approach 1:
The patent extracts and stores only the essential estimation function values for each vertex rather than storing complete route information or performing full graph explorations. This selective storage approach reduces memory requirements while preserving the necessary information for accurate route determination through the A* algorithm
3Adaptability or versatility
If multiple routes and user preferences are accommodated, then service quality improves, but computational complexity and time requirements increase
Solution Approach 1:
The system pre-calculates estimation function values that can be reused for multiple different route queries and user preferences. This allows the system to accommodate various route options (e.g., fastest route, shortest route, avoiding specific areas) without reperforming expensive graph explorations, as the pre-computed estimation values can be applied with different cost models and preferences
Data Source
AI summary
A system for determining a route is provided. The system includes a method for determining estimation function values corresponding to a plurality of vertices on a first graph, where the first graph corresponds to a first route network. The method further includes searching for a first route from a first starting point to the destination on a second graph based on the estimation function values. The system further includes a storage unit and a processor coupled to the storage unit for receiving graph data, where the processor is configured to determine estimation function values corresponding to a plurality of vertices on the first graph corresponding to a first route network, and is further configured to search for a route from a first starting point to the destination on a second graph based on the estimation function values. The device may further include an input unit, a clock unit, a traffic message receiver, and/or a position determining unit.