Route Planning Tree Structure for Computing Time Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current route planning processes for vehicles, especially military aircraft, are computationally intensive due to the need to consider various risk factors and multiple possible routes, leading to high computing times and storage requirements.
Innovation Solution
The process is divided into two sub-problems: pre-computing optimized connecting routes between path points, and then selecting the most efficient route in real-time using a tree structure that accounts for costs and time conditions, allowing for reduced computing time during flight and flexible route adjustments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If route planning computes all possible connecting routes between path points considering risk factors, then route optimization quality is improved, but computing time increases significantly
Solution Approach 1:
The patent segments the route planning problem into two independent sub-problems: (1) computing all optimized connecting routes between individual path points pairs, and (2) selecting the optimal combination of these connecting routes to form the complete route. This segmentation allows the computationally intensive first step to be performed offline, while the second step can be executed quickly in real-time.
Solution Approach 2:
The patent performs preliminary computation of all possible connecting routes between path points before the actual flight or mission. These pre-computed connecting routes are stored and can be quickly retrieved and combined during real-time operations, eliminating the need to recompute them when conditions change or when final route selection is needed.
2Productivity
If multiple optimized connecting routes are pre-computed between path points, then real-time route selection capability is improved, but storage requirements increase
Solution Approach 1:
The patent performs preliminary computation of all possible connecting routes between path points before the actual flight or mission. These pre-computed connecting routes are stored and can be quickly retrieved and combined during real-time operations, eliminating the need to recompute them when conditions change or when final route selection is needed.
3Adaptability or versatility
If complete route optimization is performed in real-time, then adaptability to changing conditions is improved, but computing time during flight increases
Solution Approach 1:
The patent segments the route planning problem into two independent sub-problems: (1) computing all optimized connecting routes between individual path points pairs, and (2) selecting the optimal combination of these connecting routes to form the complete route. This segmentation allows the computationally intensive first step to be performed offline, while the second step can be executed quickly in real-time.
Solution Approach 2:
The patent enables dynamic route adjustment by allowing the selection of different pre-computed connecting routes based on changing conditions during flight. The system can adaptively choose from multiple pre-calculated options without requiring complete re-computation, maintaining flexibility while minimizing computing time.
Data Source
AI summary
A process for determining a route along more than two mutually consecutive preset path points with given connecting routes in-between. In this case, a plurality of connecting routes is given between at least one pair of two mutually consecutive path points. Respective costs and preferably also a respective time duration are assigned to each connecting route. In a first step of the process, a tree is generated which comprises edges and nodes connected by edges. Each node is assigned to a defined path point and each edge corresponds to a connecting route. The route is determined based on a selection of edges of the tree.