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

Abstract:

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.

Key words: unmanned aerial vehicle;simulated annealing algorithm;A * algorithm;the optimal path planning;operation