Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.14365/5371
Title: | An efficient path planning approach for autonomous multi-UAV system in target coverage problems | Authors: | Pehlivanoglu, Volkan Yasin Pehlivanoğlu, Perihan |
Keywords: | Autonomous multi-UAV Path planning Target coverage Particle swarm optimization Optimization |
Publisher: | Emerald Group Publishing Ltd | Abstract: | Purpose - The purpose of this paper is to present an efficient path planning method for the multi-UAV system in target coverage problems. Design/methodology/approach - An enhanced particle swarm optimizer (PSO) is used to solve the path planning problem, which concerns the two-dimensional motion of multirotor unmanned aerial vehicles (UAVs) in a three-dimensional environment. Enhancements include an improved initial swarm generation and prediction strategy for succeeding generations. Initial swarm improvements include the clustering process managed by fuzzy c-means clustering method, ordering procedure handled by ant colony optimizer and design vector change. Local solutions form the foundation of a prediction strategy. Findings - Numerical simulations show that the proposed method could find near-optimal paths for multi-UAVs effectively. Practical implications - Simulations indicate the proposed method could be deployed for autonomous multi-UAV systems with target coverage problems. Originality/value - The proposed method combines intelligent methods in the early phase of PSO, handles obstacle avoidance problems with a unique approach and accelerates the process by adding a prediction strategy. | URI: | https://doi.org/10.1108/AEAT-10-2023-0258 https://hdl.handle.net/20.500.14365/5371 |
ISSN: | 1748-8842 1758-4213 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.