Optimization and improvement for multi-UAV cooperative reconnaissance mission planning problem

The Multi-UAV cooperative reconnaissance mission planning is one of the task allocation and resource scheduling problems during the multi-UAV cooperative control. The key to solve this problem is to build a reasonable solving-model and find an effective solving-algorithm. Based on the analysis of characteristics about reconnaissance missions, this paper takes plenty of constraints and performance planning targets in multi-UAV cooperative reconnaissance mission planning problems into full consideration, in particular the number of surveillance for targets, the reconnaissance time, the types of load requirements, and also the performance requirements of UAV, and thus establishes a more practical mathematical model for the multi-base, multi-target, multi-UAV cooperative reconnaissance problem. What is more, for the problems existed when dealing with the model, such as NP-hard and complex constraints, this paper has designed a modified genetic algorithm, based on the classical one, and meanwhile constructed the initial feasible solutions through a heuristic method, which would avoid the over-slow convergence in the process of evolutionary to a large degree.