Location-Based Service Indexing in Dynamic Road Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing location-based services (LBS) face significant computational overhead and cost issues in dynamic road networks due to the need for frequent index regeneration when location updates occur, making them unsuitable for environments with varying traffic conditions.
Innovation Solution
A method and apparatus that generate query objects based on user terminal location information, cluster nodes, calculate nearest neighbors within these clusters, and identify associated data objects, such as vehicle terminals, to provide efficient LBS without regenerating indexes constantly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the nearest neighbor method indexes a large number of query objects related to location and distance, then the service can provide accurate location-based information, but the computational burden increases significantly when location updates occur
Solution Approach 1:
The patent divides the road network into multiple road segments and creates separate indexes for each segment rather than indexing all query objects globally. This segmentation allows the system to process only relevant segments when a location update occurs, significantly reducing the computational burden while maintaining location accuracy through localized nearest neighbor searches.
2Reliability
If indexes are regenerated from the beginning whenever a location update occurs, then the data remains up-to-date, but the computational overhead becomes huge
Solution Approach 1:
The patent pre-divides the road network into segments and pre-creates indexes for each segment before location updates occur. When a location update happens, the system only needs to update the specific segment index rather than regenerating all indexes from scratch, maintaining data freshness while dramatically improving computational efficiency.
3Measurement precision
If the system processes all query objects to find the nearest neighbor, then the most accurate result is obtained, but the calculation time increases in dynamic road networks
Solution Approach 1:
The patent applies local quality by focusing computational resources on specific road segments relevant to the user's location rather than processing all query objects in the entire road network. The system identifies and processes only the local segment containing the user, obtaining accurate nearest neighbor results while minimizing calculation time through localized processing.
Data Source
AI summary
Provided are a method and apparatus for providing a location-based service (LBS) in a dynamic road network, which include, according to an LBS request signal received from at least one user terminal, generating a query object based on location information of the user terminal; searching for at least one data object located within a threshold radius based on the user terminal; generating a cluster including at least one query object based on at least one node; comparing distances between boundary query objects and an inner query object based on the generated cluster and calculating a nearest neighbor for each query object; and identifying the data object associated with the calculated nearest neighbor.