Aircraft Flight Path Planning Using Block Topology Graphs

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing path planning methods for aircrafts, such as scatter-based and search-based methods, are inefficient in large or complex environments, requiring excessive calculation time and reducing path planning efficiency.

Innovation Solution

A flight path determining method that divides the target space into blocks based on spatial points and their connections, determining a block path and entrance/exit information to plan a flight path efficiently, using a topological graph and path finding algorithms.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If scatter-based or search-based path planning methods are used, then flight path can be determined, but computational complexity is high and planning efficiency is low in complex environments

Engineering Contradiction:
Improveflight path planning efficiencyVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent divides the continuous three-dimensional space into discrete blocks with integer coordinates. Each block represents a simplified volumetric unit that can be easily processed. This segmentation transforms the complex continuous space planning problem into a discrete block-based problem, significantly reducing computational complexity while maintaining planning efficiency in complex urban environments with buildings and obstacles.

Inventive Principle:
Principle #1Segmentation

2Area of stationary object

If traditional path planning methods are used in large areas, then complete path coverage is achieved, but computational time increases significantly

Engineering Contradiction:
Improvecoverage areaVSAvoidcomputational time
Core Design Contradiction:
Area of stationary objectVSLoss of time

Solution Approach 1:

The patent introduces a topological graph dimension that represents spatial relationships between blocks. By mapping the three-dimensional block space onto a two-dimensional topological graph where nodes represent blocks and edges represent connectivity, the system enables efficient path finding across large areas. This dimensional transformation allows rapid determination of connection sequences without exhaustive computational search through the entire three-dimensional space.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS12614465B2Flight path determination
Publication Date: 2026.04.28 BEIJING SANKUAI ONLINE TECH CO LTD
  • US12614465B2 patent drawing
  • US12614465B2 patent drawing
  • US12614465B2 patent drawing

AI summary

A flight path determining method is provided. In some embodiments, the method includes determining, according to a flight origin and destination of an aircraft and a topological graph corresponding to blocks in a target space, a block path that the aircraft passes through from the flight origin to the flight destination from the blocks, where flight origin and destination are in the target space, there are spatial points with position information in the target space, and each block includes a spatial point group obtained by grouping the spatial points; determining entrance and exit information of each block in block path according to position information of each spatial point and block path; and determining a flight path of aircraft according to position information of each spatial point, position information of flight origin and destination, connections between spatial points, block path, and entrance and exit information of each block in block path.