A hybrid route planning algorithm of single aerial vehicle attacking multiple targets

It´s an important tactical operation for single aerial vehicle to attack multiple targets in one flight, and its flight route has great impact on the attacking effect and its own safety. To optimize this flight route, a new hybrid algorithm was presented for the aerial vehicle, that is : firstly, use the Dynamic Programming(DP) to search routes in order to reduce the searching times and improve the efficiency of search; then use the improved Ant Colony algorithm(ACO) to select and order the targets. Simulations shown that it´s more quickly to obtain a reasonable attacking plan with the algorithm presented, which means the algorithm is effective.