Genetic algorithm based approach for Multi-UAV cooperative reconnaissance mission planning problem

Authors:
Jing Tian;Lincheng Shen;Yanxing Zheng
Affiliations:
College of Mechatronic Engineering and Automation, National University of Defense Technology, Changsha, China;College of Mechatronic Engineering and Automation, National University of Defense Technology, Changsha, China;Beijing Institute of System Engineering, Beijing, China
Venue:
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Year:
2006

Citing 2
Cited 3

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Reactive tabu search in unmanned aerial reconnaissance simulations

Proceedings of the 30th conference on Winter simulation

Evolutionary path planner for UAVs in realistic environments

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolutionary trajectory planner for multiple UAVs in realistic scenarios

IEEE Transactions on Robotics
On the performance comparison of multi-objective evolutionary UAV path planners

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiple UAV cooperative reconnaissance is one of the most important aspects of UAV operations. This paper presents a genetic algorithm(GA) based approach for multiple UAVs cooperative reconnaissance mission planning problem. The objective is to conduct reconnaissance on a set of targets within predefined time windows at minimum cost, while satisfying the reconnaissance resolution demands of the targets, and without violating the maximum travel time for each UAV. A mathematical formulation is presented for the problem, taking the targets reconnaissance resolution demands and time windows constraints into account, which are always ignored in previous approaches. Then a GA based approach is put forward to resolve the problem. Our GA implementation uses integer string as the chromosome representation, and incorporates novel evolutionary operators, including a subsequence crossover operator and a forward insertion mutation operator. Finally the simulation results show the efficiency of our algorithm.