IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0327016.html
   My bibliography  Save this article

Planning trajectory for UAVs using the self-organizing migrating algorithm

Author

Listed:
  • Quoc Bao Diep
  • Thanh-Cong Truong
  • Ivan Zelinka

Abstract

Ensuring efficient and safe trajectory planning for UAVs in complex and dynamic environments is a critical challenge, especially for UAVs that are increasingly deployed in applications like environmental monitoring, disaster management, and surveillance. The primary complications in the safe control of UAVs include real-time obstacle avoidance, adaptation to unpredictable environmental changes, and coordination among multiple UAVs to prevent collisions. This paper addresses these challenges by proposing a novel approach for UAV trajectory planning that integrates obstacle avoidance and target acquisition. We introduce a new cost function designed to minimize the distance to the target while maximizing the distance from obstacles, effectively balancing these competing objectives to ensure safety and efficiency. To optimize this cost function, we employ the self-organizing migrating algorithm, a swarm intelligence algorithm inspired by the cooperative and competitive behaviors observed in natural organisms. Our method enables UAVs to autonomously generate safe and efficient paths in real-time, adapt to dynamic changes, and scale to large swarms without relying on centralized control. Simulation results across three scenarios-including a complex environment with ten UAVs and multiple obstacles-demonstrate the effectiveness of our approach. The UAVs successfully reach their targets while avoiding collisions, confirming the reliability and robustness of the proposed method. This work contributes to advancing autonomous UAV operations by providing a scalable and adaptable solution for trajectory planning in challenging environments.

Suggested Citation

  • Quoc Bao Diep & Thanh-Cong Truong & Ivan Zelinka, 2025. "Planning trajectory for UAVs using the self-organizing migrating algorithm," PLOS ONE, Public Library of Science, vol. 20(7), pages 1-23, July.
  • Handle: RePEc:plo:pone00:0327016
    DOI: 10.1371/journal.pone.0327016
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0327016
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0327016&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0327016?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:plo:pone00:0327016. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.