Minimum Overlapping Alternative Path Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Navigation and routing service providers face challenges in efficiently computing alternative paths that meet specific cost preferences or constraint parameters with minimal computational resources, especially when traditional paths do not meet user needs, requiring significant computational resources to find alternative routes with minimal overlap.
Innovation Solution
The method involves identifying critical and non-critical portions of a path, calculating candidate minimum overlapping alternative paths for the non-critical portions, and generating the minimum overlapping alternative path by combining the critical portion with selected candidate paths that satisfy the constraint parameter, using a geographic database to reduce computational resources needed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional path calculation methods are used to find alternative paths, then alternative paths can be found, but significant computational resources are required
Solution Approach 1:
The patent divides the original path into critical portions and non-critical portions. The critical portion contains links that must be included in any alternative path to satisfy constraint parameters, while the non-critical portion contains links that can be replaced. This segmentation allows the system to focus computational effort only on finding alternative routes for the non-critical portion, significantly reducing the search space and computational resources required while still ensuring that constraint parameters are met through the critical portion.
2Productivity
If computational resources are reduced for alternative path computation, then resource efficiency improves, but finding paths that meet constraint parameters becomes more difficult
Solution Approach 1:
The patent performs preliminary identification of critical portions and their associated constraint parameters before searching for alternative paths. By pre-determining which path segments must be preserved to satisfy constraints, the system establishes a foundation that guarantees constraint satisfaction. The subsequent search then only needs to find alternatives for non-critical portions, combining them with the pre-identified critical portions to form complete alternative paths that are guaranteed to meet the original constraints.
Data Source
AI summary
An approach is provided for generating a minimum overlapping alternative path. The approach involves receiving a constraint parameter for traversing a path between a first location and a second location. The approach also involves determining a critical portion of the path that is to be traveled to satisfy the constraint parameter, and designating a remaining portion of the path that is not the critical portion as a non-critical portion. The approach further involves calculating one or more candidate minimum overlapping alternative paths for the non-critical portion of the path. The approach further involves generating the minimum overlapping alternative path between the first location and the second location by combining the critical portion of the path with a selected one of the one or more candidate minimum overlapping alternative paths that satisfies the constraint parameter.