Alternative Route Generation Using Distance-Based Segment Penalties
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation systems struggle to generate alternative routes that differ appropriately from a first route, particularly for shorter distances where drivers desire significant deviation, while longer routes may only require minor adjustments.
Innovation Solution
A method and system that penalize specific segments of a first route based on distance, making them less favorable for alternative route generation, allowing for routes to diverge more significantly for shorter distances and less so for longer distances.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a fixed penalty is applied to central route segments for alternative route generation, then alternative routes will differ significantly from the original route, but this causes excessive deviation for longer journeys where minor adjustments are sufficient
Solution Approach 1:
The penalty value applied to central route segments is made dynamic rather than fixed. The penalty is calculated as a function of the total route length, specifically penalty = k/L where k is a constant and L is the route length. This allows the system to automatically adapt the deviation strength based on journey distance, providing significant alternatives for short trips while maintaining similarity for long journeys.
Solution Approach 2:
The system changes the penalty parameter based on the route length parameter. By making the penalty value dependent on L (route length), the system transforms a static routing approach into a dynamic one that automatically adjusts its behavior according to the specific journey characteristics, resolving the contradiction between needing large deviations for short routes and small deviations for long routes.
2Adaptability or versatility
If route segments are penalized to generate alternatives, then alternative routes become more diverse, but the system complexity increases due to dynamic penalty calculation
Solution Approach 1:
The system employs a simple parametric relationship (penalty = k/L) rather than complex algorithms. This mathematical formula provides the necessary dynamic adjustment while keeping the computational complexity low, allowing the system to generate diverse alternative routes without requiring sophisticated penalty calculation mechanisms.
Data Source
AI summary
A method is disclosed for generating routes in an area covered by an electronic map. The map comprises a plurality of segments representing navigable segments of a navigable network in the area covered by the electronic map. A first route is generated between a first location and a second location in the area. A central portion of the first route is defined, wherein the central portion has an extent along the first route that is determined based on a distance between the first and second locations. The relative extent of the central portion along the first route is inversely related to the distance between the first and second locations. One or more navigable segments forming the defined central portion along the first route are identified, and a cost penalty applied to the identified navigable segment(s) so as to make the segment(s) less favourable when a route is generated through the navigable network. An alternative route is then generated between the first location and second location.