Road Name Integration in Navigation Data

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Navigation systems face confusion and repetition issues when integrating road names and points of interest due to improper data field arrangements, such as road segment splitting and alias names, leading to inaccurate user results.

Innovation Solution

A method that extracts unique road names, merges interconnected segments, and assigns priority to points of interest to create a hierarchical tree structure, redirecting child links and deleting parent links to consolidate data entities based on connectivity, geometry, and distance, thereby integrating road names and points of interest effectively.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If road segments are split into multiple segments in the map database, then the data can represent new highways or road realignments, but the same road name appears multiple times causing confusion and repetition for users

Engineering Contradiction:
Improveability to represent new highways and road realignmentsVSAvoiduser confusion due to repeated road names
Core Design Contradiction:
Adaptability or versatilityVSLoss of information

Solution Approach 1:

The patent segments the road network data into discrete road segments while maintaining a hierarchical structure. Each segment is identified by unique attributes (segment ID, geometry) while road names are grouped at a higher level. This allows the system to represent new highways and realignments through segment division without causing user confusion, as the segmentation is transparent to the end user who sees unified road names.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements a nested data structure where road segments are contained within road name groups, which are in turn contained within larger network structures. Multiple segments can be nested under a single road name entity, allowing the system to maintain both the detailed segment information needed for routing and the unified road name presentation needed for user clarity.

Inventive Principle:
Principle #7Nested doll (Nesting)

2Adaptability or versatility

If points of interest are stored with alias names in the map database, then the system can recognize multiple names for the same location, but the selection and combination algorithm produces repeated results

Engineering Contradiction:
Improveability to recognize multiple names for same locationVSAvoidrepeated search results
Core Design Contradiction:
Adaptability or versatilityVSLoss of information

Solution Approach 1:

The patent extracts the alias name information from the main search result generation process and stores it as a separate attribute of the point of interest entity. The selection algorithm queries using the primary name and then retrieves associated alias names, rather than querying for each alias separately. This eliminates repeated results while preserving the ability to recognize and display multiple names for the same location.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent performs preliminary grouping and deduplication of points of interest by their unique identifiers before the selection and combination algorithm executes. Alias names are pre-associated with their primary point of interest entities, so when results are generated, the system already has consolidated information ready, preventing repetition without losing the alias recognition capability.

Inventive Principle:
Principle #10Preliminary action

3Measurement precision

If the map database stores detailed segment information for routing calculations, then navigation accuracy is improved, but the data structure becomes complex requiring sophisticated selection and combination algorithms

Engineering Contradiction:
Improvenavigation accuracyVSAvoidcomplexity of selection and combination algorithm
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments navigation data into distinct functional components: road segments for geometric and routing calculations, road names for identification and display, and points of interest for location information. Each segment type has dedicated attributes and processing rules, simplifying the overall algorithm structure while maintaining high navigation accuracy through precise segment-level data.

Inventive Principle:
Principle #1Segmentation

4Quantity of substance

If road segments are arranged as a table with multiple data fields for address searching, then comprehensive address information is available, but improper field arrangement causes repetition and confusion in results

Engineering Contradiction:
Improvecomprehensive address informationVSAvoiduser confusion from improper field arrangement
Core Design Contradiction:
Quantity of substanceVSEase of operation

Solution Approach 1:

The patent assigns specific qualities and roles to different data fields based on their function. Road name fields are marked as display-oriented with grouping attributes, while segment fields are marked as calculation-oriented with unique identifiers. This local differentiation allows the system to present comprehensive address information in an organized manner, with each field type processed appropriately to prevent repetition and confusion.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS8176034B2Method for integrating road names and points of interest in source data
Publication Date: 2012.05.08 MITAC INT CORP
  • US8176034B2 patent drawing
  • US8176034B2 patent drawing
  • US8176034B2 patent drawing

AI summary

The present invention is directed to a method for integrating road names recorded in a source data, particularly comprising steps of merging all interconnected segments having this road name into a user road group and merging these user road groups if they belongs to the same physical road entity. The present invention also relates to a method for integrating points of interest recorded in a source data, particularly comprising steps of, beginning from node with highest priority in the tree to the other nodes one at a time, finding nodes with same point of interest to redirect all child links of lower priority node to higher priority node among the same point of interest nodes and delete link between the same point of interest nodes; creating geometry relationship based on above new arrangement.