Dynamic Task Allocation of Multiple UAVs Based on Improved A-QCDPSO

26Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

With the rapid changes in the battlefield situation, the requirement of time for UAV groups to deal with complex tasks is getting higher, which puts forward higher requirements for the dynamic allocation of the UAV group. However, most of the existing methods focus on task pre-allocation, and the research on dynamic task allocation technology during task execution is not sufficient. Aiming at the high real-time requirement of the multi-UAV collaborative dynamic task allocation problem, this paper introduces the market auction mechanism to design a discrete particle swarm algorithm based on particle quality clustering by a hybrid architecture. The particle subpopulations are dynamically divided based on particle quality, which changes the topology of the algorithm. The market auction mechanism is introduced during particle initialization and task coordination to build high-quality particles. The algorithm is verified by constructing two emergencies of UAV sudden failure and a new emergency task.

Cite

CITATION STYLE

APA

Zhang, J., Chen, Y., Yang, Q., Lu, Y., Shi, G., Wang, S., & Hu, J. (2022). Dynamic Task Allocation of Multiple UAVs Based on Improved A-QCDPSO. Electronics (Switzerland), 11(7). https://doi.org/10.3390/electronics11071028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free