Genetic Algorithm Based Approach for Multi-UAV Cooperative Reconnaissance Mission Planning Problem

  • Jing Tian
  • Lincheng Shen
  • Yanxing Zheng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4203)


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.


Genetic Algorithm Feasible Solution Travel Salesman Problem Mixed Integer Linear Program Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ryan, J.L., Bailey, T.G., Moore, J.T., Carlton, W.B.: Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations. In: Proceedings of the 1998 Winter Simulation Conference, Grand Hyatt, Washington, DC, pp. 873–879 (1998)Google Scholar
  2. 2.
    Hutchison, M.G.: A Method for Estimating Range Requirements of Tactical Reconnaissance UAVs. In: AIAA’s 1st Technical Conference and Workshop on Unmanned Aerospace Vehicles, Portsmouth, Virginia, pp. 120–124 (2002)Google Scholar
  3. 3.
    Ousingsawat, J., Campbell, M.E.: Establishing Trajectories for Multi-Vehicle Reconnaissance. In: AIAA Guidance, Navigation, and Control Conference and Exhibit, Providence, Rhode Island, pp. 1–12 (2004)Google Scholar
  4. 4.
    Savelsbergh, M.W.P.: Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285–305 (1985)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Thangiah, S.R.: Vehicle Routing with Time Windows using Genetic Algorithms. In: Chambers, L. (ed.) Practical Handbook of Genetic Algorithms: New Frontiers, II, pp. 253–277 (1995)Google Scholar
  6. 6.
    Ombuki, B., Ross, B.J., Hanshar, F.: Multi-oblective Genetic Algorithms for Vehicle Routing Problem with Time Windows. Technical Report \(\sharp\) CS-04-2. Brock University (2004)Google Scholar
  7. 7.
    Berger, J., Barkaoui, M., Bräysy, O.: A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Working paper, Defense Research Establishment Valcartier, Canada (2001)Google Scholar
  8. 8.
    Solomon, M.M.: Algorithms for Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Reasearch 35(2), 254–265 (1987)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jing Tian
    • 1
  • Lincheng Shen
    • 1
  • Yanxing Zheng
    • 2
  1. 1.College of Mechatronic Engineering and AutomationNational University of Defense TechnologyChangshaChina
  2. 2.Beijing Institute of System EngineeringBeijingChina

Personalised recommendations