• DocumentCode
    619942
  • Title

    Research on PSO based multiple UAVs real-time task assignment

  • Author

    Lin Lin ; Sun Qibo ; Wang Shangguang ; Yang Fangchun

  • Author_Institution
    State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2013
  • fDate
    25-27 May 2013
  • Firstpage
    1530
  • Lastpage
    1536
  • Abstract
    Unmanned aerial vehicles (UAVs) have the capability of executing various missions. However, the capability of single UAV is limited. It may require multiple UAVs to form coalition and prosecute tasks cooperatively. So, multiple UAVs task assignment faces the problems of: (a) satisfy the heterogeneous resource requirement and (b) satisfy the task prosecution for real-time requirement. In this paper, a PSO based algorithm DCAA is proposed for UAVs task assignment. UAVs search for targets and try to form coalition when they find targets. Once formed, the coalition members will adjust their paths to prosecute the target simultaneously to induce maximum damage. The simulation results show that using the proposed algorithm, UAVs can complete mission in short time. And the mission completion percentage keeps at a high level. The proposed algorithm is suitable for real-time application.
  • Keywords
    autonomous aerial vehicles; particle swarm optimisation; real-time systems; PSO based algorithm DCAA; PSO based multiple UAV real-time task assignment; coalition members; heterogeneous resource requirement; maximum damage; mission completion percentage; real-time application; real-time requirement; single UAV; task prosecution; unmanned aerial vehicles; Algorithm design and analysis; Broadcasting; Equations; Qualifications; Real-time systems; Search problems; Simulation; Multiple UAVs; PSO Algorithm; Task Assignment; Time Windows;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2013 25th Chinese
  • Conference_Location
    Guiyang
  • Print_ISBN
    978-1-4673-5533-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2013.6561171
  • Filename
    6561171