IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v51y2020i14p2635-2652.html
   My bibliography  Save this article

Multiobjective coordinated search algorithm for swarm of UAVs based on 3D-simplified virtual forced model

Author

Listed:
  • Xinjie He
  • Shaowu Zhou
  • Hongqiang Zhang
  • Lianghong Wu
  • You Zhou
  • Yujuan He
  • Mao Wang

Abstract

This paper aims to tackle the problem of multiobjective search for swarms of UAVs in unknown complex environments and proposes a multiobjective coordinated search algorithm based on a 3D-simplified virtual forced model (MOCS-3D-SVFM). First, it decomposes the search behaviour into the roaming search state and coordinated search state based on the detection of target signals by a swarm of UAVs. Second, a nearest neighbour exclusion diffusion (NNED) algorithm is introduced for the UAV of the wander search state, and a 3D adaptive inertia weight extended particle swarm algorithm (IAEPSO) is proposed by combining the motion characteristics of UAV with a 3D particle swarm algorithm aiming at the UAV with coordinated search state. Finally, the 3D-simplified virtual force model proposed based on the concept of the 2D-simplified virtual force model by the rotation matrix is introduced to solve the model parameters and the control strategy under the UAV of wander search state and coordinated search state is established, which effectively solves the real-time obstacle avoidance problem. Moreover, this paper sets the comparison mode of the three search methods; compared to Mode1, the search time T and energy consumption S can be significantly reduced, and the numerical simulations verify its effectiveness.

Suggested Citation

  • Xinjie He & Shaowu Zhou & Hongqiang Zhang & Lianghong Wu & You Zhou & Yujuan He & Mao Wang, 2020. "Multiobjective coordinated search algorithm for swarm of UAVs based on 3D-simplified virtual forced model," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(14), pages 2635-2652, October.
  • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:14:p:2635-2652
    DOI: 10.1080/00207721.2020.1799110
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1799110
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2020.1799110?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:51:y:2020:i:14:p:2635-2652. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.