IDEAS home Printed from https://ideas.repec.org/a/epw/comput/v5y2025i1id10147.html

UAV Path Planning Based on Butterfly Optimization Algorithm in Three-Dimensional Space

Author

Listed:
  • Maytham Kadhim Srayyih

    (Imam Reza International University, Iran)

Abstract

The BOA is a novel optimization algorithm, which is inspired by the butterfly and enables the searching for the best solutions in a respective search area. The algorithm can be set to targeted goals like the amount of distance needed to cover, or/and the presence of an obstacle or the completion of the particular mission objectives. I applied the BOA to generate paths of UAVs on a three-dimensional space and considered the objectives of collision urgency, energy consumption, and near-optimal path planning. Specifically for the assessment of the algorithm, I simulated the application of MATLAB and apply multiple scenarios both on two-dimensional and on three-dimensional environments. I also benchmarked the BOA with two other algorithms including the Ant Colony Optimization and Particle Swarm Optimization (PSO). The results proved that the BOA performed better than the GA in terms of cost function and the time required to arrive at the optimal solution especially in 3D solid terrain. By analyzing the simulation results, the flexibility of the BOA in a 3D environment is evident when new changes take place in the environment. Moreover, the algorithm showed rather swift reaction in terms of path acting in response to various unexpected obstacles. The proposed BOA is viable for the path planning of UAVs in three-dimensional space and effective compared to the other optimization algorithms.

Suggested Citation

Handle: RePEc:epw:comput:v:5:y:2025:i:1:id:10147
DOI: 10.24018/compute.2025.5.1.147
as

Download full text from publisher

File URL: https://eu-opensci.org/index.php/compute/article/view/10147
File Function: Abstract page
Download Restriction: no

File URL: https://eu-opensci.org/index.php/compute/article/download/10147/1888
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.24018/compute.2025.5.1.147?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

Keywords

;
;
;
;

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:epw:comput:v:5:y:2025:i:1:id:10147. 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: Support Team (email available below). General contact details of provider: https://eu-opensci.org/index.php/compute .

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.