Energy Minimization for Wireless Communication With Rotary-Wing UAV

计算机科学 水准点(测量) 能源消耗 数学优化 无线 离散化 推进 弹道 吞吐量 凸优化 旅行商问题 最优化问题 缩小 能量(信号处理) 控制理论(社会学) 正多边形 算法 数学 工程类 电信 航空航天工程 人工智能 电气工程 天文 控制(管理) 大地测量学 地理 几何学 数学分析 物理 统计
作者
Yong Zeng,Jie Xu,Rui Zhang
出处
期刊:IEEE Transactions on Wireless Communications [Institute of Electrical and Electronics Engineers]
卷期号:18 (4): 2329-2345 被引量:2026
标识
DOI:10.1109/twc.2019.2902559
摘要

This paper studies unmanned aerial vehicle (UAV)-enabled wireless communication, where a rotary-wing UAV is dispatched to communicate with multiple ground nodes (GNs). We aim to minimize the total UAV energy consumption, including both propulsion energy and communication related energy, while satisfying the communication throughput requirement of each GN. To this end, we first derive a closed-form propulsion power consumption model for rotary-wing UAVs, and then formulate the energy minimization problem by jointly optimizing the UAV trajectory and communication time allocation among GNs, as well as the total mission completion time. The problem is difficult to be optimally solved, as it is non-convex and involves infinitely many variables over time. To tackle this problem, we first consider the simple fly-hover-communicate design, where the UAV successively visits a set of hovering locations and communicates with one corresponding GN while hovering at each location. For this design, we propose an efficient algorithm to optimize the hovering locations and durations, as well as the flying trajectory connecting these hovering locations, by leveraging the travelling salesman problem with neighborhood and convex optimization techniques. Next, we consider the general case, where the UAV also communicates while flying. We propose a new path discretization method to transform the original problem into a discretized equivalent with a finite number of optimization variables, for which we obtain a high-quality suboptimal solution by applying the successive convex approximation technique. The numerical results show that the proposed designs significantly outperform the benchmark schemes.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
十三完成签到 ,获得积分10
1秒前
1秒前
2秒前
cui完成签到,获得积分20
5秒前
话说dota发布了新的文献求助10
5秒前
L丶aY完成签到,获得积分20
6秒前
YingxueRen完成签到,获得积分10
7秒前
Hsevencc完成签到,获得积分10
7秒前
10秒前
张兰兰发布了新的文献求助10
11秒前
勤劳晋鹏完成签到,获得积分10
12秒前
狄俄尼索斯完成签到,获得积分10
12秒前
nwpuwangbo完成签到,获得积分0
13秒前
牢大完成签到,获得积分10
14秒前
Tasia完成签到 ,获得积分10
14秒前
15秒前
XTechMan完成签到,获得积分10
16秒前
啊七飞完成签到,获得积分10
20秒前
共享精神应助wm采纳,获得10
21秒前
yyx完成签到,获得积分10
21秒前
24秒前
nosay完成签到,获得积分10
24秒前
24秒前
YHX完成签到,获得积分10
25秒前
静默完成签到 ,获得积分10
26秒前
27秒前
28秒前
Re完成签到 ,获得积分10
28秒前
长安完成签到,获得积分10
28秒前
研自助完成签到,获得积分10
29秒前
Nole应助无聊的紫南采纳,获得10
29秒前
禾梦发布了新的文献求助10
29秒前
Jasper应助路人采纳,获得10
30秒前
小超人完成签到 ,获得积分10
30秒前
小二郎应助科研通管家采纳,获得10
32秒前
ffrrss应助科研通管家采纳,获得10
33秒前
33秒前
朴素听云完成签到,获得积分10
33秒前
天晴应助科研通管家采纳,获得10
33秒前
科目三应助科研通管家采纳,获得10
33秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 500
What is the Future of Psychotherapy in Digital Age? Technology, AI Bots, and Psychotherapy after Covid 444
Management and the Arts 310
Teaching Social and Emotional Learning in Physical Education 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7634532
求助须知:如何正确求助?哪些是违规求助? 9208628
关于积分的说明 19748939
捐赠科研通 7202630
什么是DOI,文献DOI怎么找? 3275070
关于科研通互助平台的介绍 2436953
邀请新用户注册赠送积分活动 2271966