arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.03349cs.NImath.OC
收藏

时间受限应用的UAV轨迹优化

UAV Trajectory Optimization for Time Constrained Applications

Emmanouil Fountoulakis, Georgios S. Paschos, Nikolaos Pappas

摘要:

无人机(UAV)有望彻底改变通信。利用其灵活性和快速部署,我们可以在拥挤的地区提供内容,或在没有基础设施的地区提供服务。在本文中,我们考虑的无人机,飞越多个位置,并在给定的时间内尽可能多的用户。我们研究的最优轨迹设计问题,我们制定为一个混合整数线性规划。对于大的情况下,轨迹的选项变得令人望而却步的问题,我们建立了一个连接到定向越野问题,并提出了相应的贪心算法。仿真结果表明,该算法是快速的,并产生接近最优解。所提出的算法可用于战略内容缓存或战术现场操作的轨迹规划。

英文摘要:

Unmanned Aerial Vehicles (UAVs) are poised to revolutionize communications. Utilizing their flexibility and fast deployment, we can deliver content in congested areas or provide services in areas without infrastructure. In this paper, we consider a UAV that flies over multiple locations and serves as many users as possible within a given time duration. We study the problem of optimal trajectory design, which we formulate as a mixed-integer linear program. For large instances of the problem where the options for trajectories become prohibitively many, we establish a connection to the orienteering problem, and propose a corresponding greedy algorithm. Simulation results show that the proposed algorithm is fast and yields solutions close to the optimal ones. The proposed algorithm can be used for trajectory planning in strategic content caching or tactical field operations.

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

↑