Search

The infiltration of heterogenous fleets of autonomous Unmanned Aerial Vehicles (UAVs) in smart cities is leading to the consumerization of city air space which includes infrastructure creation of roads, traffic design, capacity estimation, and trajectory optimization. This study proposes a novel autonomous Advanced Aerial Mobility (AAM) logistical system for high density city centers. First, we propose a real-time 3D geospatial mining framework for LiDAR data to create a dynamically updated digital twin model. This enables the identification of viable airspace volumes in densely populated 3D environments based on the airspace policy/regulations. Second, we propose a robust city airspace dynamic 4D discretization method (Skyroutes) for autonomous UAVs to incorporate the underlying real-time constraints coupled with externalities, legal, and optimal UAV operation based on kinematics. An hourly trip generation model was applied to create 1138 trips in two scenarios comparing the cartesian discretization to our proposed algorithm. The results show that the AAM enables a precise airspace capacity/cost estimation, due to its detailed 3D generation capabilities. The AAM increased the airspace capacity by up to 10%, the generated UAV trajectories are 50% more energy efficient, and significantly safer. [ABSTRACT FROM AUTHOR]

This study presents a novel framework that integrates the universal jamming gripper (UG) with unmanned aerial vehicles (UAVs) to enable automated grasping with no human operator in the loop. Grounded in the principles of granular jamming, the UG exhibits remarkable adaptability and proficiency, navigating the complexities of soft aerial grasping with enhanced robustness and versatility. Central to this integration is a uniquely formulated constrained trajectory optimization using model predictive control, coupled with a robust force control strategy, increasing the level of automation and operational reliability in aerial grasping. This control structure, while simple, is a powerful tool for various applications, ranging from material handling to disaster response, and marks an advancement toward genuine autonomy in aerial manipulation tasks. The key contribution of this research is the combination of a UG with a suitable control strategy, that can be kept relatively straightforward thanks to the mechanical intelligence built into the UG. The algorithm is validated through numerical simulations and virtual experiments. [ABSTRACT FROM AUTHOR]

With the development of the Internet of Things (IoT) technology, massive amounts of sensor data in applications such as fire monitoring need to be transmitted to edge servers for timely processing. However, there is an energy-hole phenomenon in transmitting data only through terrestrial multi-hop networks. In this study, we focus on the data collection task in an unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) network, where a UAV is deployed as the mobile data collector for the ground sensor nodes (SNs) to ensure high information freshness. Meanwhile, the UAV is equipped with an edge server for data caching. We first establish a rigorous mathematical model in which the age of information (AoI) is used as a measure of information freshness, related to both the data collection time and the UAV's flight time. Then a mixed-integer non-convex optimization problem is formulated to minimize the peak AoI of the collected data. To solve the problem efficiently, we propose an iterative two-step algorithm named the AoI-minimized association and trajectory planning (AoI-MATP) algorithm. In each iteration, the optimal SN–collection point (CP) associations and CP locations for the parameter ε are first obtained by the affinity propagation clustering algorithm. The optimal UAV trajectory is found using an improved elite genetic algorithm. Simulation results show that based on the optimized ε , the AoI-MATP algorithm can achieve a balance between data collection time and flight time, reducing the peak AoI of the collected data. [ABSTRACT FROM AUTHOR]

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%. [ABSTRACT FROM AUTHOR]

This article investigates a mobile edge computing (MEC) network assisted by multiple unmanned aerial vehicles (UAVs) to address the computational and offloading requirements for mobile intelligent terminals (MITs) within crowded venues. The objective is to tackle intricate task processing and diminish MITs' waiting times. Considering the randomness of task arrival at the MITs and the imbalance between the amount of data and computation for complex tasks, a dual‐queue model with data cache queue and computation queue is proposed, with minimizing the weighted system total energy consumption and average delay as the optimization objectives. Lyapunov optimization theory is employed to convert the stochastic optimization problem into a deterministic one, and the initial deployment quantity and hovering position of the UAVs are determined by the density‐based spatial clustering of applications with noise (DBSCAN) method with noise. Then PPO algorithm for MIT task, resource allocation, and UAV trajectory optimization. Numerical results display the proposed scheme can efficaciously diminish energy consumption and delay by 10% and 33% respectively, compared with the baseline scheme. This paper proposes a practical and feasible solution for stochastic computing offloading in UAV‐assisted MEC, which fills the gap in existing research on regarding the consideration of complex task imbalances. [ABSTRACT FROM AUTHOR]

In this paper, we concentrate on a non-orthogonal multiple access (NOMA)-enabled UAV data collection network for Internet of Things devices (IoTDs), where a unmanned aerial vehicle (UAV) is deployed as an aerial base station. During its flight period, the UAV can collect data from IoTDs and take advantage of the simultaneous wireless information and power transfer technology to charge the batteries of IoTDs. With the aid of NOMA, spectrum efficiency has been improved. We aim to prolong the lifetime of the IoT network, via jointly optimizing the UAV trajectory, the time allocation for information communication and wireless power transfer, the IoTDs' transmit power, as well as the IoTDs' group scheduling for NOMA. Then, we use the block coordinate decent and successive convex approximation techniques to tackle the non-convexity of the formulated problem. Numerical results show that the proposed solution increases the residual energy of the IoTDs, thus prolonging the lifetime of the network. [ABSTRACT FROM AUTHOR]

In wireless sensor networks (WSNs), unmanned aerial vehicles (UAVs) are considered an effective data collection tool. In this paper, we investigate the energy-efficient data collection problem in a UAV-enabled secure WSN without knowing the instantaneous channel state information of the eavesdropper (Eve). Specifically, the UAV collected the information from all the wireless sensors at the scheduled time and forward it to the fusion center while Eve tries to eavesdrop on this confidential information from the UAV. To surmount this intractable and convoluted mixed-integer non-convex problem, we propose an efficient iterative optimization algorithm using the block coordinate descent (BCD) method to minimize the maximum energy consumption of the ground sensor nodes (GSNs) under the constraints of secrecy outage probability (SOP), connection outage probability (COP), minimum secure data, information causality, and UAV trajectory. Numerical results demonstrate the superiority of the algorithm we proposed in energy consumption and secrecy rate compared with other schemes. [ABSTRACT FROM AUTHOR]

The combination of unmanned aerial vehicles (UAVs) and mobile edge computing (MEC) is considered as a promising approach to tackle soaring computing requirements. The broadcast nature of air‐to‐ground (A2G) links makes UAV communications vulnerable to eavesdroppers, so secure UAV communications remain an open question. This paper proposes a secure communication scheme for reconfigurable intelligent surface (RIS)‐assisted UAV‐MEC systems, in which the RIS assists the user in offloading data to the legitimate UAV, and the legitimate UAV provides computing services to the user. To fully expand the security computing capacity of the system, the communication link is improved by introducing RIS, and the jammer interferes with the eavesdropper. The secure computing capability of the system is maximized by optimizing communication resources and trajectories. Since the proposed problem is non‐convex, successive convex approximation (SCA) technique and block coordinate descent (BCD) technique is combined to solve the problem. The simulation results show that the proposed scheme in this paper can effectively improve the system secure computing bits compared with the benchmark scheme. [ABSTRACT FROM AUTHOR]

This paper investigates an optimization problem corresponding to energy efficiency maximization of an unmanned aerial vehicle (UAV)-enabled relaying system, where a fixed-wing UAV acts as an amplify-and-forward mobile relay to assist data transmission between a source node and a destination node. On the premise of satisfying the speed and acceleration constraints of the UAV, the energy efficiency (EE) of the relaying system is maximized by jointly optimizing the UAV's trajectory and the individual transmit power levels of the source and the UAV relay. The initial joint optimization problem is non-convex and cannot be solved directly. Therefore, the joint optimization problem is decomposed into two sub-problems which are solved by applying the successive convex approximation technique and the Dinkelbach's algorithm. On this basis, an efficient iterative algorithm is proposed to tackle the joint optimization problem through the block coordinate descent technique. Simulation results demonstrated that by conducting the proposed algorithm, the flight trajectory of the UAV and the individual transmit power levels of the nodes can be flexibly adjusted according to the system conditions, and the proposed algorithm contributes to the higher EE compared with the benchmark schemes. [ABSTRACT FROM AUTHOR]

In this paper, the flexibility of unmanned aerial vehicles (UAVs), as well as the benefits of coordinated multi-point (CoMP) transmission, are utilized for mitigating the interference in cellular networks. Specifically, the joint problem of CoMP clusters and UAVs' trajectories is addressed for downlink transmission in a UAV-assisted cellular system. The problem is presented as a non-convex optimization problem that aims to maximize the sum rate of the ground users by taking into account the clustering, UAV mobility and backhaul capacity constraints. Since the formulated problem is known to be NP-hard, we partition it into two sub-problems. Particularly, by using coalitional game theory, the CoMP clusters are obtained with a given UAVs' trajectories. Then, UAVs' trajectories are optimized with given CoMP clusters using successive convex approximation technique. Based on the block coordinate descent method, the two sub-problems are solved alternatively until convergence. Numerical results are conducted and demonstrated the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Cellular-connected unmanned aerial vehicles (UAVs) present a viable solution to address communication and navigation limitations by leveraging base stations for air–ground communication. However, in complex urban scenarios with stringent communication requirements, achieving asymmetrical control becomes crucial to strike a balance between communication reliability and flight safety. Moreover, existing cellular-connected UAV trajectory planning algorithms often struggle to handle real scenes with sudden and intricate obstacles. To address the aforementioned challenges, this paper presents the multi-tier trajectory planning method (MTTP), which takes into account air–ground communication service assurance and collision avoidance in intricate urban environments. The proposed approach establishes a flight risk model that accounts for both the outage probability of UAV-ground base station (GBS) communication and the complexity of flight environments, and transforms the inherently complex three-dimensional (3D) trajectory optimization problem into a risk distance minimization model. To optimize the flight trajectory, a hierarchical progressive solution approach is proposed, which combines the strengths of the heuristic search algorithm (HSA) and deep reinforcement learning (DRL) algorithm. This innovative fusion of techniques empowers MTTP to efficiently navigate complex scenarios with sudden obstacles and communication challenges. Simulations show that the proposed MTTP method achieves a more superior performance of trajectory planning than the conventional communication-based solution, which yields a substantial reduction in flight distance of at least 8.49% and an impressive 10% increase in the mission success rate. Furthermore, a real-world scenario is chosen from the Yuhang District, Hangzhou (a southern Chinese city), to validate the practical applicability of the MTTP method in highly complex operating scenarios. [ABSTRACT FROM AUTHOR]

With the integration of unmanned aerial vehicles (UAVs) into fifth generation (5G) networks, UAVs are used in many applications since they enhance coverage and capacity. To increase wireless communication resources, it is crucial to study the trajectory of UAV-assisted relay. In this paper, an energy-efficient UAV trajectory for uplink communication is studied, where a UAV serves as a mobile relay to maintain the communication between ground user equipment (UE) and a macro base station. This paper proposes a UAV Trajectory Optimization (UAV-TO) scheme for load balancing based on Reinforcement Learning (RL). The proposed scheme utilizes load balancing to maximize energy efficiency for multiple UEs in order to increase network resource utilization. To deal with nonconvex optimization, the RL framework is used to optimize the trajectory UAV. Both model-based and model-free approaches of RL are utilized to solve the optimization problem, considering line of sight and non-line of sight channel models. In addition, the network load distribution is calculated. The simulation results demonstrate the effectiveness of the proposed scheme under different path losses and different flight durations. The results show a significant improvement in performance compared to the existing methods. [ABSTRACT FROM AUTHOR]

The trajectory optimization problem in agricultural unmanned aerial vehicles (UAVs) inspection of agricultural facilities and equipment shares similarities with the traveling salesman problem. Traditional heuristic algorithms can encounter challenges such as overlapping flight paths and local optima due to complex terrain, numerous obstacles, and external environmental influences. To optimize the agricultural UAV detection process, a Genetic Algorithm and Simulated Annealing (GA-SA) algorithm based on GA was proposed to calculate 3D flight paths for agricultural UAVs. By establishing a mathematical model that combines the UAV threat environment with physical constraints, the cost function of the traditional SA algorithm was optimized to improve search efficiency. Additionally, trajectory smoothing techniques were applied to ensure smooth transitions between trajectory points. Experimental results demonstrate that the GA-SA algorithm overcomes the limitations of the traditional SA algorithm in node search efficiency and trajectory smoothing, enabling the planning of realistic and optimal flight paths in 3D environments. The GA-SA algorithm exhibits an 18.82% improvement in convergence time GA-SA compared with the traditional GA algorithm and a 13.20% improvement compared with the SA algorithm. Moreover, it shortens the optimal track distance by 2.244 km and 1.793 km, respectively, validating the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Over the past few years, with the rapid increase in the number of natural disasters, the need to provide smart emergency wireless communication services has become crucial. Unmanned aerial Vehicles (UAVs) have gained much attention as promising candidates due to their unprecedented capabilities and broad flexibility. In this paper, we investigate a UAV-based emergency wireless communication network for a post-disaster area. Our optimization problem aims to optimize the UAV's flight trajectory to maximize the number of visited ground users during the flight period. Then, a dual cost-aware multi-armed bandit algorithm is adopted to tackle this problem under the limited available energy for both the UAV and ground users. Simulation results show that the proposed algorithm could solve the optimization problem and maximize the achievable throughput under these energy constraints. [ABSTRACT FROM AUTHOR]

With the massive application of unmanned aerial vehicles (UAVs) in disaster relief, fire protection, security and other fields, jamming countermeasures to UAVs in airports and competition venues have become the core link of security in high‐level matches and important places. The existing jamming sources are mainly single point jamming. Due to the shielding of buildings, it is impossible to fully cover the venue, and the existing suppressed jamming will affect the communication broadcasting. Here, a distributed optimal jamming method for massive UAVs is proposed. Through the identification and positioning of massive UAVs, using the location information of distributed jamming sources, the UAV jamming architecture based on satellite navigation is constructed. Combined with tabu search artificial bee colony theory, the distributed optimal jamming of UAVs is realized, which solves the problems of few jamming targets, slow speed and low success rate of the existing optimal jamming methods. The proposed method is compared with the existing methods in three aspects: communication frequency, jamming trajectory deviation and optimization speed. The simulation results show that the proposed method effectively improves the jamming success rate and jamming speed and can meet the application requirements of massive UAV jamming in the region. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles (UAVs) can be deployed as aerial wireless base stations which dynamically cover the wireless communication networks for Ground Users (GUs). The most challenging problem is how to control multi-UAVs to achieve on-demand coverage of wireless communication networks while maintaining connectivity among them. In this paper, the cooperative trajectory optimization of UAVs is studied to maximize the communication efficiency in the dynamic deployment of UAVs for emergency communication scenarios. We transform the problem into a Markov game problem and propose a distributed trajectory optimization algorithm, Double-Stream Attention multi-agent Actor-Critic (DSAAC), based on Multi-Agent Deep Reinforcement Learning (MADRL). The throughput, safety distance, and power consumption of UAVs are comprehensively taken into account for designing a practical reward function. For complex emergency communication scenarios, we design a double data stream network structure that provides a capacity for the Actor network to process state changes. Thus, UAVs can sense the movement trends of the GUs as well as other UAVs. To establish effective cooperation strategies for UAVs, we develop a hierarchical multi-head attention encoder in the Critic network. This encoder can reduce the redundant information through the attention mechanism, which resolves the problem of the curse of dimensionality as the number of both UAVs and GUs increases. We construct a simulation environment for emergency networks with multi-UAVs and compare the effects of the different numbers of GUs and UAVs on algorithms. The DSAAC algorithm improves communication efficiency by 56.7%, throughput by 71.2%, energy saving by 19.8%, and reduces the number of crashes by 57.7%. [ABSTRACT FROM AUTHOR]

UAVs are widely used for aerial reconnaissance with imaging sensors. For this, a high detection performance (accuracy of object detection) is desired in order to increase mission success. However, different environmental conditions (negatively) affect sensory data acquisition and automated object detection. For this reason, we present an innovative concept that maps the influence of selected environmental conditions on detection performance utilizing sensor performance models. These models are used in sensor-model-based trajectory optimization to generate optimized reference flight trajectories with aligned sensor control for a fixed-wing UAV in order to increase detection performance. These reference trajectories are calculated using nonlinear model predictive control as well as dynamic programming, both in combination with a newly developed sensor performance model, which is described in this work. To the best of our knowledge, this is the first sensor performance model to be used in unmanned aerial reconnaissance that maps the detection performance for a perception chain with a deep learning-based object detector with respect to selected environmental states. The reference trajectory determines the spatial and temporal positioning of the UAV and its imaging sensor with respect to the reconnaissance object on the ground. The trajectory optimization aims to influence sensor data acquisition by adjusting the sensor position, as part of the environmental states, in such a way that the subsequent automated object detection yields enhanced detection performance. Different constraints derived from perceptual, platform-specific, environmental, and mission-relevant requirements are incorporated into the optimization process. We evaluate the capabilities of the sensor performance model and our approach to sensor-model-based trajectory optimization by a series of simulated aerial reconnaissance tasks for ground vehicle detection. Compared to a variety of benchmark trajectories, our approach achieves an increase in detection performance of 4.48% on average for trajectory optimization with nonlinear model predictive control. With dynamic programming, we achieve even higher performance values that are equal to or close to the theoretical maximum detection performance values. [ABSTRACT FROM AUTHOR]

This paper studies the anti-jamming problem of unmanned aerial vehicle (UAV)-enabled Internet of Things (IoT) communication networks in the presence of a jammer under the accurate probabilistic line-of-sight (LoS) model. Our goal is to maximize the information collection throughput of the system under the assumption that only the jammer's approximate location is known. To this end, we formulate a throughput maximization problem by optimizing the UAV trajectory, the IoT devices' transmit power, and communication scheduling under the accurate real-time probabilistic LoS channel. However, the proposed optimization problem is non-convex and coupled, and hence intractable to be solved. In order to tackle the problem, a robust iterative algorithm is proposed by leveraging the block coordinate descent (BCD) method, the successive convex approximation (SCA) technology, the difference of convex (D.C) programming approach, and the S -procedure. Extensive simulation results show that our proposed algorithm significantly improves the system throughput while achieving a practical anti-jamming effect compared with the benchmark algorithms. [ABSTRACT FROM AUTHOR]

This paper focuses on a coordinated tracking planning method of multiple unmanned aerial vehicles (UAVs), which was deployed in the best positions to better fulfill the marine target localization tasks when approaching the target. The optimal planning of multi-UAVs was implemented using an online centralized nonlinear model predictive control (NMPC) based on the target state's uncertainty criteria. The penalty function is used to solve UAV platform dynamic performance in the model predictive control method to consider the more realistic situation. The coordinated planning problems of multi-UAVs are numerically simulated and compared with the Lyapunov vector field guidance (LVFG) method under classical mission scenarios. Simulation results demonstrate that the algorithm can maintain the optimal observation configuration of multi-UAVs to improve the marine target positioning accuracy, verifying the feasibility and superiority of this method. Furthermore, the simulation results can provide a useful reference for the flight control law design of multi-UAVs with optimal observation configuration. [ABSTRACT FROM AUTHOR]

Due to the lack of places to employ communication infrastructures, there are many coverage blind zones in maritime communication networks. Benefiting from the high flexibility and maneuverability, unmanned aerial vehicles (UAVs) have been proposed as a promising method to provide broadband maritime coverage for these blind zones. In this paper, a multi-UAV-enabled maritime communication model is proposed, where UAVs are deployed to provide the transmission service for maritime users. To improve the performance of the maritime communication systems, an optimization problem is formulated to maximize the minimum average throughput among all users by jointly optimizing the user association, power allocation, and UAV trajectory. To derive the solutions with a low computational complexity, we decompose this problem into three subproblems, namely user association optimization, power allocation optimization, and UAV trajectory optimization. Then, a joint iterative algorithm is developed to achieve the solutions based on the successive convex approximation and interior-point methods. Extensive simulation results validate the effectiveness of the proposed algorithm and demonstrate that UAVs can be used to enhance the maritime coverage. [ABSTRACT FROM AUTHOR]

This paper considers a laser-powered unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) system. In the system, a UAV is dispatched as an energy transmitter to replenish energy for battery-limited sensors in a wireless rechargeable sensor network (WRSN) by transferring radio frequency (RF) signals, and a mobile unmanned vehicle (MUV)-loaded laser transmitter travels on a fixed path to charge the on-board energy-limited UAV when it arrives just below the UAV. Based on the system, we investigate the trajectory optimization of laser-charged UAVs for charging WRSNs (TOLC problem), which aims to optimize the flight trajectories of a UAV and the travel plans of an MUV cooperatively to minimize the total working time of the UAV so that the energy of every sensor is greater than or equal to the threshold. Then, we prove that the problem is NP-hard. To solve the TOLC problem, we first propose the weighted centered minimum coverage (WCMC) algorithm to cluster the sensors and compute the weighted center of each cluster. Based on the WCMC algorithm, we propose the TOLC algorithm (TOLCA) to design the detailed flight trajectory of a UAV and the travel plans of an MUV, which consists of the flight trajectory of a UAV, the hovering points of a UAV with the corresponding hovering times used for the charging sensors, the hovering points of a UAV with the corresponding hovering times used for replenishing energy itself, and the hovering times of a UAV waiting for an MUV. Numerical results are provided to verify that the suggested strategy provides an effective method for supplying wireless rechargeable sensor networks with sustainable energy. [ABSTRACT FROM AUTHOR]

The explosive growth of unmanned aerial vehicles (UAVs)-based networks has accelerated in recent years. One of the crucial tasks of a UAV-based network is managing and allocating resources, including time, power, fly trajectory, and energy resources. We investigate a UAV-based network that gathers information from smart devices, sensor devices, and IoT devices (IDs) with respect to energy efficiency (EE) maximization. The EE of users served by the UAV over the time slots of a cycle is maximized through three categories: UAV trajectory optimization, power allocation, and time slot assignment. However, these are non-convex problems that are very difficult to solve. To solve the problem efficiently, we divide it step by step and convert the non-convex optimization problem into an equivalent convex optimization problem, optimizing each equivalent problem over each variable while other variables are fixed. Firstly, we perform a UAV trajectory optimization with a different number of ground users. Secondly, the Dinkelbach method is used to construct a non-convex fractional power allocation problem. In addition, we develop an algorithm to distribute time slots to all users, which continually raises the EE value. Eventually, a scheme is provided to sequentially update the method to each equivalent problem. The numerical results provide evidence that by solving the proposed sum-rate maximization problem, the performance of ground users has significantly improved with the support of the UAV-based network. [ABSTRACT FROM AUTHOR]

In the problem of trajectory optimization for unmanned aerial vehicles (UAVs) passing through multiple target points, continuous velocity and acceleration in the process of optimization are essential for maintaining a feasible trajectory. This paper proposes a multi-segment holistic Bezier shaping method (MHBSM) for dynamic trajectory optimization. The MHBSM not only achieves holistic optimization of UAVs passing through a multi-target trajectory but also ensures high-order continuity at the junctions of trajectory segments. Unlike methods that generate non-dynamic trajectories by connecting arcs and straight lines (such as Dubins curves) without considering speed changes, MHBSM optimizes the trajectory while taking into account the dynamics of UAVs. The method optimizes the differential flat output space of a fixed-wing UAV dynamic model and transforms the dynamic optimization problem into a three-dimensional position optimization problem. The problem is then further transformed into an optimization of control points using the Bezier curve. The resulting trajectory satisfies the dynamic constraints. In comparison to the Gaussian pseudospectral method (GPM), MHBSM achieves similar optimization results with only a 2.58% difference, while requiring approximately 1.36% of the computational time on average. The MHBSM demonstrates excellent convergence performance while satisfying the constraints of continuous acceleration and obstacle avoidance. [ABSTRACT FROM AUTHOR]

Due to their promising applications and intriguing characteristics, Unmanned Aerial Vehicles (UAVs) can be dispatched as flying base stations to serve multiple energy-constrained Internet-of-Things (IoT) sensors. Moreover, to ensure fresh data collection while providing sustainable energy support to a large set of IoT devices, a required number of UAVs should be deployed to carry out these two tasks efficiently and promptly. Indeed, the data collection requires that UAVs first make Wireless Energy Transfer (WET) to supply IoT devices with the necessary energy in the downlink. Then, IoT devices perform Wireless Information Transmission (WIT) to UAVs in the uplink based on the harvested energy. However, it turns out that when the same UAV performs WIT and WET, its energy usage and the data collection time are severely penalized. Worse yet, it is difficult to efficiently coordinate between UAVs to improve the performance in terms of WET and WIT. This work proposes to divide UAVs into two teams to behave as data collectors and energy transmitters, respectively. A Multi-Agent Deep Reinforcement Learning (MADRL) method, called TEAM, is leveraged to jointly optimize both teams’ trajectories, minimize the expected Age of Information (AoI), maximize the throughput of IoT devices, minimize the energy utilization of UAVs, and enhance the energy transfer. Simulation results depict that TEAM can effectively synchronize UAV teams and adapt their trajectories while serving a large-scale dynamic IoT environment. [ABSTRACT FROM AUTHOR]

This paper investigates a wireless powered unmanned aerial vehicle (UAV) communication network with backscatter and caching technologies. Specifically, we assume a self-energized UAV with a cache memory is deployed as a flying backscatter device (BD), term the UAV-enabled BD (UB), to relay the source’s signals to the destination. Whereas the source S can act as a wireless charging station or a base station to supply power or transmit information to the UB using the dynamic time splitting (DTS) method. The UAV utilizes its harvested energy for backscattering (i.e., passive communication) and transmit information (i.e., active communication) to the destination. In this context, we aim to maximize the total throughput by jointly optimizing the DTS ratio and the UB’s trajectory with caching capability at the UB. The formulation is troublesome to solve since it is a non-convex problem. To find solutions, we decompose the original problem into two sub-problems, whereas we first optimize the DTS ratio for a given UB’s trajectory and the UB’s trajectory optimization for a given DTS ratio. By using the KKT conditions, a closed-form expression for the optimal value of the DTS ratio is obtained, greatly reducing the computation time. Moreover, the solution of the second sub-problem can be acquired by adopting the successive convex approximation (SCA) technique. Consequently, an efficient alternating algorithm is proposed by leveraging the block coordinate descent (BCD) method. To show the advantages of the proposed BCD-based algorithm, we also provide the solution of the original problem applying the inner approximation (IA) method. Finally, the intensive numerical results demonstrate that our proposed schemes achieve significant throughput gain in comparison to the benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled communication has emerged as an irreplaceable technology in military, disaster relief and emergency scenarios. This correspondence investigates the average throughput in a UAV-enabled cognitive radio network, where the UAV is regarded as a dedicated secondary user to enhance the network coverage and spectral efficiency. Based on the probabilistic line-of-sight channel, we exploit the joint design of UAV trajectory and resource allocation to maximize the average throughput under the constraints of co-channel interference and completion time. The original problem is a mixed integer non-convex problem which is generally NP-hard. We first decompose the primal problem into a bilevel programming problem, and then propose an efficient high-quality algorithm based on the particle swarm optimization approach. The optimized trajectory reveals the trade-off between throughput and co-channel interference. Numerical results verify the superiority of the proposed algorithm as compared to other benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled wireless power transfer (WPT) is a viable solution to remotely charge several energy receivers (ERs) in areas with intermittent access to a source of energy. However, given the limited available energy in the on-board battery of the UAV, which is mainly required to suffice propulsion energy consumption, the UAV struggles to roam seamlessly for long intervals. A key challenge is thus to efficiently use the limited battery energy, and accordingly prolong the UAV’s endurance, via controlling the underlying associated parameters such as cruising velocity. To further extend the battery lifetime, the UAV can also harness other sources of sustainable energy, such as sunlight, via solar energy harvesting. This paper studies a UAV-enabled WPT system, where a rotary-wing UAV transfers radio frequency (RF) wireless energy to several ERs at known locations. To offer uninterrupted seamless service, the UAV also harvests solar energy using solar panels. Considering the propulsion energy consumption of the UAV, we maximize the minimum average power received among all ERs over a finite cycle duration by jointly optimizing the UAV’s time allocation between harvesting and charging, flight trajectory as well as velocity, and transmit power allocation. Due to the non-convexity of the problem, we utilize the block coordinate descent (BCD) and successive convex approximation (SCA) methods. Numerical results show that the proposed solution outperforms benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicle applications have highly increased in the last years, from surveillance, exploration, rescue to transport applications. UAVs are more and more autonomous, therefore real-time trajectory planning is necessary and can be achieved thanks to artificial potential fields. The classic Ge & Cui repulsive force solely allows taking into account the velocity of the obstacles without any distinction. The Weyl potential force associates a degree of danger with an obstacle and has enabled to distinguish between the obstacles but the obstacle velocity is no more considered. Therefore, a new dynamical fractional repulsive force has been proposed by combining both advantages. The new dynamical fractional repulsive potential field is usable in a 3D environment and takes into account both the obstacle dynamics (position and speed) and their degree of dangerousness. Obstacle avoidance robustness is guaranteed, both from a safety point of view and from a trajectory optimization point of view. The proposed repulsive potential fields are first of all dynamical as they are based on the relative position and speed of the UAV in relation to the obstacle positions and speeds. Moreover, the dangerousness of the obstacles is also considered by introducing a fractional degree in their definition. Simulations results are provided to compare different repulsive potential field method (Ge & Cui, Weyl methods) to the proposed dynamical fractional potential field both in static and dynamical environments. [ABSTRACT FROM AUTHOR]

Air ground integrated mobile cloud computing (MCC) provides unmanned aerial vehicles (UAVs) the capability to act as an aerial relay with more flexibility and resilience. In the cloud computing architecture, the data generated by ground users (GUs) can be offloaded to the remote server for fast processing. However, the heterogeneity of mobile tasks makes the data size distributed among GUs unbalanced. Besides, the energy efficiency of UAVs movement should be carefully considered for sustainable flight and obstacle avoidance. In general, such a joint trajectory issue can hardly be formulated as a convex optimization in unpredictable and dynamic environments. This paper proposes a potential game combined multi-agent deep deterministic policy gradient (MADDPG) approach to optimize multiple UAVs' trajectory with the consideration of GUs' offloading delay, energy efficiency as well as obstacle avoidance system. In specific, we first model the issue as a mixed integer non-linear problem (MINP), in which the service assignment between multi-user and multi-UAV is solved by potential game. The convergence to a Nash Equilibrium (NE) can be achieved by distributive service assignment update with infinite iteration. Then, we optimize the trajectory with obstacle avoidance at each UAV by MADDPG approach, which has a great advantage of centralized-training and decentralized-execution to reduce the global synchronized communication overhead. UAVs movement can be optimized in continuity rather than other deep reinforcement learning (DRL) approaches generating discrete simple actions. Experiments demonstrate the proposed game-combined learning algorithm can minimize the offloading delay, enhance UAVs’ energy efficiency and avoid the obstacles at the same time. [ABSTRACT FROM AUTHOR]

The explosive computation demands in the Internet of Things (IoT) have triggered the research interests on unmanned aerial vehicle (UAV) assisted mobile-edge computing (MEC) systems even though there are still many challenges, such as computing delay requirement, multi-UAV cooperation, and resource management. This letter focuses on the computing delay issue in MEC systems assisted by multiple UAVs with the goal of task completion time minimization. In particular, both the partial offloading and binary offloading modes are considered by jointly optimizing time slot size, terminal devices scheduling, computation resource allocation, and UAVs’ trajectories. Particularly, an non-LoS channel model is adopted for UAV-ground communication. To handle the formulated problems, we develop alternating optimization algorithms by invoking the successive convex approximation method, Karush-Kuhn-Tucker conditions and penalized method. Numerical results show that the completion time is significantly decreased by the proposed algorithms. [ABSTRACT FROM AUTHOR]

This article presents a novel recursive smooth trajectory (RST) generation algorithm for application in robotics and in particular for unmanned aerial vehicles (UAVs). RST builds the trajectory recursively as a smooth polynomial path, thus a closed form trajectory satisfying any arbitrary dynamic limitation that translates into kinematic constraints (e.g., position, velocity, acceleration, etc.). Uncertainties and perturbations in the constraints are also discussed, modeled, and finally included in the calculation of the polynomial trajectory coefficients. Moreover, due to its recursive formulation, RST enables an immediate extension toward the solution of a trajectory optimization problem. In particular, it is shown that the minimum-snap piecewise polynomial trajectory can be interpreted as a special case of RST. The effectiveness of the proposed algorithm is demonstrated numerically via two illustrative scenarios. Its application to a UAV structure is also discussed to highlight the advantage of a smooth path over a piecewise one. Finally, the computational complexity and memory requirements are analyzed. [ABSTRACT FROM AUTHOR]

In this letter, we investigate an unmanned aerial vehicle (UAV) enabled wireless powered communication network (WPCN), in which the UAV first employs the radio frequency (RF) signal to power ground users, and then the users communicate with the UAV by using the harvested energy. The sum rate maximization problem in WPCN suffers doubly near-far effect caused by the double signal propagation loss in both the energy harvesting and communication stage. It is generally believed that this effect can be alleviated by integrating UAV into WPCN, thanks to its flexible deployment. However, due to the lack of analytical solution in state-of-art research, it is still unclear how to quantify the advantage that the mobility of UAV brings to migrating the doubly near-far effect. To address this issue, by showing that the optimal UAV trajectory has a multi-location hovering structure, we first derive the closed-form optimal solution of resource allocation, as a function of the UAV hovering location for downlink wireless power transfer (WPT). We then prove that the UAV in our case only needs to hover at a single location for WPT. More importantly, it is explicitly shown that the doubly near far effect can be alleviated into near-far effect. Simulation results validate our analysis. [ABSTRACT FROM AUTHOR]

By fully exploiting the mobility of unmanned aerial vehicles (UAVs), UAV-based aerial base stations (BSs) can move closer to ground users to achieve better communication conditions. In this paper, we consider a scenario where an aerial BS is dispatched for satisfying the data request of a maximum number of ground users, weighted according to their data demand, before exhausting its on-board energy resources. The resulting trajectory optimization problem is a mixed integer non-linear problem (MINLP) which is challenging solve. Specifically, there are coupling constraints which cannot be solved directly. We exploit a penalty decomposition method to reformulate the optimization formulation into a new form and use block coordinate descent technique to decompose the problem into sub-problems. Then, successive convex approximation technique is applied to tackle non-convex constraints. Finally, we propose a double-loop iterative algorithm for the UAV trajectory design. In addition, to achieve a better coverage performance, the problem of designing the initial trajectory for the UAV trajectory is considered. In the results section, UAV trajectories with the proposed algorithm are shown. Numerical results show the coverage performance with the proposed schemes compared to the benchmarks. [ABSTRACT FROM AUTHOR]

This letter considers a solar-powered unmanned aerial vehicle (UAV) system, where the UAV collects data from Internet of Things Devices (IoTDs) on the ground while also charging them using laser charging technology. Both the linear and nonlinear laser charging models are considered. We aim to maximize the residual energy of the UAV while satisfying the requirements of IoTDs by jointly optimizing the three-dimensional (3D) trajectory of UAV and scheduling for IoTDs. The optimization problem is formulated as a mixed integer non-convex problem which is difficult to solve in general. We apply the successive convex approximation and block coordinate descent algorithm to address this problem successfully. Simulation results verify the effectiveness of our algorithm compared with two benchmark methods. [ABSTRACT FROM AUTHOR]

This paper considers secure communications for an underlay cognitive radio network (CRN) in the presence of an external eavesdropper (Eve). The secrecy performance of CRNs is usually limited by the primary receiver's interference power constraint. To overcome this issue, we propose to use an unmanned aerial vehicle (UAV) as a friendly jammer to interfere Eve in decoding the confidential message from the secondary transmitter. Our goal is to jointly optimize the transmit power and UAV's trajectory in the three-dimensional space to maximize the average achievable secrecy rate of the secondary system. The formulated optimization problem is nonconvex due to the non-convexity of the objective and non-convexity of constraints, which is very challenging to solve. To obtain a suboptimal but efficient solution to the design problem, we first transform it into a more tractable form and then develop an iterative algorithm for its solution by leveraging the inner approximation (IA) framework. Combining tools from IA framework and S-procedure, we further extend the proposed algorithm to a more realistic scenario, where the imperfect location information of ground nodes (including Eve, secondary receiver and primary receiver) is considered, resulting in the average worst-case secrecy rate. Extensive numerical results are provided to demonstrate the merits of the proposed algorithms over existing approaches. [ABSTRACT FROM AUTHOR]

In this article, a fast chance-constrained trajectory generation strategy incorporating convex optimization and convex approximation of chance constraints is designed so as to solve the unmanned vehicle path planning problem. A path-length-optimal unmanned vehicle trajectory optimization model is constructed with the consideration of the pitch angle constraint, the curvature radius constraint, the probabilistic control actuation constraint, and the probabilistic collision avoidance constraint. Subsequently, convexification technique is introduced to convert the nonlinear problem formulation into a convex form. To deal with the probabilistic constraints in the optimization model, convex approximation techniques are introduced such that the probabilistic constraints are replaced by deterministic ones while simultaneously preserving the convexity of the optimization model. Numerical results, obtained from a number of case studies, validate the effectiveness and reliability of the proposed approach. A number of comparative studies were also performed. The results confirm that the proposed design is able to produce more optimal flight paths and achieve enhanced computational performance than other chance-constrained optimization approaches investigated in this article. [ABSTRACT FROM AUTHOR]

An unmanned aerial vehicle (UAV)-aided secure communication system is conceived and investigated, where the UAV transmits legitimate information to a ground user in the presence of an eavesdropper (Eve). To guarantee the security, the UAV employs a power splitting approach, where its transmit power can be divided into two parts for transmitting confidential messages and artificial noise (AN), respectively. We aim to maximize the average secrecy rate by jointly optimizing the UAV’s trajectory, the transmit power levels and the corresponding power splitting ratios allocated to different time slots during the whole flight time, subject to both the maximum UAV speed constraint, the total mobility energy constraint, the total transmit power constraint, and other related constraints. To efficiently tackle this non-convex optimization problem, we propose an iterative algorithm by blending the benefits of the block coordinate descent (BCD) method, the concave-convex procedure (CCCP) and the alternating direction method of multipliers (ADMM). Specially, we show that the proposed algorithm exhibits very low computational complexity and each of its updating steps can be formulated in a nearly closed form. Besides, it can be easily extended to the case of three-dimensional (3D) trajectory design. Our simulation results validate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) play a significant role in various 5G or Beyond-5G (B5G)-enabled Internet-of-Things (IoT) applications. However, the UAV performance in an air-ground cooperative network is significantly affected by its mobility and air-to-ground (A2G) communication and computation behaviors. In this paper, a UAV-oriented computation offloading system is investigated, where the UAV desires to complete its onboard computation demands with the assistance of a ground edge-computing infrastructure, i.e., a road-side unit (RSU). The objective is to maximize the energy efficiency of the UAV. Specifically, a non-convex constrained optimal control problem is formulated to optimize the overall energy efficiency of UAV by jointly considering the coupled effects of UAV's longitudinal mobility, A2G communication, and computation dynamics. To address the coupled complexity and non-convexity of the original problem, a primal decomposition approach is developed to transform the problem into a convex subproblem and a primary problem, and then a closed-form optimal transmission power control is derived by solving the subproblem, which is dependent on mobility information. By embedding the closed-form optimal power control into the primary problem, a gradient projection-based iterative algorithm is proposed to obtain a joint optimal solution for both the longitudinal acceleration control and the power control, the feasibility and convergence of which is also theoretically proven. Extensive simulations have been conducted to validate the effectiveness of the proposed method in terms of constraint satisfaction and convergence speed, and comparative results also demonstrate that it can outperform other benchmark methods in terms of global energy efficiency. [ABSTRACT FROM AUTHOR]

In practical scenarios, flight trajectories shall be smooth to comply with the required curvature behavior. This article describes a trajectory generation method that is able to produce smooth control commands with an arbitrary order of smoothness. The system inputs are formulated analytically as trigonometric series in which the coefficients are to be determined by optimization. Effective implementations of the proposed method are presented. These include a numerical benchmark that shows how the order of the series shapes the results as well as the comparison with the optimal solution, and the unmanned aerial vehicle transition trajectory generation using a convex optimization framework integrated with the proposed design. [ABSTRACT FROM AUTHOR]

Data collected from densely deployed IoT sensor nodes via UAVs may incur remarkable redundancy, unnecessarily wasting the UAV power. This paper introduces a framework of UAV trajectory planning for optimizing energy efficiency via data-similarity-based node selection while maintaining sufficient information integrity out of the refined data. The proposed framework consists of three phases, namely data similarity determination, redundant nodes removal , and UAV trajectory planning. In particular, we propose a sliding-window dynamic time warping (SDTW) algorithm to quantify the data similarity between nodes. Then a hybrid genetic ant colony algorithm (HGACA) is introduced for the redundant node removal, where data similarity and UAV energy consumption are jointly considered. Finally, we formulate the trajectory planning problem as a three-stage integer linear programming (ILP) model, which clusters the nodes with minimal overlap and finds the shortest UAV cruising path that traverses each cluster head once and only once. The simulation result demonstrates that the proposed framework outperforms all the considered counterparts under various threshold values of data similarity in terms of execution time and power consumption while maintaining information integrity. [ABSTRACT FROM AUTHOR]

With the exponential growth of data traffic, caching is regarded as a promising solution to combine with unmanned aerial vehicle (UAV)-assisted networks, which can offload cellular traffic and improve the system performance. Moreover, the cache capacity at user side can be leveraged, e.g., through local data storage or device-to-device (D2D) sharing. In this paper, we focus on the performance analysis and trajectory optimization of cache-enabled UAV-assisted networks with underlaid D2D communications. We consider both static and dynamic UAV deployments. For static UAV deployment, we first formulate an optimization problem to design the cache placement in order to maximize the cache hit probability. Then, the successful transfer probability (STP) and sum-rate are analyzed by using stochastic geometry, and their closed-form expressions are derived. For dynamic UAV deployment, the UAV moves over the cell and stops at several path points to serve users. To shorten the time required for the UAV to cover all users, a spiral algorithm is proposed to optimize the UAV trajectory, aiming at minimizing the number of UAV path points. Moreover, since at different locations, the UAV communication will incur different interference on D2D users, we derive the outage probability for the D2D users. Simulation results show the significant performance gain of our proposed probabilistic cache placement over existing strategies. For a given user density, we show that the optimal values for the UAV height which lead to the maximum UAV-STP and sum-rate exist. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the unmanned aerial vehicle (UAV)-aided simultaneous uplink and downlink transmission networks, where one UAV acting as a disseminator is connected to multiple access points (AP), and the other UAV acting as a base station (BS) collects data from numerous sensor nodes (SNs). The goal of this paper is to maximize the system throughput by jointly optimizing the 3D UAV trajectory, communication scheduling, and UAV-AP/SN transmit power. We first consider a special case where the UAV-BS and UAV-AP trajectories are pre-determined. Although the resulting problem is an integer and non-convex optimization problem, a globally optimal solution is obtained by applying the polyblock outer approximation (POA) method based on the problem’s hidden monotonic structure. Subsequently, for the general case considering the 3D UAV trajectory optimization, an efficient iterative algorithm is proposed to alternately optimize the divided sub-problems based on the successive convex approximation (SCA) technique. Numerical results demonstrate that the proposed design is able to achieve significant system throughput gain over the benchmarks. In addition, the SCA-based method can achieve nearly the same performance as the POA-based method with much lower computational complexity. [ABSTRACT FROM AUTHOR]

The population of nano satellites has increased dramatically in recent years, but there are few launch vehicles providing dedicated launch opportunities for them. This paper presents the conceptual design of an innovative nano air launch vehicle, dedicated to providing exclusive launch opportunity to nano satellites weighing 10 kg or less. This nano launcher is a three-stage launch vehicle carried by a twin-fuselage unmanned aerial vehicle and released at an altitude of 10 km from a velocity of 0.5Ma. The air launch vehicle is innovative in two senses: firstly, it adopts a novel air launch method. Before separation, the launch vehicle is adjusted to a large angle of attack by the carrier aircraft. The launch vehicle only needs to keep attitude stable after separation, and sequentially when first stage ignites, the orientation of the thrust is inclined upward so that the thrust can provide enough vertical force to pull up the flight path angle rapidly, without aid from large wings; secondly, a terminal lumped control unit is applied to undertake the flight control task on its own. The terminal lumped control unit is a combination of four thrusters that share the liquid propellant with the last stage's main engine. With the terminal lumped control unit, the air launch vehicle needs no movable attitude control instruments, including thrust vectoring gimbals and movable wings. This innovative flight control strategy makes the launch vehicle very simple in structure and light in weight. Multidisciplinary modeling of the nano launcher is performed and genetic algorithm is applied for optimization. Among all the disciplines, trajectory optimization is key in checking the feasibility of the design, for which the Radau pseudospectral method is successfully implemented to obtain the optimal ascent trajectory. The optimal nano launcher has a gross take-off weight of 1365 kg. Finally, a sensitivity analysis is performed to check the robustness of the result using Monte Carlo simulation method. • The conceptual design of an innovative air-launched vehicle is presented, carried by a twin-fuselage UAV. • The flight control is terminal lumped, which means the launcher does not need any thrust gimbals or other movable actuators. • A novel air launch method is put forward to help the launcher get rid of large wings on the first stage. • MDO is implemented using genetic algorithm, with the optimal trajectory obtained by Radau Pseudospectral Method. • The sensitivity analysis is performed using Monte-Carlo simulation. [ABSTRACT FROM AUTHOR]

The application of unmanned aerial vehicles (UAVs) to emerging communication systems has attracted a lot of research interests due to the advantages of UAVs, such as high mobility, flexible deployment, and cost-effectiveness. The UAV-carried base stations (UAV-BS) can provide on-demand service to users in temporary or emergency events. However, how to optimize the communication performance of a UAV-BS with a limited-bandwidth wireless backhaul is still a challenge. This paper focuses on improving the spectrum efficiency of a UAV-BS while guaranteeing user fairness under in-band backhaul constraint. We propose to maximize the minimum user rate among all the users served by the UAV-BS by jointly optimizing the allocation of bandwidth and transmit power, as well as the trajectory of the UAV-BS. As the formulated problem is non-convex, we propose an efficient algorithm to solve it suboptimally based on the alternating optimization and successive convex optimization methods. Computer simulation results show that the proposed algorithm achieves a significantly higher minimum user rate than the benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-aided Wireless Rechargeable Sensor Network (WRSN) is a promising application in providing sustainable power supply to the rechargeable sensor nodes (SNs). Constructing a trajectory for the UAV to traverse all SNs with the cheapest cost is an important issue in UAV-aided WRSN. Although some exact algorithms and heuristic methods have been proposed, they cannot achieve a superb result for the large-scale scene within the tolerable time. In this paper, we study the UAV‘s trajectory optimization problem from a novel viewpoint that the designed trajectory should maximize the UAV's energy utilization efficiency. The maximum UAV's energy utilization efficiency problem is decomposed as integer programming and non-convex optimization problems. For the problem that UAV‘s charging position is fixed, we have speeded the algorithm's performance by limiting the search direction, the initial search position, and the search space. In the other case, where the power transfer efficiency is unchangeable within a certain distance, a polynomial-time randomized approximation scheme (PRAS) is presented to find the approximate minimum number of hovering locations. We have presented TPA-FCP and TPA-ERC to solve the above problems, respectively. The numerical results verify that our proposed algorithms effectively reduce the length of optimal trajectory and the time complexity. Besides, the energy carried by the UAV for the specified task is predictable, which provides valuable information for arranging the UAV's flight task. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV)-enabled communication has emerged as an appealing technology for efficient data collection in wireless sensor networks (WSNs). This paper considers a scenario where multiple UAVs collect data from a group of sensor nodes (SNs) on the ground. We study the fundamental tradeoff between the aerial cost, which is defined by the propulsion energy consumption and operation costs of all UAVs, and the ground cost, which is defined as the energy consumption of all SNs. To characterize such a tradeoff, an optimization problem is formulated to minimize the weighted sum of the above two costs, by optimizing the UAV trajectory jointly with wake-up time allocation, as well as the transmit power of all SNs. As the formulated problem is non-convex, it is difficult to be optimally solved in general. To tackle this issue, we decouple it into two sub-problems: UAV trajectory and wake-up time allocation optimization, as well as SN transmit power optimization. We propose an iterative algorithm to solve the two sub-problems by leveraging successive convex approximation and alternating optimization techniques. In addition, a new approach is proposed to design the UAV initial trajectory with multiple travelling salesman problem (MTSP) technique. Simulations are conducted to corroborate our study and show the flexible tradeoff achieved by the proposed design for cost balance between UAVs and SNs. [ABSTRACT FROM AUTHOR]

In this paper, we study unmanned aerial vehicle (UAV) assisted mobile edge computing (MEC) with the objective to optimize computation offloading with minimum UAV energy consumption. In the considered scenario, a UAV plays the role of an aerial cloudlet to collect and process the computation tasks offloaded by ground users. Given the service requirements of users, we aim to maximize UAV energy efficiency by jointly optimizing the UAV trajectory, the user transmit power, and computation load allocation. The resulting optimization problem corresponds to nonconvex fractional programming, and the Dinkelbach algorithm and the successive convex approximation (SCA) technique are adopted to solve it. Furthermore, we decompose the problem into multiple subproblems for distributed and parallel problem solving. To cope with the case when the knowledge of user mobility is limited, we adopt a spatial distribution estimation technique to predict the location of ground users so that the proposed approach can still be applied. Simulation results demonstrate the effectiveness of the proposed approach for maximizing the energy efficiency of UAV. [ABSTRACT FROM AUTHOR]

This paper investigates unmanned aerial vehicle (UAV)-aided backscatter communication (BackCom) networks, where the UAV is leveraged to help the backscatter device (BD) forward signals to the receiver. Based on the presence or absence of a direct link between BD and receiver, two protocols, namely transmit-backscatter (TB) protocol and transmit-backscatter-relay (TBR) protocol, are proposed to utilize the UAV to assist the BD. In particular, we formulate the system throughput maximization problems for the two protocols by jointly optimizing the time allocation, reflection coefficient and UAV trajectory. Different static/dynamic circuit power consumption models for the two protocols are analyzed. The resulting optimization problems are shown to be non-convex, which are challenging to solve. We first consider the dynamic circuit power consumption model, and decompose the original problems into three sub-problems, namely time allocation optimization with fixed UAV trajectory and reflection coefficient, reflection coefficient optimization with fixed UAV trajectory and time allocation, and UAV trajectory optimization with fixed reflection coefficient and time allocation. Then, an efficient iterative algorithm is proposed for both protocols by leveraging the block coordinate descent method and successive convex approximation (SCA) techniques. In addition, for the static circuit power consumption model, we obtain the optimal time allocation with a given reflection coefficient and UAV trajectory and the optimal reflection coefficient with low computational complexity by using the Lagrangian dual method. Simulation results show that the proposed protocols are able to achieve significant throughput gains over the compared benchmarks. [ABSTRACT FROM AUTHOR]

This paper considers covert communications in the context of unmanned aerial vehicle (UAV) networks, aiming to hide a UAV for transmitting critical information out of an area that is monitored and where communication is not allowed. Specifically, the UAV as a transmitter intends to transmit information to a legitimate receiver (Bob) covertly while avoiding being detected by a warden (Willie), where location uncertainty exists at Bob and/or Willie. In order to enhance the considered covert communication performance, we jointly optimize the UAV's trajectory and transmit power in terms of maximizing the average covert transmission rate from the UAV to Bob subject to transmission outage constraint and covertness constraint. The formulated optimization problem is difficult to tackle directly due to the intractable constraints. As such, we first employ conservative approximation to transform a constraint into a deterministic form and then apply the first-order restrictive approximation to transform the optimization problem into a convex form. By applying the successive convex approximation technique, an efficient iterative algorithm is developed to solve the optimization problem. Our examination shows that the developed joint trajectory and transmit power optimization scheme achieves significantly better covert communication performance as compared to a benchmark scheme. [ABSTRACT FROM AUTHOR]

This paper investigates a multiple unmanned aerial vehicles (UAVs) enabled cooperative secure transmission scheme in the presence of multiple potential eavesdroppers. Specifically, multiple source UAVs (SUAVs) send confidential information to multiple legitimate ground users, and in the meantime, multiple jamming UAVs cooperatively transmit interference signals to multiple eavesdroppers in order to improve the legitimate users’ achievable secrecy rate. By taking into account the limited energy budget of UAV, our goal is to maximize the system secrecy energy efficiency (SEE), namely the achievable secrecy rate per energy consumption unit, by jointly optimizing the UAV trajectory, transmit power, and user scheduling under the constraints of UAV mobility as well as the maximum transmit power. The resulting optimization problem is shown to be a non-convex and mixed-integer fractional optimization problem, which is challenging to solve. We decompose the original problem into three sub-problems, and then, an efficient iterative algorithm is proposed by leveraging the block coordinate descent method and Dinkelbach method in combination with successive convex approximation techniques. Simulation results show that the proposed scheme outperforms the other benchmarks significantly in terms of the system SEE. [ABSTRACT FROM AUTHOR]