Navigation Fork Identification via Adjacent Node Distance Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation technologies face reduced accuracy in identifying road forks, particularly in cases where three exit roads and one entrance road do not converge at a single point, leading to errors in traffic path planning and navigation.
Innovation Solution
A method that extracts fork data from navigation data, identifies a first node and multiple exit roads, and queries a second node adjacent to the first node to determine if the fork data corresponds to a target fork based on a preset distance condition, improving identification accuracy by analyzing the relationship between adjacent nodes and exit roads.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If fork identification is based on simple road shape models requiring all exit roads to converge at a single point, then identification process is simple, but identification accuracy deteriorates when roads do not converge at a single point
Solution Approach 1:
The patent segments the fork identification process into multiple stages: first extracting basic fork data and determining convergence at a first node, then conditionally querying a second node when convergence is incomplete. This segmentation allows the system to handle both simple and complex road configurations appropriately, improving accuracy without always requiring complex processing.
Solution Approach 2:
The patent performs preliminary extraction of fork data, first node determination, and convergence checking before deciding whether to perform the more complex second node query. This preliminary action allows the system to handle many cases with simple processing while reserving complex processing only for cases that require it, thus resolving the contradiction between simplicity and accuracy.
2Measurement precision
If fork identification queries adjacent second nodes when exit roads do not completely converge at the first node, then identification accuracy improves, but processing time and complexity increase
Solution Approach 1:
The patent performs preliminary determination of whether exit roads converge at a first node before deciding to query a second node. This preliminary check filters out cases that can be resolved simply, so the time-consuming second node query is performed only when necessary, thus improving accuracy without excessive time loss.
Solution Approach 2:
The patent applies partial action by querying the second node only partially - specifically, only when the preliminary convergence check at the first node is incomplete. This selective application of the more complex query process achieves high accuracy for difficult cases while maintaining efficiency for simple cases, resolving the time-accuracy tradeoff.
Data Source
AI summary
A method of identifying information during navigation is provided. Fork data is extracted from navigation data, the fork data corresponding to a road having a fork. A first node and at least two exit roads are extracted from the fork data, the at least two exit roads being roads in different directions. The fork data are identified as corresponding to a target fork in response to all of the at least two exit roads converging at the first node. A second node adjacent to the first node is queried in response to at least two exit roads not completely converging at the first node. The fork data are identified as corresponding to the target fork based on a distance between the first node and the second node meeting a preset condition.