Multi-UAV mission allocation under constraint

27Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

This paper is devoted to the unmanned aerial vehicle (UAV) mission allocation problem. To solve this problem in a more realistic battlefield environment, an improved mathematical model for UAV mission allocation is proposed. Being different from previous formulations, this model not only considers the difference in the importance of the target but also the constraints of the time window. In addition, an indicator of reconnaissance reward is added to this model. Each target area has a different importance, just as the strategic value of each region is different in combat. In this paper, we randomly generate the value factor for each reconnaissance area. To solve the mathematical model with different operational intentions, a dimensionality reduction process for which the reconnaissance reward is the optimization objective is presented. Finally, based on the improved model, the simulation result with Lingo is compared with that of non-dominated sorting genetic algorithm with elite strategy (NSGA-II) and genetic algorithm (GA) to verify the reliability and the effectiveness of the improved method.

Cite

CITATION STYLE

APA

Xie, S., Zhang, A., Bi, W., & Tang, Y. (2019). Multi-UAV mission allocation under constraint. Applied Sciences (Switzerland), 9(11). https://doi.org/10.3390/app9112184

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