Route Deviation Search Using Bidirectional Cost Exploration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Navigation systems lack the ability to efficiently search for points of interest along a route, considering the cost of deviation from and return to the route, and often require pre-programmed routes for such searches.
Innovation Solution
A navigation system incorporating a GPS module, user interface module, and routing engine that uses Dijkstra's algorithm for forward and reverse explorations to identify points of interest reachable within certain distance or time thresholds, allowing for on-demand searches even without pre-programmed routes, and providing users with along-route and off-route distance information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the navigation system performs comprehensive POI searches along the route, then the completeness of POI information is improved, but the computational complexity and processing time increase
Solution Approach 1:
The patent divides the POI search process into two independent segments: forward exploration from the route to POIs, and reverse exploration from POIs back to the route. This segmentation allows the system to independently calculate deviation costs and return costs, reducing the overall computational complexity while maintaining comprehensive POI coverage.
Solution Approach 2:
The system performs preliminary actions by pre-calculating the forward exploration results (deviation costs) and reverse exploration results (return costs) before combining them. This preliminary calculation of separate cost components enables efficient filtering and sorting of POIs based on total round-trip cost, reducing processing time during actual route planning.
2Measurement precision
If the navigation system calculates both forward and reverse exploration for POI searches, then the accuracy of route deviation assessment is improved, but the processing time increases
Solution Approach 1:
The patent implements continuous useful action by performing forward and reverse explorations simultaneously or in an optimized sequence, where both explorations work towards the same goal of identifying viable POIs. This continuous processing eliminates idle computation time and ensures that the system efficiently utilizes available processing resources to maintain accuracy while minimizing delays.
Solution Approach 2:
The system applies partial action by implementing threshold-based filtering during the exploration process. POIs that exceed predetermined deviation or return cost thresholds are eliminated early in the process, preventing unnecessary completion of full exploration paths for unlikely candidates. This partial exploration approach maintains assessment accuracy for promising POIs while reducing overall processing time by excluding improbable options.
Data Source
AI summary
A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.