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

Distributed synchronous cooperative tracking algorithm for ground moving target in urban by UAVs

Author

Listed:
  • Chaofang Hu
  • Ge Qu
  • Hyo-Sang Shin
  • Antonios Tsourdos

Abstract

In this paper, a cooperative path planning method is proposed to track the unknown ground moving target by multiple unmanned aerial vehicles (UAVs). The kinematic UAV model with dual-input including commanded speed and heading rate is adopted, and the unknown target state is forecasted by the Extended Kalman Filter (EKF) with probability estimate. The cooperative path planning with multiple objectives and priorities is designed, where the infrastructure occlusion to line of detection sight and energy consumption are considered. Three optimisation objectives are fuzzified, and the priority is modelled by the relaxed order of satisfactory degrees. With the synchronous communication, the collision avoidance constraints and compatibility constraints under communication delay are designed. Moreover, the obstacle avoidance constraints with high buildings are addressed. Based on the distributed receding horizon control (RHC), the fuzzy multi-objective synchronous cooperative tracking model is built, and the optimal path of UAVs can be obtained by regulating the parameter. The algorithm to find the bound of regulation parameter is developed based on Karush–Kuhn–Tucker (KKT) condition. Finally, simulation results verify that the proposed method is effective and reliable.

Suggested Citation

  • Chaofang Hu & Ge Qu & Hyo-Sang Shin & Antonios Tsourdos, 2021. "Distributed synchronous cooperative tracking algorithm for ground moving target in urban by UAVs," International Journal of Systems Science, Taylor & Francis Journals, vol. 52(4), pages 832-847, March.
  • Handle: RePEc:taf:tsysxx:v:52:y:2021:i:4:p:832-847
    DOI: 10.1080/00207721.2020.1844340
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2020.1844340?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:52:y:2021:i:4:p:832-847. 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.