3D Pathfinding Avionics Using Theta* and A* Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Efficient path finding in three dimensions is complicated due to the additional complexity compared to two dimensions, and existing algorithms often produce paths that are not feasible for real-world implementation, especially for aircraft navigating through three-dimensional spaces.
Innovation Solution
A path finding avionics system dynamically employs the A* and Theta* algorithms, bifurcating path finding operations between horizontal and vertical paths, using Theta* for horizontal paths and A* for vertical paths to maintain viable altitude changes, and combining these components to produce efficient three-dimensional paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a single path finding algorithm is used for three-dimensional navigation, then the implementation is simpler, but the path efficiency and feasibility deteriorate
Solution Approach 1:
The patent segments the path finding problem into two distinct components: horizontal path finding using Theta* algorithm and vertical path finding using A* algorithm. This segmentation allows each algorithm to be optimized for its specific dimension while maintaining overall system simplicity through modular architecture.
2Productivity
If the Theta* algorithm is used for horizontal paths, then path efficiency is improved, but handling vertical altitude changes becomes problematic
Solution Approach 1:
The patent separates horizontal and vertical path finding operations into distinct algorithmic processes. Theta* handles horizontal movement within altitude layers, while A* handles vertical transitions between layers, allowing each algorithm to excel at its specialized function.
Solution Approach 2:
The patent addresses the limitation of Theta* in handling vertical changes by introducing a separate vertical dimension processed by A*. This dimensional separation allows the system to leverage Theta*'s efficiency in 2D horizontal space while A* manages the third vertical dimension.
3Reliability
If the A* algorithm is used for vertical paths, then altitude change feasibility is improved, but horizontal path efficiency is reduced
Solution Approach 1:
The patent assigns A* specifically to vertical path finding where its systematic exploration ensures feasible altitude changes, while restricting its use in horizontal paths to preserve overall system efficiency through specialized algorithm deployment.
4Adaptability or versatility
If existing three-dimensional path finding algorithms are used, then three-dimensional navigation is achieved, but the paths are not feasible for real-world aircraft implementation
Solution Approach 1:
The patent enhances real-world feasibility by segmenting the navigation problem into horizontal flight segments (optimized by Theta*) and vertical climb/descent segments (optimized by A*), mirroring actual aircraft operational patterns and constraints.
Solution Approach 2:
The patent applies different algorithmic qualities to different spatial regions: Theta* provides efficient any-angle paths for horizontal navigation where aircraft can maneuver freely, while A* provides constrained vertical paths where altitude changes must follow specific flight procedures.
Data Source
AI summary
A three-dimensional path finding system bifurcates path finding operations between horizontal paths and vertical paths. Horizontal paths are identified according to the Theta* algorithm that produces direct, efficient paths that are viable in a horizontal plane. Vertical paths are identified according to the A* algorithm that produces paths that are viable for an aircraft changing altitude. The horizontal and vertical components are combined to produce a viable, efficient path in three dimensions.