多无人机协同任务规划  

Planning Route for UAV Cooperative Combat

作　　者：夏令儒 孙首群[1] XIA Lingru;SUN Shouqun(School of Mechanical Engineering,Shanghai University for Science and Technology,Shanghai200000,China)

机构地区：[1]上海理工大学机械工程学院,上海200082

出　　处：《电子科技》2018年第1期4-8,共5页Electronic Science and Technology

基　　金：国家科技支撑计划项目(2015BAK16B04)

摘　　要：为解决多无人机协同规划军事目标打击的问题,基于多旅行商(TSP)数字规划理论进行路径和时间的优化。文中建立了多旅行商(TSP)数字规划模型,并根据任务性能和区域划分理论,利用退火算法求解出该模型的最优解。使用A*路径规划算法,通过编程仿真规划出了无人机的时间最优路径。结果表明,该方法较好地解决了当前无人机协同作战的目标分配问题,大幅提高了无人机协同作战的能力。In order to solve the problem of multiple unmanned aerial vehicle cooperative planning military target attack,based on the theory of multiple traveling salesman(TSP)digital planning,path and the time of optimization.Multiple traveling salesman(TSP)was established by the digital planning model,and according to the theory of division and task performance,the annealing algorithm is used to derive the model of the optimal solution;Finally using the A*path planning algorithm,through the programming simulation time optimal path planning out of the unmanned aerial vehicle.Results show that the method solve the target assignment problem of unmanned aerial vehicle cooperative engagement,greatly improve the ability of the unmanned aerial vehicle cooperative engagement.

关 键 词：多无人机 模拟退火算法 A*算法 最优路径规划 协同作战 

分 类 号：TH256[机械工程—机械制造及自动化]