Lane-Specific Link Cost Navigation Route Search

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing car-mounted navigation devices do not consider the differences in traffic conditions between lanes when searching for routes, leading to suboptimal route suggestions.

Innovation Solution

A navigation device that classifies link costs based on lane-specific travel times, using past traffic information statistically processed according to collection conditions, to determine the most efficient route by selecting the lane with the lowest cost for each link.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If route search uses general link costs without lane classification, then the route search is simple, but the route recommendation accuracy deteriorates because it does not account for traffic condition differences between lanes

Engineering Contradiction:
Improveroute recommendation accuracyVSAvoidroute search complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the link cost into multiple lane-specific costs, where each lane has its own cost value reflecting its traffic conditions. This allows the route search to consider different travel times for different lanes, improving recommendation accuracy while maintaining computational feasibility through structured data organization.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by assigning different cost characteristics to different lanes of the same link. Each lane's cost is determined by its specific traffic conditions, allowing the system to make locally optimized decisions about which lane to recommend, thereby improving overall route accuracy.

Inventive Principle:
Principle #3Local quality

2Measurement precision

If route search considers lane-specific traffic conditions, then the route recommendation accuracy is improved, but the data processing complexity increases

Engineering Contradiction:
Improveroute recommendation accuracyVSAvoiddata processing overhead
Core Design Contradiction:
Measurement precisionVSLoss of information

Solution Approach 1:

The patent performs preliminary action by pre-calculating and storing lane-specific costs in the link data before route search is executed. This preparation work is done offline or in advance, so that during actual route search, the system only needs to retrieve and compare pre-computed lane costs, reducing real-time processing overhead while maintaining high accuracy.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If the navigation device uses statistically processed traffic information classified by collection conditions, then the route search accuracy is improved, but the storage requirements and processing complexity increase

Engineering Contradiction:
Improveroute search reliabilityVSAvoiddata storage requirements
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent applies parameter changes by organizing traffic information according to collection conditions (such as time periods, weather, traffic flow patterns). This structured parameterization allows the system to select appropriate historical data based on current conditions, improving reliability while managing storage efficiently through conditional classification rather than storing all possible variations.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS7725254B2Navigation device used for a route search
Publication Date: 2010.05.25 AUTONAVIGARE LLC
  • US7725254B2 patent drawing
  • US7725254B2 patent drawing
  • US7725254B2 patent drawing

AI summary

Route search is performed considering the fact that traffic conditions differ according to lane even for the same road. A navigation device performs route search, using link costs (link travel times) classified by lane. For example, the navigation device searches for a route having the lowest total cost to the destination, using link data that determine cost for each lane of a component link of a road on a map. A cost of a lane on which a vehicle runs to move to a next link, being the cost of any lane of the link, is used as a cost of a link on a route.