Navigation Route Planning for Sightseeing Itineraries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional navigation devices are unable to effectively calculate sightseeing routes that start and finish at the same location, as their algorithms fail when the distance between the start and destination is zero, and they lack the ability to fine-tune itineraries according to individual preferences or specific journey times or distances.
Innovation Solution
A technique that calculates a route by determining an initial route, evaluating relative attraction values for nearby sightseeing attractions, and iteratively modifying the route to include the most attractive options within a user-defined cost limit, allowing for the creation of sightseeing routes that start and finish at the same location, and accommodating user preferences such as journey time and distance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional navigation algorithms are used to calculate routes, then the route calculation is simple and fast, but the algorithm fails when start and destination locations are the same (distance is zero)
Solution Approach 1:
The patent inverts the conventional route calculation approach by treating the problem as finding attractions within a circular search area centered at the start location, rather than finding a path between two distinct points. This inversion allows the algorithm to handle cases where start and destination are the same by searching for attractions within the defined radius instead of calculating a traditional route.
Solution Approach 2:
The patent changes the fundamental parameters of route calculation from origin-destination coordinates to a center-location-and-radius model. By defining the search area through a circular boundary parameter (radius) rather than requiring a distinct destination point, the system can generate sightseeing routes that start and end at the same location while maintaining algorithmic reliability.
2Productivity
If conventional route planning is used, then the routing process is quick, but the system cannot fine-tune itineraries according to individual preferences or specific journey times
Solution Approach 1:
The patent introduces dynamic filtering and sorting mechanisms that allow the route calculation to adapt to user preferences while maintaining efficiency. The system dynamically adjusts the attraction selection based on user-defined criteria (such as attraction types, time windows, and personal preferences) and sorts results according to multiple scoring factors, enabling customized itineraries without requiring complete recalculation from scratch.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating attraction scores, filtering attractions based on user preferences before final route assembly, and pre-organizing attractions by relevance. This preliminary processing allows the system to quickly generate customized routes by selecting from pre-evaluated options rather than evaluating all possible combinations during the final calculation phase.
3Quantity of substance
If multiple attractions are included in the route, then the sightseeing value increases, but the route distance and travel time increase
Solution Approach 1:
The patent changes the optimization parameter from minimizing pure distance to minimizing a composite cost function that balances attraction value against travel distance and time. By introducing weighted scoring that considers attraction importance, user preferences, and temporal constraints, the system can determine the optimal number and selection of attractions to include without excessive route extension.
Solution Approach 2:
The patent applies partial action by selectively including only those attractions that meet user-defined criteria and scoring thresholds, rather than attempting to include all possible attractions. The system performs partial route calculations for different attraction combinations and selects the optimal subset that provides sufficient sightseeing value within acceptable distance and time constraints.
Data Source
Figure 1~2
Figure 3
Figure 4a~4b
AI summary
A technique is disclosed for calculating a sightseeing route from a start location to a destination location. The start location and the destination location may be the same as each other or different. The route is calculated to pass one or more attractors each representing a sightseeing attraction. A digital database resource (500) contains digital map information, the digital map information including a plurality of attractors. The technique comprises (a) determining (550) an initial route from the start location to the destination location, and setting the initial route as a current route; (b) determining (602) for each attractor in a candidate set of the attractors, a relative attraction value that is dependent on a distance between the attractor and the current route; (c) determining (604, 612) which attractor corresponds to a largest attraction value; (d) modifying (620) the current route to include a deviation to the attractor determined at step (c).