多约束条件下战斗机三维路径规划问题  

3D path planning problem for fighter aircraft with multiple constraints

作　　者：杨平 肖兵[1] 陈新[1] 唐璐琪 YANG Ping;XIAO Bing;CHEN Xin;TANG Luqi(Early Warning Academy,Wuhan 430000,China;Unit 93052 of the PLA,Changchun 130021,China)

机构地区：[1]空军预警学院,湖北武汉430000 [2]中国人民解放军93052部队,吉林长春130021

出　　处：《系统工程与电子技术》2024年第12期4213-4221,共9页Systems Engineering and Electronics

摘　　要：如何在现代战场环境中,为战斗机进行高效且安全的路径规划,同时考虑载机威胁、油耗、任务时限、转弯半径等多重限制因素,以提高作战效能。针对这些多方面需求,提出一种多约束条件下的战斗机路径规划方法,即将三维地形、威胁源、能耗、任务用时等限制条件综合考虑,构建改进粒子群优化算法中的聚合适应度函数,并使用极限曲率矩阵评估路径可飞性。此外,可以根据任务需求确定各约束条件对结果的权重。实验证明,该方法能够快速有效地生成符合要求的最优路径,并具备实际应用价值。In order to carry out efficient and safe path planning for fighter aircraft,multiple constraints such as carrier threat,fuel consumption,mission time frame,and turning radius,are considered simultaneously to improve combat effectiveness.In order to meet these requirements,a mutiple constraints path planning method is proposed for fighter aircraft,i.e.,considering the constraints of three-dimensional terrain,threat sources,energy consumption,mission time,etc.,constructing the aggregated fitness function in the improved particle swarm optimization algorithm,and evaluating the fly ability of the paths by using the limit curvature matrix.In addition,the weight of each constraint on the result can be determined according to the task requirements.Experiments prove that the method can quickly and effectively generate the optimal path that meets the requirements and has practical application value.

关 键 词：路径规划 多约束条件 粒子群优化算法 聚合适应度函数 威胁源 极限曲率矩阵 

分 类 号：N37[自然科学总论]