一类新算法研究智能飞行器航迹规划问题

A New Method for Route Planning of Intelligent Aircraft Problems

智能飞行器航迹规划问题是一个大范围多目标多约束的三维规划问题,这类问题可以归属于路径规划问题,在满足相应条件的同时要求在较短的时间内以较短的路程到达目的地。本文把航迹的约束条件转化到实际问题中,通过对A*算法的改进,建立起符合飞行器航迹规划的两种算法模型。通过两种方案算法的比较,在两种情况下,算法程序实现得到航迹规划结果表和路径图。算法的有效性和复杂度分析结果表明,给出的求解算法是十分有效的。

The intelligent aircraft route planning problem is a three-dimensional planning problem which is large-scale, multi-objective and multi-constraint. Such problems can be attributed to the path planning problem, which requires shorter paths to reach the destination in a shorter time while satisfying the corresponding conditions. This paper transforms the constraints of the track into practical problems, and through the improved A* algorithm, establishes two algorithm models that conform to the flight route planning of the aircraft. By comparing the two schemes, in two cases, the algorithm program can obtain the track planning result table and path map. The validity and complexity show that the proposed algorithm is very effective.