An FW–GA Hybrid Algorithm Combined with Clustering for UAV Forest Fire Reconnaissance Task Assignment

Xinlin Liu, Tian Jing () and Linyi Hou
Additional contact information
Xinlin Liu: College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China
Tian Jing: School of System Engineering, National University of Defense Technology, Changsha 410073, China
Linyi Hou: National Engineering Research Center of Geographic Information System, School of Geography and Information Engineering, China University of Geosciences (Wuhan), Wuhan 430074, China

Mathematics, 2023, vol. 11, issue 10, 1-29

Abstract: The assignment of tasks for unmanned aerial vehicles (UAVs) during forest fire reconnaissance is a highly complex and large-scale problem. Current task allocation methods struggle to strike a balance between solution speed and effectiveness. In this paper, a two-phase centralized UAV task assignment model based on expectation maximization (EM) clustering and the multidimensional knapsack model (MKP) is proposed for the forest fire reconnaissance task assignment. The fire situation information is acquired using the sensors carried by satellites at first. Then, the EM algorithm based on the Gaussian mixture model (GMM) is applied to get the initial position of every UAV. In the end, the MKP is applied for UAV task assignment based on the initial positions of the UAVs. An improved genetic algorithm (GA) based on the fireworks algorithm (FWA) is proposed for faster iteration speed. A simulation was carried out against the background of forest fires in Liangshan Prefecture, Sichuan Province, and the simulation’s results demonstrate that the task assignment model can quickly and effectively address task allocation problems on a large scale. In addition, the FW–GA hybrid algorithm has great advantages over the traditional GA, particularly in solving time, iteration convergence speed, and solution effectiveness. It can reduce up to 556% of the iteration time and increase objective function value by 1.7% compared to the standard GA. Furthermore, compared to the GA–SA algorithm, its solving time is up to 60 times lower. This paper provides a new idea for future large-scale UAV task assignment problems.

Keywords: UAV task assignment; gaussian mixture model; multidimensional 0-1 knapsack problem; improved genetic algorithm (GA); fireworks algorithm (FWA) (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/10/2400/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/10/2400/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:10:p:2400-:d:1152724

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().