Public Transport Line Matching with Road Network Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods fail to accurately match public transport lines with road networks due to imprecise coordinate data, leading to deviations and difficulties in determining which road sections the public transport lines pass through, especially in complex urban environments.
Innovation Solution
A method and apparatus that divide public transport lines into segments, determine matching vertex sets on the road network, and select roads that pass through these points, using a smallest sum of areas as a measurement for matching, employing segmentation processing and direction filtering to optimize candidate routes and improve matching accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If public transport line data is collected using traditional methods, then the data collection process is simple, but the matching accuracy with road network is low
Solution Approach 1:
The public transport line is divided into multiple segments with dividing points, allowing each segment to be independently matched with road network segments. This segmentation enables more precise matching by comparing local characteristics rather than treating the entire line as a single entity, thereby improving matching accuracy without requiring overly complex global optimization algorithms.
Solution Approach 2:
The patent introduces closed polygon area as an intermediary measurement metric to evaluate the matching quality between public transport line segments and road network segments. By using the area of closed polygons formed by connecting matching points, the system obtains a quantitative measure of matching accuracy that balances computational efficiency with precision, avoiding the need for complex geometric optimization while achieving reliable matching results.
2Reliability
If the road network is complex and collection data is inaccurate, then the environment is challenging, but the method still able to find best-matching road
Solution Approach 1:
The patent determines matching vertex sets for each dividing point on the road network, which may include multiple candidate vertices. By considering multiple potential matches rather than relying on a single precise match, the system maintains high matching reliability even when input data contains noise or when the road network is complex. This partial action approach allows the system to find the best-matching road among multiple candidates.
Solution Approach 2:
The system uses the sum of areas of closed polygons as a parameter to evaluate and compare different matching results. By optimizing this geometric parameter, the method can distinguish between valid and invalid matches, filter out erroneous data, and identify the best-matching road even in the presence of noise and complexity in the road network structure.
3Measurement precision
If traditional matching methods are used, then the processing speed is fast, but the matching accuracy is insufficient
Solution Approach 1:
By dividing the public transport line into segments and processing each segment independently to determine matching vertex sets, the system achieves both accuracy and efficiency. The segmentation allows parallel processing of different segments and reduces the computational complexity of matching, enabling fast processing while maintaining high accuracy through localized optimization.
Solution Approach 2:
The patent replaces complex geometric optimization algorithms with a simpler area-based evaluation method. Instead of using computationally intensive algorithms to directly optimize the matching path, the system uses the area of closed polygons as a proxy metric that can be calculated efficiently, achieving both speed and accuracy in the matching process.
Data Source
AI summary
According to an embodiment of the present disclosure, a public transport line is divided into segments and a dividing point of each of the segments is determined. A matching vertex set associated with the dividing point on a road network is determined. A road matching the public transport line is determined from the road network, in which the determined road passes a point in each matching vertex set and closed polygons surrounded by the determined road and the public transport line have a smallest sum of areas.