Grid-Based Target Search Radius Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current location-based target searches often return excessive or insufficient results, affecting system performance and user experience due to the use of city as a search dimension.
Innovation Solution
A target location search method and apparatus that determines a location, maps it to a pre-set gridded location area using a Geohash algorithm, and calculates an optimal search radius based on correspondence relationships to control the number of search results, ensuring ideal search outcomes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If city is used as a search dimension for location-based target searches, then the search coverage is improved, but the number of returned results becomes excessive or insufficient
Solution Approach 1:
The patent divides the city-level search area into multiple grid cells using a geohash algorithm. Each grid cell represents a smaller, more manageable geographic unit. By segmenting the large city area into finer grid units, the system can control the search scope more precisely and return an appropriate number of results for each localized area, avoiding both excessive and insufficient results that occur with city-level searches.
2Device complexity
If a fixed search radius is used for all locations, then the search process is simple, but the search accuracy and result relevance deteriorate
Solution Approach 1:
The patent assigns different search radii to different grid cells based on their characteristics. Instead of using a uniform search radius across the entire city, the system determines an optimal search radius for each grid cell individually. This allows the search parameters to be locally optimized for each area, improving result relevance and accuracy while maintaining a relatively simple overall process through automated radius assignment.
3Quantity of substance
If the search radius is increased to ensure enough results are returned, then the quantity of results is improved, but the relevance and accuracy of results deteriorate
Solution Approach 1:
The patent pre-calculates and stores optimal search radii for each grid cell in advance, based on historical data and geographic characteristics. When a search request comes in, the system simply retrieves the pre-determined radius for the relevant grid cell rather than calculating it in real-time or using a fixed radius. This preliminary preparation ensures that each search returns an appropriate number of relevant results without requiring complex real-time adjustments.
Data Source
AI summary
A search method comprises: determining a location designated by a target search request; determining a grid corresponding to the location in a gridded location area; and determining the grid's corresponding optimal search radius from correspondence relationships between grids and optimal search radiuses, and using the optimal search radius to perform a search corresponding to the target search request.