Loop-Based Route Finding for Navigation Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation systems face inefficiencies in route generation due to the rapid frequency of route requests in wireless client-server navigators, leading to increased computing time, memory, and power requirements as the size of the map increases.
Innovation Solution
The method involves representing a map as a set of continuous loops, allowing for the identification of loops connecting a starting point to a destination, and using these loops to formulate a route efficiently, with optional application of speed-up algorithms and heuristics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional route search methods are used on large maps, then route finding is possible, but computing time, memory, and power requirements increase dramatically
Solution Approach 1:
The patent segments the map into multiple tiles or regions, allowing the route search to be divided into smaller sub-problems. Each tile can be processed independently or in parallel, reducing the computational burden on any single processing unit and enabling efficient route finding across large maps without requiring excessive computing time or memory.
2Reliability
If traditional route search methods are used on large maps, then route finding is possible, but memory requirements increase dramatically
Solution Approach 1:
The map is divided into discrete tiles that can be loaded into memory on-demand. Only the tiles relevant to the current route search need to be in memory, significantly reducing the memory footprint compared to loading entire large maps. This segmentation allows the system to handle large-scale maps with limited memory resources.
3Reliability
If traditional route search methods are used on large maps, then route finding is possible, but power consumption increases
Solution Approach 1:
By segmenting the map into tiles and processing only relevant portions, the system reduces the total computational work required, which directly translates to lower power consumption. The segmented approach enables early termination of searches in irrelevant tiles and allows for more efficient use of processing cycles, reducing overall energy usage.
Solution Approach 2:
The patent applies partial search strategies where the algorithm searches only through necessary portions of the map rather than exhaustively searching all possible paths. This partial action approach finds sufficient routes without performing excessive computations, thereby reducing power consumption while maintaining route finding capability.
4Adaptability or versatility
If map size increases, then more route options are available, but the number of possibilities to consider grows very quickly
Solution Approach 1:
The segmentation of the map into tiles naturally limits the number of possibilities that need to be considered at any given time. By confining the search to relevant tiles and using spatial indexing, the system maintains adaptability to provide multiple route options while preventing the combinatorial explosion of possibilities that would occur with exhaustive search of entire large maps.
Data Source
AI summary
A navigation system and method uses loops as opposed to existing search techniques to more expeditiously find routes on a map from a starting point to a destination. Roads on a map are traced to form one or more continuous loops. Information regarding the loops is stored for future reference. A starting point and at least one destination are specified, and loops that connect the loops containing the starting point and destination are determined. A route is then formulated from the starting point to the destination using road segments or intersections where the identified loops are mutually contiguous. A list is generated including the loops and the road segments associated therewith. The road segments of an initial loop are examined and, if a road segment or intersection common to a next loop is identified, the road segments of that loop are examined, and so on, until a route from the starting point to the destination is found. Alternatively the route may be formulated by searching for routes along the roads that form one or more continuous loops connecting the starting point and the destination. Various speed-up algorithms and/or heuristics may be applied to the route formulation. The method finds application is many fields of endeavor, including wireless client-server navigation; embedded/dedicated automotive navigation, and logistics control, to name a few.