A Novel Tent-Levy Fireworks Algorithm for the UAV Task Allocation Problem Under Uncertain Environment

Abstract

Recently, unmanned aerial vehicle (UAV) task allocation is a hot topic both in the civilian and military, while the research of considering uncertainty and multi-objective is still in its infancy. Firstly, based on the uncertainty theory, a mathematical model of the uncertain multi-objective UAV task allocation problem with uncertain variables in both objective function and constraint conditions is established. The expected value criterion and opportunity constraint are introduced to transform the model into a deterministic optimization model. Furthermore, because traditional fireworks algorithm (FWA) has the shortcomings of low solution accuracy and slow convergence speed in solving the UAV task allocation problem, a novel Tent-Levy FWA (TLFWA) based on discrete update process is designed by introducing integer coding, Tent chaotic mapping and Levy variation. Experimental results show that the mean cost calculated by TLFWA is 8.17% and 13.73% lower than that of FWA and particle swarm optimization algorithm respectively, which proves the effectiveness of TLFWA. This study provides a new way to solve multi-objective and uncertain decision-making problems.

Keywords

• Levy variation
• tent chaotic mapping
• TLFWA
• UAV task allocation
• uncertainty theory