Precomputed Junction Path Routing for Complex Facility Navigation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional routing systems in complex facilities like hospitals and military installations become computationally intensive when determining optimal routes, as they consider distance and time, and fail to account for user-specific factors such as security level and mode of transportation, especially when navigating through secured areas.

Innovation Solution

The system predefines paths to common junction points within a facility, allowing for efficient route determination by comparing paths from a source location to a junction point and from a destination location to the same junction point, excluding shared paths, and considers user-specific factors like security level and mode of transportation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional routing methods construct multiple routes and calculate desirability values based on distance and other considerations, then the route optimization is comprehensive, but the computational load becomes intense

Engineering Contradiction:
Improveroute optimization comprehensivenessVSAvoidcomputational load
Core Design Contradiction:
ReliabilityVSPower

Solution Approach 1:

The patent pre-calculates and stores optimal paths from each location to a common junction point before runtime. This preliminary action eliminates the need to construct and evaluate multiple routes during actual routing queries, dramatically reducing computational load while maintaining route optimization quality

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The routing problem is segmented into two independent parts: paths from source location to common junction point, and paths from destination location to common junction point. By storing these pre-calculated segments and combining them at runtime, the system avoids the computational intensity of evaluating complete end-to-end routes

Inventive Principle:
Principle #1Segmentation

2Productivity

If traditional routing methods determine routes based on distance and time, then the navigation is efficient in terms of travel, but it fails to account for user-specific factors such as security level and mode of transportation

Engineering Contradiction:
Improvenavigation efficiencyVSAvoiduser-specific factor consideration
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent applies different routing criteria to different users based on their local characteristics such as security level, mode of transportation, and accessibility needs. Instead of a universal routing approach, the system customizes path selection for each user context, making the routing adaptable while maintaining efficiency through pre-calculated paths

Inventive Principle:
Principle #3Local quality

3Measurement precision

If predefining a route for every combination of two locations is performed, then the route determination would be accurate, but the process becomes computationally intense and time consuming

Engineering Contradiction:
Improveroute determination accuracyVSAvoidpreprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent extracts only the necessary path segments (from each location to the common junction point) rather than pre-calculating all possible end-to-end routes. This extraction approach maintains route determination accuracy by preserving the essential routing information while dramatically reducing the amount of data that needs to be stored and processed

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS9574884B1Providing a route through a predefined space
Publication Date: 2017.02.21 CERNER INNOVATION INC
  • US9574884B1 patent drawing
  • US9574884B1 patent drawing
  • US9574884B1 patent drawing

AI summary

Methods, systems, and computer-readable media are provided to determine a route through a predefined space. A first path from a source location to a common path within the space is determined, as well as a second path from a destination location a common path. If a shared path, which is the part of the first path which overlaps a portion of the second path, exists, it is excluded. If any portion of the common path separates the first and second path, it is included. A route is returned which is the combination of the remaining path segments.