Skip to content
naulon
Not checkedNot checked for notices yet.

Chaotic Random Opposition-Based Learning and Cauchy Mutation Improved Moth-Flame Optimization Algorithm for Intelligent Route Planning of Multiple UAVs

Mingxi Ma, Jun Wu, Yue Shi and 3 more

IEEE Access · 2022

doi:10.1109/access.2022.3172710 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

UAV route planning is the key issue for application of UAV in real-world scenarios. Compared with the traditional route planning methods, although the intelligent optimization algorithm has stronger applicability and optimization performance, it also has the problem of poor convergence accuracy and easy to fall into local optimization. Therefore, an intelligent route planning method for UAV based on chaotic random opposition-based learning and cauchy mutation improved Moth-flame optimization algorithm (OLTC-MFO) is proposed. First, the terrain environment is constructed by digital elevation map, and the threat model is established to realize the equivalent three-dimensional (3D) environment. Then, the opposite population is introduced to increase the diversity of solutions and improve the search speed of the algorithm. Then, the Logistic-Tent chaos map is introduced to realize random perturbation of flame position, which improves the global search capability of the algorithm. Finally, the probability operator and Cauchy mutation operator are introduced, which makes the algorithm not only accept the current solution with a certain probability, but also jump out of the current sub-optimal solution, thus enhancing the global search capability of the algorithm. The simulation results show that when the number of iterations is 1000, the length of route planning based on OLTC-MFO algorithm is 45.3716km shorter than MFO algorithm, and the convergence result of this method is stable and more accurate, which achieves the purpose of assisting UAV combat decision-making.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.