Routing Graph Error Correction for Missing Map Connections

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing map data used for e-hailing services often contains errors due to human intervention and outdated satellite images, leading to inaccuracies in route estimation and pricing, which is inefficient and prone to human error.

Innovation Solution

A method involving the generation of a routing graph from map data, decomposition into strongly connected components (SCCs), and classification of these components based on connectivity relationships, using historic driving data to identify and iteratively correct errors, forming a closed-loop feedback system for continuous improvement.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If manual updating of maps is performed, then map data can be updated, but human errors are introduced

Engineering Contradiction:

Improvemap data accuracyVSAvoidhuman errors

Core Design Contradiction:

ReliabilityVSObject-generated harmful factors

Solution Approach 1:

The system performs automatic map data validation and error detection using graph algorithms and connectivity analysis, eliminating the need for manual verification and reducing human error introduction

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The system implements a feedback mechanism where detected map errors trigger automatic correction processes, continuously improving map data quality without human intervention

Inventive Principle:

Principle #23Feedback

2Reliability

If frequent map updates are performed to keep data up-to-date, then map accuracy improves, but resource consumption increases

Engineering Contradiction:

Improvemap data currencyVSAvoidupdating resources

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

Instead of completely reprocessing all map data, the system performs targeted error detection and correction only on specific graph components (strongly connected components) that contain errors, reducing computational resource consumption

Inventive Principle:

Principle #16Partial or excessive action

Solution Approach 2:

The routing graph is divided into strongly connected components for independent error detection and correction, allowing parallel processing and reducing overall computational burden

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS12474180B2Method and device for correcting errors in map data

Publication Date: 2025.11.18 GRABTAXI HOLDINGS PTE LTD

AI summary

Aspects concern a method for correcting errors in map data comprising obtaining map data specifying travel possibilities between locations, generating a routing graph from the map data by assigning a vertex to each location and an edge from one vertex to another vertex if the map data specifies that it is possible to travel from the location to which the first vertex is assigned to the location to which the second vertex is assigned, identifying the largest strongly connected component of the routing graph, identifying one or more further strongly connected components of the routing graph, detecting errors in the map data by identifying travel possibilities that are not in the map data which lead to missing connections between the one or more further strongly connected components of the routing graph and the largest strongly connected component of the routing graph and amending the map data by the identified travel possibilities.