arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.09520eess.SPcs.NI
收藏

蜂窝互联飞行器的功率有效轨迹优化

Power Efficient Trajectory Optimization for the Cellular-Connected Aerial Vehicles

Behzad Khamidehi, Elvino S. Sousa

摘要:

飞行器由于其高机动性、灵活部署和成本效益,最近在各种商业和民用应用中引起了极大的关注。为了利用这些有前途的功能,空中用户必须满足两个关键要求:首先,他们必须在整个飞行过程中保持与地面基站(GBS)的可靠通信链路,以支持指挥和控制数据流。第二,飞行器必须最大限度地减少其推进功率消耗,以保持功能,直到其任务结束。在本文中,我们研究的轨迹优化问题的空中用户飞越一个区域,包括一组GBS。这个问题的目的是找到的轨迹的空中用户,使总的推进相关的功率消耗的空中用户被最小化,同时满足蜂窝连接约束。该问题是一个非凸混合整数非线性问题,因此,它是具有挑战性的解决方案。为了解决这个问题,首先,这个问题被放松,并重新制定为一个更易于数学处理的形式。然后,利用逐次凸逼近(SCA)技术,提出了一个迭代算法,将问题转化为一系列凸问题,可以有效地解决。

英文摘要:

Aerial vehicles have recently attracted significant attention in a variety of commercial and civilian applications due to their high mobility, flexible deployment and cost-effectiveness. To leverage these promising features, the aerial users have to satisfy two critical requirements: First, they have to maintain a reliable communication link to the ground base stations (GBSs) throughout their flights, to support command and control data flows. Second, the aerial vehicles have to minimize their propulsion power consumption to remain functional until the end of their mission. In this paper, we study the trajectory optimization problem for an aerial user flying over an area including a set of GBSs. The objective of this problem is to find the trajectory of the aerial user so that the total propulsion-related power consumption of the aerial user is minimized while a cellular-connectivity constraint is satisfied. This problem is a non-convex mixed integer non-linear problem and hence, it is challenging to find the solution. To deal with, first, the problem is relaxed and reformulated to a more mathematically tractable form. Then, using successive convex approximation (SCA) technique, an iterative algorithm is proposed to convert the problem into a sequence of convex problems which can be solved efficiently.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑