This paper investigates the adaptive trajectory and communication scheduling design for an unmanned aerial vehicle (UAV) relaying random data traffic generated by ground nodes to a base station. The goal is to minimize the expected average communication delay to serve requests, subject to an average UAV mobility power constraint. It is shown that the problem can be cast as a semi-Markov decision process with a two-scale structure, which is optimized efficiently: in the outer decision, the UAV radial velocity for waiting phases and end radius for communication phases optimize the average long-term delay-power trade-off; given outer decisions, inner decisions greedily minimize the instantaneous delay-power cost, yielding the optimal angular velocity in waiting states, and the optimal relay strategy and UAV trajectory in communication states. A constrained particle swarm optimization algorithm is designed to optimize these trajectory problems, demonstrating 100x faster computational speeds than successive convex approximation methods. Simulations demonstrate that an intelligent adaptive design exploiting realistic UAV mobility features, such as helicopter translational lift, reduces the average communication delay and UAV mobility power consumption by 44% and 7%, respectively, with respect to an optimal hovering strategy and by 2% and 13%, respectively, with respect to a greedy delay minimization scheme.
翻译:本文件调查了无人驾驶飞行器(无人驾驶飞行器)通过地面节点向基地站提供随机数据传输到地面节点产生的随机数据流动的适应性轨迹和通信时间安排设计。目标是尽量减少预期平均通信延误,以满足请求,但以平均无人驾驶飞行器机动力限制为条件。文件显示,问题可以作为一个半马尔科夫决定过程,采用两尺度结构,优化为优化:在外部决定中,无人驾驶飞行器等待阶段和通信阶段终点半径的等待阶段的无人驾驶飞行器辐射速度和通信阶段终端半径优化平均长期延迟功率交换;根据外部决定,内部决定贪婪地将瞬时延迟功率成本降至最低,在等待状态中产生最佳角速度,以及通信状态中最佳中继战略和无人驾驶飞行器轨迹。限制粒子蒸汽优化算法的目的是优化这些轨迹问题,显示比连续的convex近似方法更快的100x计算速度。模拟显示,智能适应设计利用现实的无人驾驶飞行器移动性特征,如直升机翻译升能,将平均通信延迟和UAAV调动功率消耗率分别减少44%和7%和7%,同时尊重最佳水平战略和最短度计划。