Navigation Search Corridor for Location Data Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional navigation devices face inefficiencies in determining location data due to cumbersome name searches, especially when multiple locations share the same name, and the need for additional identifiers like ZIP codes, leading to time-consuming character matching operations and unsatisfactory user experiences.
Innovation Solution
A method and device that allow users to define a search corridor on a map by tracing a line from one area to another, with an adjustable width, to filter location data associated with input characters within that corridor, using data structures like Next Valid Character trees to efficiently retrieve location names and coordinates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If conventional databases covering whole countries or continents are searched using character matching, then comprehensive location coverage is achieved, but the search time becomes excessively long
Solution Approach 1:
The patent divides the large database into smaller spatial units by introducing a corridor structure that segments the search space into discrete map fields. Instead of searching the entire database, the system segments the search to only relevant geographic areas defined by the corridor, dramatically reducing search time while maintaining comprehensive coverage within the defined path.
Solution Approach 2:
The patent applies local quality by making the search scope dynamic and location-specific. The corridor definition allows the system to adjust the search area locally along the defined path, searching only in relevant map fields rather than uniformly across the entire database. This localized approach reduces overall search time while ensuring complete coverage of relevant locations.
2Measurement precision
If multiple identifiers (location name and ZIP code) are required to uniquely identify a location, then location identification accuracy is improved, but the ease of operation deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-defining the corridor that contains all possible target locations before the user performs character matching. This preliminary spatial constraint reduces the search space in advance, allowing the system to present a limited set of candidate locations within the corridor that match the user's character input, thereby maintaining accuracy while simplifying the user's task.
Solution Approach 2:
The corridor acts as an intermediary between the user's character input and the database search. Instead of directly querying the entire database with character patterns, the system first filters locations spatially using the corridor as an intermediary constraint, then performs character matching only within this reduced set. This intermediary step maintains location identification accuracy while significantly reducing the complexity of user input required.
3Reliability
If character matching is performed across the entire database, then all matching locations are found, but the time required for the matching operation increases
Solution Approach 1:
The patent segments the database search into multiple smaller operations based on corridor-defined map fields. Instead of performing one large character matching operation across the entire database, the system divides the search into smaller segments corresponding to different map fields along the corridor, processing each segment separately and combining results. This segmentation maintains complete matching coverage while dramatically improving search operation speed.
Solution Approach 2:
The system performs preliminary spatial filtering by defining the corridor and identifying relevant map fields before executing character matching. This preliminary action creates a pre-filtered subset of locations that are both spatially relevant and potential character matches, reducing the overall computational workload while ensuring no valid matches are missed. The two-step process (spatial filtering followed by character matching) maintains reliability while improving productivity.
Data Source
Figure 1
Figure 2A~2C
Figure 2D~2F
AI summary
A technique for determining location data from a database is presented. A method implementation of that technique comprises receiving a first user input defining an extension of a search corridor relative to a map visualized on a display unit. The search corridor extends from a first map area to a second map area spaced apart from the first map area. In response to a second user input defining one or more characters, location data are determined of at least one location associated with the one or more characters and lying within the search corridor. The technique may be used for searching for an intermediate or target location in connection with calculating a route.