Abstract Navigation Graph Maneuver Edges
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional route planning techniques using navigation graphs fail to accurately model transit-time causality effects, leading to inaccurate route optimality due to the use of a single transit time for each edge that doesn't vary based on the route taken, resulting in inappropriate route selections.
Innovation Solution
The implementation of an abstract navigation graph that includes maneuver edges, which are assigned traversal times based on historical location data and speed profiles, allowing for more accurate calculation of optimal routes by considering the impact of preceding and subsequent road segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a single transit time is used for each edge in the navigation graph, then the graph structure remains simple and computation is faster, but the route planning accuracy deteriorates because transit-time causality effects cannot be modeled
Solution Approach 1:
The patent segments the navigation graph into multiple types of edges: regular edges for standard road segments and maneuver edges for turning movements. Each edge type has specific attributes (transit time, maneuver time, causality effects) that capture different aspects of travel. This segmentation allows the system to model transit-time causality effects while maintaining computational efficiency by processing edge types differently.
Solution Approach 2:
The patent introduces a new dimension to the navigation graph by adding maneuver edges that represent turning movements between road segments. This dimensional addition allows the graph to capture the temporal and spatial relationships between consecutive segments, enabling accurate modeling of causality effects where the time to complete a maneuver depends on the preceding and subsequent segments.
2Productivity
If conventional navigation graphs are used with single transit times, then the system is easier to implement and compute, but route optimality is compromised due to inaccurate transit time modeling
Solution Approach 1:
The patent implements dynamic transit time modeling where the transit time for an edge is not fixed but varies based on the route taken and the specific sequence of edges traversed. The system calculates transit times considering the context of preceding and subsequent segments, allowing for accurate optimization while managing computational resources through targeted calculations rather than exhaustive searches.
Solution Approach 2:
The system uses feedback from historical location data and speed profiles to refine transit time estimates. By analyzing actual travel patterns and adjusting the model parameters accordingly, the system improves route optimization accuracy over time while maintaining efficient computation through iterative refinement rather than complete recalculations.
3Measurement precision
If maneuver edges with historical location data are incorporated, then traversal time calculation accuracy improves, but the data processing complexity increases
Solution Approach 1:
The patent creates a simplified representation of historical location data by extracting key features (speed profiles, maneuver characteristics) and storing them as attributes of maneuver edges. This copying approach preserves the essential information needed for accurate traversal time calculation while reducing the complexity of processing raw historical data by transforming it into a structured, query-friendly format.
Solution Approach 2:
The system transforms historical location data into parameterized attributes (transit time, maneuver time, speed profiles) that can be directly used in route optimization calculations. By changing the representation of historical data from raw form to parameterized form, the system maintains measurement accuracy while simplifying the data processing requirements for route planning algorithms.
Data Source
AI summary
System and methods are provided for utilizing abstract navigation graphs for route planning purposes. An abstract navigation graph may be generated from a commercially provided navigation graph. One or more maneuver edges may be provided within the abstract navigation graph. Historical location data associated with one or more route traversals may be utilized to identify traversal times for each edge. The traversal times for each edge may be analyzed to identify traversal times for each maneuver edge of the abstract navigation graph. Accordingly, the abstract navigation graph may be utilized for route planning purposes where the traversal times for the maneuver edges impose a time penalty for performing a maneuver. In this manner, maneuver edges of the abstract navigation graph may provide improvements over conventional navigation planning techniques by more accurately representing traversal times than conventional navigation graphs.