Dynamic Static Data Structure Conversion for Navigation Pathfinding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Navigation applications face inefficiencies in processing resources due to the limitations of static and dynamic data structures when determining shortest paths, as static structures are inflexible but quick to load, while dynamic structures are efficient for modifications but slow to load data.

Innovation Solution

A cloud management platform dynamically converts between static and dynamic data structures to conserve resources, using static structures for stable data points like interstate highways and dynamic structures for changing points like local streets, thereby optimizing processing and network resource usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If a static data structure is used for navigation data, then data loading speed is improved, but flexibility for modifications deteriorates

Engineering Contradiction:
Improvedata loading speedVSAvoidflexibility for modifications
Core Design Contradiction:
SpeedVSAdaptability or versatility

Solution Approach 1:

The navigation data is segmented into two categories: stable data (interstate highways) stored in static data structures and dynamic data (local streets) stored in dynamic data structures. This segmentation allows each type of data to be managed with the most appropriate data structure, resolving the contradiction between loading speed and modification flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different data structures are applied to different portions of the navigation data based on their specific characteristics. Static data structures (arrays) are used for stable interstate highway data where fast access is critical, while dynamic data structures (linked lists) are used for local street data that requires frequent modifications. This local quality approach optimizes both loading speed and flexibility where needed.

Inventive Principle:
Principle #3Local quality

2Adaptability or versatility

If a dynamic data structure is used for navigation data, then flexibility for modifications is improved, but data loading speed deteriorates

Engineering Contradiction:
Improveflexibility for modificationsVSAvoiddata loading speed
Core Design Contradiction:
Adaptability or versatilityVSSpeed

Solution Approach 1:

The navigation data is segmented into two categories: stable data (interstate highways) stored in static data structures and dynamic data (local streets) stored in dynamic data structures. This segmentation allows each type of data to be managed with the most appropriate data structure, resolving the contradiction between loading speed and modification flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different data structures are applied to different portions of the navigation data based on their specific characteristics. Static data structures (arrays) are used for stable interstate highway data where fast access is critical, while dynamic data structures (linked lists) are used for local street data that requires frequent modifications. This local quality approach optimizes both loading speed and flexibility where needed.

Inventive Principle:
Principle #3Local quality

3Productivity

If static data structures are used for all navigation data, then processing resources are conserved, but ability to handle changing data deteriorates

Engineering Contradiction:
Improveprocessing resource efficiencyVSAvoidability to handle changing data
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The navigation data is segmented into two categories: stable data (interstate highways) stored in static data structures and dynamic data (local streets) stored in dynamic data structures. This segmentation allows each type of data to be managed with the most appropriate data structure, resolving the contradiction between loading speed and modification flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different data structures are applied to different portions of the navigation data based on their specific characteristics. Static data structures (arrays) are used for stable interstate highway data where fast access is critical, while dynamic data structures (linked lists) are used for local street data that requires frequent modifications. This local quality approach optimizes both loading speed and flexibility where needed.

Inventive Principle:
Principle #3Local quality

4Adaptability or versatility

If dynamic data structures are used for all navigation data, then ability to handle changing data is improved, but processing resources are consumed faster

Engineering Contradiction:
Improveability to handle changing dataVSAvoidprocessing resource efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The navigation data is segmented into two categories: stable data (interstate highways) stored in static data structures and dynamic data (local streets) stored in dynamic data structures. This segmentation allows each type of data to be managed with the most appropriate data structure, resolving the contradiction between loading speed and modification flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different data structures are applied to different portions of the navigation data based on their specific characteristics. Static data structures (arrays) are used for stable interstate highway data where fast access is critical, while dynamic data structures (linked lists) are used for local street data that requires frequent modifications. This local quality approach optimizes both loading speed and flexibility where needed.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS10337875B2Converting between data structures to determine a shortest path between two geographic locations
Publication Date: 2019.07.02 VERIZON PATENT & LICENSING INC
  • US10337875B2 patent drawing
  • US10337875B2 patent drawing
  • US10337875B2 patent drawing

AI summary

A device can receive a request to determine a set of navigational directions, and can obtain a set of traffic objects associated with a first map layer. The set of traffic objects can include nodes to identify one or more geographic locations and one or more links to identify one or more geographic areas between the nodes. The device can determine a shortest-path tree by analyzing the set of traffic objects, the shortest-path tree being associated with a static data structure. The device can generate a dynamic data structure that includes the shortest-path tree and a set of additional traffic objects associated with a second map layer. The device can determine a shortest path by analyzing traffic objects associated with the shortest-path tree and the set of additional traffic objects. The device can provide the set of navigational directions to indicate the shortest path.