2013
DOI: 10.4028/www.scientific.net/amr.718-720.1329
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Trajectory Planning for Multi-UCAV Performing Air-to-Ground Target Attack Missions

Abstract: The problem of planning flight trajectories is studied for multiple unmanned combat aerial vehicles (UCAVs) performing a cooperated air-to-ground target attack (CA/GTA) mission. Several constraints including individual and cooperative constraints are modeled, and an objective function is constructed. Then, the cooperative trajectory planning problem is formulated as a cooperative trajectory optimal control problem (CTP-OCP). Moreover, in order to handle the temporal constraints, a notion of the virtual time ba… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…However, the method to achieve the trajectory planning for a single vehicle or cooperative multivehicle required a high computational load. To reduce the computational complexity, the inverse dynamics methods [15,16] and differential flatness theory (DFT) based methods [17][18][19][20] are introduced. Compared to pseudospectral methods, these methods can use any models and any performance indexes and transform the OCP into a low dimensional NLP problem.…”
Section: Introductionmentioning
confidence: 99%
“…However, the method to achieve the trajectory planning for a single vehicle or cooperative multivehicle required a high computational load. To reduce the computational complexity, the inverse dynamics methods [15,16] and differential flatness theory (DFT) based methods [17][18][19][20] are introduced. Compared to pseudospectral methods, these methods can use any models and any performance indexes and transform the OCP into a low dimensional NLP problem.…”
Section: Introductionmentioning
confidence: 99%