This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors ha...This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.展开更多
This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We...This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We aim to maximize the throughput overall GTs by jointly optimizing the UAVs’trajectory,the GTs’scheduling and power allocation.Unlike most prior studies,we consider the UAVs’turning and climbing angle constraints,the UAVs’three-dimensional(3D)trajectory constraints,minimum UAV-to-UAV(U2U)distance constraint,and the GTs’transmit power requirements.However,the formulated problem is a mixed-integer non-convex problem and is intractable to work it out with conventional optimization methods.To tackle this difficulty,we propose an efficient robust iterative algorithm to decompose the original problem be three sub-problems and acquire the suboptimal solution via utilizing the block coordinate descent(BCD)method,successive convex approximation(SCA)technique,and S-procedure.Extensive simulation results show that our proposed robust iterative algorithm offers a substantial gain in the system performance compared with the benchmark algorithms.展开更多
基金funding from the Australian Government,via Grant No.AUSMURIB000001 associated with ONR MURI Grant No.N00014-19-1-2571。
文摘This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.
文摘This paper studies a multi-unmanned aerial vehicle(UAV)enabled wireless communication system,where multiple UAVs are employed to communicate with a group of ground terminals(GTs)in the presence of potential jammers.We aim to maximize the throughput overall GTs by jointly optimizing the UAVs’trajectory,the GTs’scheduling and power allocation.Unlike most prior studies,we consider the UAVs’turning and climbing angle constraints,the UAVs’three-dimensional(3D)trajectory constraints,minimum UAV-to-UAV(U2U)distance constraint,and the GTs’transmit power requirements.However,the formulated problem is a mixed-integer non-convex problem and is intractable to work it out with conventional optimization methods.To tackle this difficulty,we propose an efficient robust iterative algorithm to decompose the original problem be three sub-problems and acquire the suboptimal solution via utilizing the block coordinate descent(BCD)method,successive convex approximation(SCA)technique,and S-procedure.Extensive simulation results show that our proposed robust iterative algorithm offers a substantial gain in the system performance compared with the benchmark algorithms.
