Abstract

The cooperative multiple task assignment problem (CMTAP) is an NP-hard combinatorial optimization problem. In this paper, CMTAP is to allocate multiple heterogeneous fixed-wing UAVs to perform a suppression of enemy air defense (SEAD) mission on multiple stationary ground targets. To solve this problem, we study the adaptive genetic algorithm (AGA) under the assumptions of the heterogeneity of UAVs and task coupling constraints. Firstly, the multi-type gene chromosome encoding scheme is designed to generate feasible chromosomes that satisfy the heterogeneity of UAVs and task coupling constraints. Then, AGA introduces the Dubins car model to simulate the UAV path formation and derives the fitness value of each chromosome. In order to comply with the chromosome coding strategy of multi-type genes, we designed the corresponding crossover and mutation operators to generate feasible offspring populations. Especially, the proposed mutation operators with the state-transition scheme enhance the stochastic searching ability of the proposed algorithm. Last but not least, the proposed AGA dynamically adjusts the number of crossover and mutation populations to avoid the subjective selection of simulation parameters. The numerical simulations verify that the proposed AGA has a better optimization ability and convergence effect compared with the random search method, genetic algorithm, ant colony optimization method, and particle search optimization method. Therefore, the effectiveness of the proposed algorithm is proven.

Highlights

  • The increasing complexity of the electromagnetic environment and the integration of weapons systems in modern battlefields have brought unprecedented challenges to the mission execution of aerial vehicles (AV) [1,2]

  • The numerical simulations verify that the proposed adaptive genetic algorithm (AGA) has a better optimization ability and convergence effect compared with the random search method, genetic algorithm, ant colony optimization method, and particle search optimization method

  • Since the cooperative multiple task assignment problem (CMTAP) model is an NP-hard combinatorial optimization problem, we propose an adaptive genetic algorithm (AGA) with a multi-type gene chromosome encoding strategy

Read more

Summary

Introduction

The increasing complexity of the electromagnetic environment and the integration of weapons systems in modern battlefields have brought unprecedented challenges to the mission execution of aerial vehicles (AV) [1,2]. Effective cooperative task assignment can develop a mission plan for a multi-UAV system when satisfying the operational requirements. Taking CMTAP as a vehicle routing problem, the work in [13] presented a revised ACO to solve the multi-UAV task allocation and route planning. The focus of this paper is to solve the CMTAP of heterogeneous fixed-wing UAVs performing an SEAD mission on multiple stationary ground targets. Both the heterogeneity of UAVs and task coupling constraints are considered.

Task Coupling Constraints
UAVs’ Heterogeneity
CMTAP Model
Proposed Algorithm
Chromosome with Multi-Type Genes
Population Initialization
Calculation of Fitness
Genetic Operations
Crossover Operators
Mutation Operators
Adaptive Setting
Simulations and Analyses
Methods
Feasibility of the Proposed Algorithm
Scenario 1
Scenario 2
15 UAVs against 10 Targets
Discussions
Targets
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call