A virtual motion camouflage approach for cooperative trajectory planning of multiple UCAVs

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper investigates cooperative trajectory planning of multiple unmanned combat aerial vehicles (multi-UCAV) in performing autonomous cooperative air-to-ground target attack missions. By integrating an approximate allowable attack region model, several constraint models, and a multicriterion objective function, the problem is formulated as a cooperative trajectory optimal control problem (CTOCP). Then, a virtual motion camouflage (VMC) for cooperative trajectory planning of multi-UCAV, combining with the differential flatness theory, Gauss pseudospectral method (GPM), and nonlinear programming, is designed to solve the CTOCP. In particular, the notion of the virtual time is introduced to the VMC problem formulation to handle the temporal cooperative constraints. The simulation experiments validate that the CTOCP can be effectively solved by the cooperative trajectory planning algorithm based on VMC which integrates the spatial and temporal constraints on the trajectory level, and the comparative experiments illustrate that VMC based algorithm is more efficient than GPM based direct collocation method in tackling the CTOCP. © 2014 Xueqiang Gu et al.

Cite

CITATION STYLE

APA

Gu, X., Shen, L., Chen, J., Zhang, Y., & Zhang, W. (2014). A virtual motion camouflage approach for cooperative trajectory planning of multiple UCAVs. Mathematical Problems in Engineering, 2014. https://doi.org/10.1155/2014/748974

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