Route Generation System Using Dynamic Segment Penalty Modes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing navigation systems fail to effectively generate routes that avoid segments identified as unsuitable for a specific vehicle profile, leading to either the inability to find a suitable route or guiding the user through unsuitable paths.
Innovation Solution
A method and system that penalize segments identified in a vehicle profile during route generation, allowing users to decide whether to take the generated route, which includes penalizing or blocking segments based on vehicle-specific attributes to create a more suitable path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If segments identified in a vehicle profile are blocked during route generation, then routes avoiding unsuitable segments are improved, but the ability to find any route at all deteriorates when no alternative exists
Solution Approach 1:
The system dynamically adjusts the treatment of restricted segments based on route generation success. Initially, segments matching the vehicle profile are blocked (strict mode). When no route is found, the system transitions to penalizing these segments instead (lenient mode), allowing the routing algorithm to consider them with reduced priority. This dynamic switching resolves the contradiction by adapting the constraint strength to the situation.
Solution Approach 2:
The system changes the parameter of segment restriction from binary (blocked/not blocked) to a spectrum (blocked/penalized). By introducing penalty weights that reduce the attractiveness of restricted segments rather than completely eliminating them, the system maintains route finding capability while still preferring suitable segments. This parameter transformation allows flexible adjustment between reliability and productivity.
2Reliability
If all segments identified in a vehicle profile are strictly avoided, then route safety and suitability are improved, but user flexibility and option to choose restricted segments deteriorates
Solution Approach 1:
The system prepares multiple route options in advance - one that strictly avoids restricted segments and another that may include them with penalties. By generating alternative routes with different constraint levels, the system prevents the user from being forced into an unsuitable route while maintaining the preference for suitable segments. This preliminary preparation of alternatives resolves the contradiction between safety and flexibility.
Solution Approach 2:
The system allows users to dynamically adjust the strictness of segment restrictions. Users can choose between different routing modes (e.g., avoid restricted segments completely vs. consider them with penalties). This dynamic user control enables adaptation between reliability and versatility based on user preferences and situational needs.
3Reliability
If route generation penalizes restricted segments, then routes avoiding unsuitable segments are improved, but computational complexity increases due to multiple routing attempts
Solution Approach 1:
The system performs preliminary identification and marking of restricted segments based on the vehicle profile before actual route generation. By pre-processing and tagging segments that match the vehicle profile characteristics, the system prepares the routing algorithm to efficiently handle these segments during route calculation. This preliminary action reduces the complexity during the actual routing process by having the work done in advance.
Solution Approach 2:
The system extracts and separates the identification of restricted segments from the main route generation process. By isolating the segment identification logic and applying it as a pre-processing step, the system simplifies the core routing algorithm. The extracted restricted segment information is then used to guide the routing process without adding complexity to the fundamental path-finding logic.
Data Source
Figure 1~3
Figure 2
Figure 4~5
AI summary
A method is disclosed for generating a route in an area covered by an electronic map. The map comprises a plurality of segments representing navigable elements of a navigable network in the area covered by the electronic map. A selection of a profile is received, e.g. from a user, said profile comprising data identifying one or more segments of the electronic map. A route is generated between an origin and a destination in the electronic map using a routing process in which each of the one or more segments identified by the selected profile is penalised. Any segments in the generated route that are segments identified by the selected profile are detected, and data representative of said generated route and said detected segments are output, e.g. for provision to a user.