Air route planning method and air route planning apparatus

Abstract

The embodiment of the invention provides an air route planning method and an air route planning apparatus, and belongs to the technical field of navigation. The air route planning method comprises: determining target objects possibly occurring collision during travelling along respective corresponding planning movement paths according to object models of three-dimensional blocks obtained by dissecting a three-dimensional space region on a two-dimensional plane and codes set for the object models; and performing movement path planning on the target objects possibly occurring collision again in the three-dimensional space region. With the method and the apparatus of the present invention, the spatial planning computation workload and the movement law complexity are reduced so as to improve the air route planning efficiency.

Description

technical field [0001] The embodiments of the present invention relate to the technical field of navigation, and in particular to a route planning method and device. Background technique [0002] In the aviation industry such as military aviation, civil aviation, general aviation, and unmanned aerial vehicles, space management and control issues have become one of the most concerned application issues. Multiple targets lead to increasing pressure on space control; on the other hand, the changes in the movement rules of aircraft in space are becoming more and more complex, which makes the calculation amount of route planning increase geometrically, and the calculation complexity is getting higher and higher. The computational efficiency of route planning is low. [0003] Therefore, how can we effectively reduce the complexity of calculation and make the calculation of route planning more efficient, so as to further improve the efficiency of space use, avoid the risk of colli...

AI Technical Summary

Problems solved by technology

However, this solution used in the prior art uses a large number of floating-point operations to solve complex equations. Due to the limitation of computational complexity, it is generally only applicable to a small number of target aircraft in the airspace with uncomplicated motion laws. , once the number of target aircraft in the airspace increases to a certain number, or when the law of motion and trajectory are relatively complex, there will be a computational bottleneck problem: either the amount of calculation and complexity will increase exponentially, and general hardware resources are difficult to handle; or Difficult to formulate vector equations, completely impossible to solve

[0006] In the planning process of this system, a large number of floating-point operations are used to solve complex equations. Due to the limitation of computational complexity, it is generally only possible to calculate and plan hundreds of simple moving target aircraft at the same time. Once the required number of target aircraft reaches The continuous increase and complex changes in the law of motion, such as the situation where multiple target aircraft such as aircraft and missiles occupy the same airspace at the same time, will lead to a geometric progression in the calculation of space planning, and the complexity of the law of motion is higher , making it even impossible to solve the above complex equation

Images