Multiple aerial vehicles cooperative mission planning with RHP

摘要

Multiple aerial vehicles cooperative mission planning is to solve the problem how aerial vehicles cooperatively complete missions, such as the cooperative attack on the ground targets. Recent researches on this topic don't consider the case that the threats disappear once the aggressive targets are destroyed, and ignore the difference of the priority of the selected target to be attacked. Considering all these factors, a planning algorithm based on rolling horizon procedure (RHP) is proposed in this paper. Simulation results show that the proposed algorithm can provide feasible solutions according to the latest battlefield situation.