IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i17p2745-d1732775.html
   My bibliography  Save this article

UAV Path Planning for Forest Firefighting Using Optimized Multi-Objective Jellyfish Search Algorithm

Author

Listed:
  • Rui Zeng

    (School of Computer Science and School of Cyberspace Science, Xiangtan University, Xiangtan 411105, China)

  • Runteng Luo

    (School of Physics and Optoelectronics, Xiangtan University, Xiangtan 411105, China)

  • Bin Liu

    (School of Physics and Optoelectronics, Xiangtan University, Xiangtan 411105, China)

Abstract

This paper presents a novel approach to address the challenges of complex terrain, dynamic wind fields, and multi-objective constraints in multi-UAV collaborative path planning for forest firefighting missions. An extensible algorithm, termed Parallel Vectorized Differential Evolution-based Multi-Objective Jellyfish Search (PVDE-MOJS), is proposed to enhance path planning performance. A comprehensive multi-objective cost function is formulated, incorporating path length, threat avoidance, altitude constraints, path smoothness, and wind effects. Forest-specific constraints are modeled using cylindrical threat zones and segmented wind fields. The conventional jellyfish search algorithm is then enhanced through multi-core parallel fitness evaluation, vectorized non-dominated sorting, and differential evolution-based mutation. These improvements substantially boost convergence efficiency and solution quality in high-dimensional optimization scenarios. Simulation results on the Phillip Archipelago Forest Farm digital elevation model (DEM) in Australia demonstrate that PVDE-MOJS outperforms the original MOJS algorithm in terms of inverted generational distance (IGD) across benchmark functions UF1–UF10. The proposed method achieves effective obstacle avoidance, altitude optimization, and wind adaptation, producing uniformly distributed Pareto fronts. This work offers a viable solution for emergency UAV path planning in forest fire rescue scenarios, with future extensions aimed at dynamic environments and large-scale UAV swarms.

Suggested Citation

  • Rui Zeng & Runteng Luo & Bin Liu, 2025. "UAV Path Planning for Forest Firefighting Using Optimized Multi-Objective Jellyfish Search Algorithm," Mathematics, MDPI, vol. 13(17), pages 1-26, August.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:17:p:2745-:d:1732775
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/17/2745/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/17/2745/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:17:p:2745-:d:1732775. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.