基于最小修正次数的飞行器修正路径规划

Aircraft Correction Path Planning Based on Minimum Correction Quantity

摘要: 本文研究了飞行器飞行过程中，所需经过校正点数量最少的路线规划问题。通过引入等效距离矩阵，使得终点约束条件线性化，以途经校正点数量最少为目标，建立了线性整数规划模型，通过标志矩阵设计隐枚举的过滤条件，从而提高运算效率，最终对求得的全局最优解进行成功飞行条件验证，验证通过。本模型准确，简单，算法效率高，问题中共计给出校正点588个，求出全局最优解用时4.3秒。

Abstract: This paper studies the route planning problem with the least number of calibration points. By introducing the equivalent distance matrix, the end constraint condition is linearized. A linear integer programming model is established to minimize the number of supply points. The filter conditions of implicit enumeration are designed by identification matrix, so that the operation efficiency is improved. Finally, the survival conditions of the global optimal solution are verified, and the verification is passed. This model is accurate, simple and efficient. A total of 588 supply points are given, and it takes 4.3 seconds to find the global optimal solution.