Author
Listed:
- Kecheng Su
- Yaoyang Wang
- Yikang Kong
- Wenan Liu
Abstract
Multi-objective optimization problems have extensive application value in the fields of engineering and science, among which UAV path planning, as a typical application scenario, has attracted considerable attention. This study innovatively proposes a multi-objective extension of the Gold Rush Optimization algorithm (GRO), namely the Multi-Objective Gold Rush Optimization algorithm (MOGRO). By introducing a reference-point-guided two-level selection mechanism and an external archive strategy, the algorithm effectively addresses the challenge of obtaining Pareto-optimal solutions in multi-objective optimization problems. A systematic validation method is adopted: firstly, a comparative analysis is conducted between MOGRO and seven advanced multi-objective optimization algorithms on a benchmark test set consisting of 18 standard test problems. Subsequently, a UAV path planning multi-objective optimization model is constructed, taking into account both path length and obstacle threats, and the top four algorithms from the benchmark tests are selected for application validation. Experimental results show that the MOGRO algorithm significantly outperforms the comparison algorithms in terms of convergence, distribution, and solution quality, demonstrating excellent optimization performance. This study not only enriches the theoretical system of the GRO algorithm but also provides an innovative solution for UAV path planning in complex environments, with important theoretical value and practical significance.
Suggested Citation
Kecheng Su & Yaoyang Wang & Yikang Kong & Wenan Liu, 2026.
"Multi-objective gold rush optimization algorithm: Theoretical Extensions and applications in UAV path planning,"
PLOS ONE, Public Library of Science, vol. 21(6), pages 1-40, June.
Handle:
RePEc:plo:pone00:0351159
DOI: 10.1371/journal.pone.0351159
Download full text from publisher
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:0351159. 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.