Configurable Route Generation for Loop Navigation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing route planning programs require a destination different from the starting location, limiting their ability to generate routes that begin and end at the same point based on a specified distance, which is not flexible for users who want to traverse a route without a specific endpoint.

Innovation Solution

A computer-readable medium with program instructions that access location-relevant cartographic data, receive input selections, convert them to coordinates, and deliver a distance input to a routing algorithm to generate a route that begins and ends at the starting location, allowing for configurable routes based on user-defined distances and criteria.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If existing route planning programs require a destination different from the starting location, then the routing algorithm can generate a valid route, but the system lacks flexibility for users who want to traverse a route without a specific endpoint

Engineering Contradiction:
Improveroute configuration flexibilityVSAvoiduser input requirement
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The system dynamically adapts its routing requirements based on user selection. When loop route mode is selected, the destination field becomes optional or defaults to the starting location, allowing the system to flexibly handle both traditional point-to-point routing and loop routing scenarios without requiring separate systems

Inventive Principle:
Principle #15Dynamics

2Adaptability or versatility

If the system allows users to specify a distance for loop routes, then user preferences are accommodated, but the routing algorithm complexity increases

Engineering Contradiction:
Improvedistance-based route configurationVSAvoidrouting algorithm complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system changes the routing parameters based on the selected mode. For loop routes with distance specification, the algorithm uses the starting location as both origin and destination while incorporating the distance constraint as an additional parameter, allowing the same routing algorithm to handle multiple scenarios by adjusting parameters rather than requiring separate algorithms

Inventive Principle:
Principle #35Parameter changes

3Adaptability or versatility

If the route begins and ends at the same location, then loop routes are generated, but existing routing algorithms cannot process this scenario

Engineering Contradiction:
Improveloop route generationVSAvoidalgorithm compatibility
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

Instead of modifying the routing algorithm to handle the special case of origin equals destination, the system inverts the approach by using the same starting location for both fields and relying on the mode selection to trigger appropriate handling, effectively treating the loop route as a standard route where the user explicitly indicates they want to return to the start

Inventive Principle:
Principle #13The other way round (Inversion)

Data Source

PatentUS11982536B2Configurable routes
Publication Date: 2024.05.14 FASTZACH
  • US11982536B2 patent drawing
  • US11982536B2 patent drawing
  • US11982536B2 patent drawing

AI summary

An example configurable route based on a distance input causing a device to access location relevant cartographic data and present the location relevant cartographic data on a display on the device. The instructions are executable to receive a plurality of input selections to the location relevant cartographic data, convert the plurality of input selections to a plurality of coordinates, receive a distance input and deliver the plurality of coordinates and the distance input to a routing algorithm, and to receive a route generated therefrom that begins at a starting location and ends at the starting location and has a length substantially equal to the distance input.