特定多任务下飞机航迹规划研究  

Research on Flight Route Planning for Specific Multi-missions

作　　者：钟麟[1] 佟明安[2] 李盛[1] Zhong Lin;Tong Ming'an;Li Sheng(College of Electronic Information,Xijing University,Xi'an 710123,China;College of Electronic Information,Northwestern Polytechnical University,Xi'an 710072,China)

机构地区：[1]西京学院电子信息学院,陕西西安710123 [2]西北工业大学电子信息学院,陕西西安710072

出　　处：《系统仿真学报》2023年第9期1909-1917,共9页Journal of System Simulation

基　　金：国家自然科学基金(11974289)。

摘　　要：为了更好地完成航空特定任务,提出了特定多任务下飞机航迹规划模型。采用栅格法建立战场环境模型,根据复杂、真实战场环境以及作战要求,提出了距离、油耗、任务完成度、地对空威胁和空对空威胁5个目标航迹规划的模型。根据特定任务的要求,分析了满足任务的各种需求,给出了评估任务完成度指标。根据该问题的特点,提出一种两阶段的航迹规划求解算法。第一个阶段用简化二维路径规划模型计算多任务顺序,第二阶段根据多任务顺序使用改进A*算法求解多目标栅格优化问题,解决了A^(*)算法不能处理时变优化问题情况。仿真结果表明该方法能很好地解决多任务、多目标航迹规划问题,比目前的算法更高效。In order to complete specific aviation missions,a flight route planning model for specific multi-missions is presented.The grid method is used to build a battlefield environment model.According to the complex and real battlefield environment and operational requirements,five target route planning models including distance,fuel consumption,mission completion,ground-to-air threat,and air-to-air threat are proposed.On the basis of specific mission demands,several requirements for missions are analyzed,and the index of mission completion is presented.According to the problem's characteristics,the two-stage solution algorithm for route planning is proposed.In the first stage,the multi-mission sequence is calculated by simplifying a two-dimensional route planning model.In the second stage,the modified A^(*)algorithm is used to solve the multi-target grid optimization problem according to the multimission sequence,and the failure of the A*algorithm to handle time-varying optimization is solved.The simulation results show the method can manage multi-mission and multi-target route planning more effectively than the present algorithms.

关 键 词：任务航迹规划 多目标优化 任务需求 威胁 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论] TP391.1[自动化与计算机技术—计算机科学与技术]