4.7 Article

Optimal leader allocation in UAV formation pairs ensuring cooperation

期刊

AUTOMATICA
卷 49, 期 11, 页码 3189-3198

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2013.07.030

关键词

Point-to-point UAV reconfiguration; Noncooperative agents; Benefit-driven cooperation; Cooperation-enforcing protocols; Convex restrictions

资金

  1. NSF [CMMI-0908508]
  2. [FA9550-10-1-0499]

向作者/读者索取更多资源

This paper considers the problem of optimally allocating the leader task between pairs of selfish un-manned aerial vehicles (UAVs) flying in formation. The UAV that follows the other achieves a fuel benefit. The noncooperative nature of the agents makes it necessary to arbitrate leader-allocation mechanisms that induce collaboration so that the fuel consumption benefits of flying in formation can be realized. Formulated as a nonlinear program, our problem poses two distinct challenges: on the one hand, given a fixed number of leader switches, determine the optimal leader allocation and, on the other, find the optimal number of leader switches. Even though the first problem is nonconvex, we identify a suitable restriction of its feasible set that makes it convex while maintaining the same optimal value. Regarding the second problem, our analysis of the optimal value of the problem as a function of the number of switches allows us to design a search algorithm which is guaranteed to find the solution in logarithmic time. Several simulations illustrate our results. (C) 2013 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据