Strand Definition for Lane-Level Traffic Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traffic-aware routing and navigation systems face challenges in providing accurate lane-level traffic information for links upstream of direction-based traffic (DBT) links, as existing methods lack granular representation of vehicle behavior, especially at intersections, leading to incomplete and inconsistent data.
Innovation Solution
A method to define a strand of links upstream of a DBT link, where lane-specific traffic information is obtained by extending the strand based on termination criteria related to function classes and intersection associations, allowing for prioritization of lane-level traffic information collection and processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If lane-level traffic information is collected for all links in the road network, then measurement precision of vehicle behavior is improved, but loss of time and computing resources increases significantly
Solution Approach 1:
The patent segments the road network into DBT links (where lane-level information is available) and non-DBT links (where it is not). By focusing lane-level data collection only on DBT links and their directly connected upstream links, the system avoids the need to collect lane-level information across the entire network, thus reducing time loss while maintaining measurement precision where it matters most.
Solution Approach 2:
The patent applies local quality by providing high-granularity lane-level traffic information specifically at DBT links and their immediate upstream connections, while using aggregate link-level information for more distant upstream links. This localized approach to data granularity ensures measurement precision is improved at critical locations without incurring the time cost of collecting detailed data everywhere.
2Reliability
If lane-level traffic information is collected for all links, then reliability of traffic data is improved, but use of energy and computing resources increases
Solution Approach 1:
The patent segments the network into zones requiring lane-level information (DBT links and directly connected upstream links) and zones where aggregate information suffices (more distant upstream links). This segmentation ensures reliability is maintained where lane divergences occur while minimizing energy consumption by avoiding unnecessary lane-level data collection elsewhere.
Solution Approach 2:
The patent applies partial action by collecting lane-level traffic information only for DBT links and their directly connected upstream links, rather than for all links in the network. This partial collection strategy provides sufficient reliability for route planning at intersections while reducing computing resource consumption compared to comprehensive lane-level collection.
3Device complexity
If aggregate link-level traffic information is used for upstream links, then device complexity is reduced, but measurement precision deteriorates
Solution Approach 1:
The patent applies local quality by using lane-level traffic information for DBT links and their directly connected upstream links where precision is critical, while using aggregate link-level information for more distant upstream links where the complexity reduction is acceptable. This localized differentiation resolves the contradiction by matching data granularity to the actual need at each location.
Solution Approach 2:
The patent segments upstream links into two categories: those directly connected to DBT links (where lane-level information is used to maintain precision) and those further upstream (where aggregate information is used to reduce complexity). This segmentation allows the system to balance measurement precision and device complexity by applying different data granularities to different segments of the network.
Data Source
AI summary
A method, apparatus and computer program product are provided to define a strand upstream of a direction based traffic (DBT) link. In a method, a strand is defined upstream of a DBT link. The method includes extending the strand so as to include one or more links upstream of the DBT link. The strand is extended by determining whether a link is to be added to the strand based upon evaluation of a termination criteria. The termination criteria is at least partially based upon a relationship of a function class of the link to the function class of one or more other links. In an instance in which the termination criteria is satisfied, the method ceases further extension of the strand.