IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3794329.html
   My bibliography  Save this article

Cooperative Target Search of UAV Swarm with Communication Distance Constraint

Author

Listed:
  • Ning Wang
  • Zhe Li
  • Xiaolong Liang
  • Ying Li
  • Feihu Zhao

Abstract

This paper proposes a cooperative search algorithm to enable swarms of unmanned aerial vehicles (UAVs) to capture moving targets. It is based on prior information and target probability constrained by inter-UAV distance for safety and communication. First, a rasterized environmental cognitive map is created to characterize the task area. Second, based on Bayesian theory, the posterior probability of a target’s existence is updated using UAV detection information. Third, the predicted probability distribution of the dynamic time-sensitive target is obtained by calculating the target transition probability. Fourth, a customized information interaction mechanism switches the interaction strategy and content according to the communication distance to produce cooperative decision-making in the UAV swarm. Finally, rolling-time domain optimization generates interactive information, so interactive behavior and autonomous decision-making among the swarm members are realized. Simulation results showed that the proposed algorithm can effectively complete a cooperative moving-target search when constrained by communication distance yet still cooperate effectively in unexpected situations such as a fire.

Suggested Citation

  • Ning Wang & Zhe Li & Xiaolong Liang & Ying Li & Feihu Zhao, 2021. "Cooperative Target Search of UAV Swarm with Communication Distance Constraint," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-14, September.
  • Handle: RePEc:hin:jnlmpe:3794329
    DOI: 10.1155/2021/3794329
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/3794329.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/3794329.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/3794329?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
    ---><---

    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:hin:jnlmpe:3794329. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.