Directed Graph Map Matching for Branched Vehicle Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing map matching technologies struggle to accurately align vehicle trajectory data represented as a directed graph to digital map data due to inherent inaccuracies and noise, complex map data, and computational inefficiencies, particularly when dealing with branched graph structures and limited context.
Innovation Solution
The system segments a directed graph representation of vehicle paths into linear features, applies path-based matchers to each feature while incorporating context through extensions and geometric adjustments, and aggregates results to improve accuracy and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If vehicle trajectory data is represented as a directed graph to capture complex paths, then the representation capability is improved, but the computational complexity of map matching increases
Solution Approach 1:
The directed graph is segmented into individual linear features (edges), each of which is processed independently by path-based matchers. This segmentation transforms the complex graph matching problem into multiple simpler linear feature matching problems, reducing computational complexity while preserving the ability to represent complex vehicle paths through the directed graph structure.
2Productivity
If path-based matchers are applied to individual linear features, then computational efficiency is improved, but the context awareness is reduced
Solution Approach 1:
The system incorporates feedback by using the directed graph structure to provide contextual information about linear features during the matching process. The graph topology and relationships between features are fed back into the matching algorithm, enabling path-based matchers to maintain context awareness while processing features individually for computational efficiency.
3Ease of manufacture
If raw trajectory data is used directly for map matching, then the process is simple, but accuracy is reduced due to inherent inaccuracies and noise
Solution Approach 1:
The system performs preliminary actions by aggregating multiple raw trajectory segments into a directed graph representation before applying path-based matchers. This preliminary aggregation and graph construction process cleans and organizes the data, removing noise and inaccuracies while preserving the essential path information, thereby improving matching accuracy without significantly complicating the overall process.
4Ease of manufacture
If digital map data is used directly for matching, then the process is straightforward, but reliability is reduced due to potential inaccuracies and outdated information
Solution Approach 1:
The directed graph serves as an intermediary representation between raw trajectory data and digital map data. It mediates the matching process by providing a structured, cleaned version of path information that can be reliably matched against map topology, filtering out inaccuracies and outdated information while maintaining the essential spatial relationships needed for accurate matching.
Data Source
AI summary
An approach is provided for map matching a vehicle path network to a road topology network of a digital map. The approach, for instance, involves aggregating vehicle trajectory data into a vehicle path network that is a directed graph comprising a plurality of nodes. The approach also involves segmenting the vehicle path network into a plurality of linear features. Each linear feature of the plurality of linear features connects two nodes of the plurality of nodes in the vehicle path network. The approach further involves using a path-based map matcher to separately match each linear feature by incorporating context of the vehicle path network to a map topology of a digital map to generate map matching results. The approach further involves aggregating the map matching results of each linear feature into an overall map matching result for the directed graph, and providing the overall map matching result as an output.