弹道
计算机科学
实时计算
轨迹优化
上传
无线传感器网络
运动规划
动态规划
机器人
人工智能
算法
计算机网络
天文
操作系统
物理
作者
Juan Liu,Xijun Wang,Bo Bai,Huaiyu Dai
标识
DOI:10.1109/infcomw.2018.8406973
摘要
Unmanned aerial vehicle (UAV)-aided data collection is a new and promising application in many practical scenarios. In this work, we study the age-optimal trajectory planning problem in UAV-enabled wireless sensor networks, where a UAV is dispatched to collect data from the ground sensor nodes (SNs). The age of information (AoI) collected from each SN is characterized by the data uploading time and the time elapsed since the UAV leaves this SN. We attempt to design two age-optimal trajectories, referred to as the Max-AoI-optimal and Ave-AoI-optimal trajectories, respectively. The Max-AoI-optimal trajectory planning is to minimize the age of the `oldest' sensed information among the SNs. The Ave-AoI-optimal trajectory planning is to minimize the average AoI of all the SNs. Then, we show that each age-optimal flight trajectory corresponds to a shortest Hamiltonian path in the wireless sensor network where the distance between any two SNs represents the amount of inter-visit time. The dynamic programming (DP) method and genetic algorithm (GA) are adopted to find the two different age-optimal trajectories. Simulation results validate the effectiveness of the proposed methods, and show how the UAV's trajectory is affected by the two AoI metrics.
科研通智能强力驱动
Strongly Powered by AbleSci AI