Road Network Maneuver Ranking to Cut Redundant Path Calculations

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing navigation systems face inaccuracies and inefficiencies in updating digital maps due to the complexity of road network analysis, particularly in densely populated areas, leading to prolonged processing times and insufficient accuracy.

Innovation Solution

A method for ranking maneuvers in a road network by associating values with each maneuver based on predefined criteria, such as path cost, and updating these values based on selected paths to reduce redundant calculations and processing time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If graph modeling with complex algorithms is used to extract information from road networks, then measurement precision of traffic volume estimation is improved, but device complexity and processing time increase significantly

Engineering Contradiction:
Improvetraffic volume estimation accuracyVSAvoidalgorithm complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the road network into a graph structure where intersections are nodes and road segments are edges. This segmentation simplifies the complex road network into manageable components that can be processed efficiently using graph algorithms, reducing overall system complexity while maintaining analysis capability

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates a computational model (graph representation) that copies the essential structure of the physical road network. This abstract copy allows for efficient algorithmic processing of traffic patterns without requiring direct analysis of the complex physical infrastructure, reducing processing complexity while preserving measurement precision

Inventive Principle:
Principle #26Copying

2Measurement precision

If large volumes of traffic data are collected for accurate estimation, then measurement precision is improved, but loss of time and computational resources increase

Engineering Contradiction:
Improvetraffic volume estimation accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs preliminary actions by pre-calculating and storing the graph structure of the road network, including nodes, edges, and their relationships. This preliminary structuring allows subsequent traffic volume estimations to be performed efficiently using established graph algorithms, reducing processing time for actual traffic analysis while maintaining accuracy through the use of comprehensive traffic data

Inventive Principle:
Principle #10Preliminary action

3Measurement precision

If comprehensive road network structure evaluation is performed, then measurement precision of traffic volume estimation is improved, but loss of time increases due to time-consuming analysis

Engineering Contradiction:
Improvelocal road network structure understandingVSAvoidevaluation time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent replaces manual or complex mechanical evaluation of road network structures with automated graph-based computational methods. By representing the road network as a graph data structure with defined nodes and edges, the system can automatically evaluate network structure using efficient graph algorithms, significantly reducing evaluation time while maintaining comprehensive analysis and measurement precision

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentEP4703680A1Method and apparatus for analysis of road networks
Publication Date: 2026.03.04 TOMTOM GLOBAL CONTENT
  • EP4703680A1 patent drawingFigure 1
  • EP4703680A1 patent drawingFigure 2
  • EP4703680A1 patent drawingFigure 3

AI summary

A computer-implemented method to rank a plurality of maneuvers in a road network is disclosed. The road network comprising a set of nodes and a set of roads, where each of the roads of the set of roads is arranged to connect two neighboring nodes of the set of nodes. The method comprising associating a value with each of one or more maneuvers available at a central node of the set of nodes; selecting a path between a pair of nodes of the set of nodes based on a predefined criterion; and changing the value associated with a respective maneuver from the one or more maneuvers at the central node when the respective maneuver is part of the selected path.