• DocumentCode
    622564
  • Title

    Cooperative task planning for multiple autonomous UAVs with graph representation and genetic algorithm

  • Author

    Geng, L. ; Zhang, Y.F. ; Wang, J. Jay ; Fuh, J.Y.H. ; Teo, S.H.

  • Author_Institution
    Dept. of Mech. Eng., Nat. Univ. of Singapore, Singapore, Singapore
  • fYear
    2013
  • fDate
    12-14 June 2013
  • Firstpage
    394
  • Lastpage
    399
  • Abstract
    This paper addresses the mission planning issues for guiding a group of UAVs to carry out a series of tasks, namely classification, attack, and verification, against multiple targets. The flying space is constrained with the presence of flight prohibit zones (FPZs) and enemy radar sites. The solution space for task assignment and sequencing is modeled with a graph representation. With a path formation based on Dubins vehicle paths, a genetic algorithm (GA) has been developed for finding the optimal solution from the graph to achieve the following goals: (1) completion of the three tasks on each target, (2) avoidance of FPZs, (3) low level of exposure to enemy radar detection, and (4) short overall flying path length. A case study is presented to demonstrate the effectiveness of the proposed methods.
  • Keywords
    aerospace robotics; autonomous aerial vehicles; cooperative systems; genetic algorithms; graph theory; mobile robots; path planning; radar detection; Dubins vehicle path; FPZ; attack task; cooperative task planning; enemy radar detection; enemy radar site; flight prohibit zone; flying space; genetic algorithm; graph representation; mission planning; multiautonomous UAV; path formation; task assignment; task classification; verification task; Biological cells; Educational institutions; Genetic algorithms; Mechanical engineering; Radar detection; Turning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Automation (ICCA), 2013 10th IEEE International Conference on
  • Conference_Location
    Hangzhou
  • ISSN
    1948-3449
  • Print_ISBN
    978-1-4673-4707-5
  • Type

    conf

  • DOI
    10.1109/ICCA.2013.6564991
  • Filename
    6564991