Evidence map›Paper›PMID 40623028›Full record

ArticlePloS one2025

Planning trajectory for UAVs using the self-organizing migrating algorithm.

Quoc Bao Diep, Thanh-Cong Truong, Ivan Zelinka

Abstract read
In one paragraph

Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Quoc Bao DiepFaculty of Mechanical-Electrical and Computer Engineering, School of Technology, Van Lang University, Ho Chi Minh City, Vietnam.ORCID https://orcid.org/0000-0003-4050-648X
Thanh-Cong TruongFaculty of Information Technology, University of Finance-Marketing, Ho Chi Minh City, Vietnam.ORCID https://orcid.org/0000-0001-6603-392X
Ivan ZelinkaDepartment of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB-Technical University of Ostrava, Ostrava-Poruba, Czech Republic.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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.

Indexed as

AlgorithmsUnmanned Aerial DevicesComputer SimulationModels, Theoretical

Identifiers

PMID40623028
PMCPMC12233275

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.