Search

In this paper, the problem of cooperative search and tracking by multiple flying vehicles is studied. An algorithm is proposed based on optimal planning by minimizing a suitably defined cost function. In order to define the cost function, three maps are proposed: uncertainty map, detection probability map, and emitter map. In the uncertainty map, the geometrical status of the vehicle with respect to the region is considered and its suitability is measured. The detection probability map is defined such that the group of vehicles can detect new emitters that appear in their sensors’ coverage. Finally, the emitter map is a tool to keep tracking the detected emitters with acceptable error while searching the region. The assumption that the vehicles are equipped with only one commonly used radar range indicator sensor makes the proposed algorithms more applicable in the real world for a cost-effective system. The efficiency of the proposed method from the search, detection, and tracking points of view is verified through simulations.

With the inherent advantages of exceptional maneuverability, flexible deployment options and cost-effectiveness, unmanned aerial vehicles (UAVs) present themselves as a viable solution for providing aerial communication services to Internet of Things devices in high-traffic or remote areas. Nevertheless, the openness of the air–ground channel poses significant security challenges to UAV-based wireless systems. In this paper, a UAV-assisted secure communication system model is established based on non-orthogonal multiple access (NOMA) from the perspective of physical layer security, aiming to conceal the transmission behavior between UAVs and legitimate users (LUs). Specifically, a mobile UAV assumes the role of an aerial base station, leveraging NOMA technique to transmit data to LUs while evading detection from mobile eavesdropper situated on the ground. To fortify the security performance of the system, a hovering UAV acts as a friendly jammer and transmits interference signals to mobile eavesdropper (referred to as Eve). The objective of this scheme is to maximize the minimum average secure rate of all LUs by meticulously optimizing the trajectory and power allocation of the mobile UAV, subject to secrecy performance constraints. The highly interdependent and non-convex nature of this optimization problem renders direct solutions infeasible. Hence, this paper designs an efficient iterative algorithm that decouples the original problem into two subproblems, enabling an alternating optimization process for the trajectory and power allocation of the mobile UAV until the convergence of the objective function is achieved. Simulation results demonstrate that the proposed algorithm effectively improves the minimum average secure rate of all LUs compared with the benchmark scheme. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAVs) is capable of adding significant potential to the internet of thing (IoT) devices and hence smart UAV–IoT collaborative system has attracted the attention of many researchers. This system has to be energy efficient for its nature and functionalities. Optimized trajectory planning is a significant area of research for any automatic movable device. In this article, we propose a technique, called EETO-GA for energy-efficient trajectory optimization of UAV–IoT using a genetic algorithm (GA). This technique prescribes each device of: (i) the next timestamp of arrival on the present cluster of IoT devices, at which the task queue of its header contains the highest possible number of tasks, and (ii) the minimum amount of energy that requires to complete all the tasks present in task queue of the IoT device. This technique uses a GA for optimization where the fitness function is designed by optimizing objectives: (i) the total number of tasks that can be completed, (ii) minimization of consumed energy, and (iii) the number of devices that could be served. A GA is applied here to accommodate a large number of IoT devices. A binary method of encoding is applied and methods like cross-over and mutation are used to arrive at the optimal solution. Through a simulation study, the proposed technique shows significant improvement in terms of UAV energy saved (UAVE), energy saving in IoT devices (IoTDEC), the average delay in execution of the task (ADET), and the percentage of tasks that could be completed (PTSK). Proposed EETO-GA improved average UAVE: 43%, IoTDEC: 56%, PTSK: 7.5%, and ADET: 38% over the state of the art. [ABSTRACT FROM AUTHOR]

The decline of natural pollinators necessitates the development of novel pollination technologies. In this work, we propose a drone-enabled autonomous pollination system (APS) that consists of five primary modules: environment sensing, flower perception, path planning, flight control, and pollination mechanisms. These modules are highly dependent upon each other, with each module relying on inputs from the other modules. In this paper, we focus on approaches to the flower perception, path planning, and flight control modules. First, we briefly introduce a flower perception method from our previous work to create a map of flower locations. With a map of flowers, APS path planning is defined as a variant of the Travelling Salesman Problem (TSP). Two path planning approaches are compared based on mixed-integer programming (MIP) and genetic algorithms (GA), respectively. The GA approach is chosen as the superior approach due to the vast computational savings with negligible loss of optimality. To accurately follow the generated path for pollination, we develop a convex optimization approach to the quadrotor flight control problem (QFCP). This approach solves two convex problems. The first problem is a convexified three degree-of-freedom QFCP. The solution to this problem is used as an initial guess to the second convex problem, which is a linearized six degree-of-freedom QFCP. It is found that changing the objective of the second convex problem to minimize the deviation from the initial guess provides improved physical feasibility and solutions similar to a general-purpose optimizer. The path planning and flight control approaches are then tested within a model predictive control (MPC) framework where significant computational savings and embedded adjustments to uncertainty are observed. Coupling the two modules together provides a simple demonstration of how the entire APS will operate in practice. [ABSTRACT FROM AUTHOR]

This paper presents PANTHER, a real-time perception-aware (PA) trajectory planner for multirotor-UAVs (Unmanned Aerial Vehicles) in dynamic environments. PANTHER plans trajectories that avoid dynamic obstacles while also keeping them in the sensor field of view (FOV) and minimizing the blur to aid in object tracking. The rotation and translation of the UAV are jointly optimized, which allows PANTHER to fully exploit the differential flatness of multirotors to maximize the PA objective. Real-time performance is achieved by implicitly imposing the underactuated dynamics of the UAV through the Hopf fibration. PANTHER is able to keep the obstacles inside the FOV 7.9 and 1.5 times more than non-PA approaches and PA approaches that decouple translation and yaw, respectively. The projected velocity (and hence the blur) is reduced by 18% and 34%, respectively. This leads to average success rates three times larger than state-of-the-art approaches in multi-obstacle avoidance scenarios. The MINVO basis is used to impose low-conservative collision avoidance constraints in position and velocity space. Finally, extensive hardware experiments in unknown dynamic environments with all the computation running onboard are presented, with velocities of up to 5.8 m/s, and with relative velocities (with respect to the obstacles) of up to 6.3 m/s. The only sensors used are an IMU, a forward-facing depth camera, and a downward-facing monocular camera.

Unmanned Aerial Vehicles (UAVs) have attacted much attention in the field of wireless communication due to its agility and altitude. UAVs can be used as low-altitude aerial base stations (UAV-BSs) to provide communication services for ground devices (GDs) in various scenarios, such as emergency communication and traffic offloading in hotspots. However, due to the limited communication ranges and high prices of commercial UAV-BSs, covering a target area all the time with sufficient UAVs is quite challenging, especially under dynamic environment. We need to design the trajectory of the UAV-BSs to optimize system performance. Most existing works focus on the energy-efficient coverage and throughput maximization but ignore the fairness of communication service, especially the fairness at user-level. Besides, reinforcement learning is suitable for solving decision problems in dynamic environments. However, most existing works use centralized deep reinforcement learning (DRL) approaches. Due to the scalability and low time complexity, a distributed DRL approach is more suitable for multiple UAV-BSs communication system in dynamic environment. Unlike previous works, we characterize the fairness at user-level based on proportional fairness scheduling and formulate a weighted-throughput maximization problem via designing UAV-BSs’ trajectory. Then we model the dynamic deploymentproblem of UAV-BSs as a Markov game and propose a multi-agent deep reinforcement learning-based distributed UAV-BSs control approach named MAUC. MAUC approach adopts the framework of centralized training with distributed execution. Simulation results show that the MAUC can improve fairness of communication service by sacrificing a small amount of throughput. [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]

The decline of natural pollinators necessitates the development of novel pollination technologies. In this work, we propose a drone-enabled autonomous pollination system (APS) that consists of five primary modules: environment sensing, flower perception, path planning, flight control, and pollination mechanisms. These modules are highly dependent upon each other, with each module relying on inputs from the other modules. In this paper, we focus on approaches to the flower perception, path planning, and flight control modules. First, we briefly introduce a flower perception method from our previous work to create a map of flower locations. With a map of flowers, APS path planning is defined as a variant of the Travelling Salesman Problem (TSP). Two path planning approaches are compared based on mixed-integer programming (MIP) and genetic algorithms (GA), respectively. The GA approach is chosen as the superior approach due to the vast computational savings with negligible loss of optimality. To accurately follow the generated path for pollination, we develop a convex optimization approach to the quadrotor flight control problem (QFCP). This approach solves two convex problems. The first problem is a convexified three degree-of-freedom QFCP. The solution to this problem is used as an initial guess to the second convex problem, which is a linearized six degree-of-freedom QFCP. It is found that changing the objective of the second convex problem to minimize the deviation from the initial guess provides improved physical feasibility and solutions similar to a general-purpose optimizer. The path planning and flight control approaches are then tested within a model predictive control (MPC) framework where significant computational savings and embedded adjustments to uncertainty are observed. Coupling the two modules together provides a simple demonstration of how the entire APS will operate in practice.

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]

The focus of this paper is the use of Unmanned Aerial Vehicles (UAVs) for searching multiple targets under uncertain conditions in the minimal possible time. The problem, known as Minimum Time Search (MTS), belongs to the Probabilistic Search (PS) field and addresses critical missions, such as search & rescue, and military surveillance. These operations, characterized by complex and uncertain environments, demand efficient UAV trajectory optimization. The multi-target version of PS introduces additional challenges, due to their higher complexity and the need to wisely distribute the UAV's efforts among multiple targets. In order to tackle the under-explored multi-target aspect of MTS, we optimize the time to find all targets with new Ant Colony Optimization (ACO)-based planner. This novel optimization criterion is formulated using Bayes' theory, considering probability models of the targets (initial belief and motion model) and the sensor likelihood. Our work contributes significantly by (i) developing an objective function tailored for multi-target MTS, (ii) proposing an ACO-based planner designed to effectively handle the complexities of multiple moving targets, and (iii) introducing a novel constructive heuristic that is used by the ACO-based planner, specifically designed for the multi-target MTS problem. The efficacy of our approach is demonstrated through comprehensive analysis and validation across various scenarios, showing superior performance over existing methods in complex multi-target MTS problems. • Efficient optimization of drone trajectories in multi-target search missions. • Expected time of finding the targets as a key criterion in multi-target detection. • New multi-target heuristic enhances the performance of minimum time search planners. • Proposed Ant Colony-based planner optimizes search paths in complex missions. [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]

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]

This paper considers an unmanned aerial vehicle (UAV)-aided millimeter Wave (mmWave) multiple-input-multiple-output (MIMO) non-orthogonal multiple access (NOMA) system, where a UAV serves as a flying base station (BS) to provide wireless access services to a set of Internet of Things (IoT) devices in different clusters. We aim to maximize the downlink sum rate by jointly optimizing the three-dimensional (3D) placement of the UAV, beam pattern and transmit power. To address this problem, we first transform the non-convex problem into a total path loss minimization problem, and hence the optimal 3D placement of the UAV can be achieved via standard convex optimization techniques. Then, the multiobjective evolutionary algorithm based on decomposition (MOEA/D) based algorithm is presented for the shaped-beam pattern synthesis of an antenna array. Finally, by transforming the original problem into an optimal power allocation problem under the fixed 3D placement of the UAV and beam pattern, we derive the closed-form expression of transmit power based on Karush-Kuhn-Tucker (KKT) conditions. In addition, inspired by fraction programming (FP), we propose a FP-based suboptimal algorithm to achieve a near-optimal performance. Numerical results demonstrate that the proposed algorithm achieves a significant performance gain in terms of sum rate for all IoT devices, as compared with orthogonal frequency division multiple access (OFDMA) scheme. [ABSTRACT FROM AUTHOR]

Due to the inherent mobility and enhanced communication capability of the unmanned aerial vehicle (UAV), it is foreseen that effective UAV-based sensing schemes can achieve faster deployment and flexible observation as compared to the traditional fixed sensing systems. In many sensing applications, multiple geographically distributed tasks need to be executed while satisfying a stringent requirement on the transmission delay of the sensory data, especially for the time-critical sensing tasks, such as disaster rescue and environment monitoring. To minimize the overall mission completion time in such delay constrained multi-task UAV-based sensing applications, it is imperative to properly design the inter-task trajectory, the UAV-BS association, and the sensing order. Nonetheless, finding the optimal sensing scheme is highly non-trivial since these three sub-problems are tightly coupled and involve non-convex constraints. To overcome these challenges, firstly, a novel space pruning based trajectory search (SPTS) algorithm is proposed by exploiting the geometric characteristics of the optimal inter-task UAV trajectory, which can achieve a substantially faster convergence as compared to the Ployblock algorithm. Secondly, a novel optimal UAV-BS association (OUBA) algorithm is presented to quickly identify the best BS for each sensing task. Thirdly, by combining these two proposed algorithms with the Lin-Kernighan-Helsgaun (LKH) algorithm, a lower bound of the mission completion time can be efficiently computed and a near-optimal solution can be obtained. Numerical simulations demonstrate that significant performance improvement can be achieved by the proposed scheme. [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]

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]

In the finite blocklength scenario, which is suitable for practical applications, a method of maximizing the average effective secrecy rate (AESR) is proposed for a UAV-enabled secure communication by optimizing the UAV's trajectory and transmit power subject to the UAV's mobility constraints and transmit power constraints. To address the formulated non-convex optimization problem, it is first decomposed into two non-convex subproblems. Then the two subproblems are converted respectively into two convex subproblems via the first-order approximation. Finally, an alternating iteration algorithm is developed by solving the two subproblems iteratively based on successive convex approximation (SCA) technique. Numerical results show that our proposed scheme can achieve a 6% to 13% improvement on the AESR performance compared with the benchmark schemes. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) has been widely applied in internet-of-things (IoT) scenarios while the security for UAV communications remains a challenging problem due to the broadcast nature of the line-of-sight (LoS) wireless channels. This article investigates the security problems for dual UAV-assisted mobile edge computing (MEC) systems, where one UAV is invoked to help the ground terminal devices (TDs) to compute the offloaded tasks and the other one acts as a jammer to suppress the vicious eavesdroppers. In our framework, minimum secure computing capacity maximization problems are proposed for both the time division multiple access (TDMA) scheme and non-orthogonal multiple access (NOMA) scheme by jointly optimizing the communication resources, computation resources, and UAVs’ trajectories. The formulated problems are non-trivial and challenging to be solved due to the highly coupled variables. To tackle these problems, we first transform them into more tractable ones then a block coordinate descent based algorithm and a penalized block coordinate descent based algorithm are proposed to solve the problems for TDMA and NOMA schemes, respectively. Finally, numerical results show that the security computing capacity performance of the systems is enhanced by the proposed algorithms as compared with the benchmarks. Meanwhile, the NOMA scheme is superior to the TDMA scheme for security improvement. [ABSTRACT FROM AUTHOR]

Due to the small size, low cost, and autonomous nature, unmanned aerial vehicles (UAVs) have attracted growing attention in improving traditional networks’ performance. This paper considers a multi-UAV enabled large-scale wireless recharge networks, where a group of UAVs is dispatched as mobile wireless power transfer, and information collection systems to serve a set of ground low-power sensor nodes. Specifically, the UAVs employ radio frequency (RF) wireless power transfer (WPT) to supply energy towards the sensor nodes, and the communication services are available via wireless information transfer (WIT) systems. To achieve balanced energy consumption among UAVs, we maximize the energy utilization efficiency of UAVs, and minimize the communication delay by optimizing the trajectory jointly with constraints of the energy capacity, and the area of the target region. The formulated problem is a mixed-integer programming problem that is a variation of multiple traveling salesman problem. Thus we present a heuristic algorithm that combines the evolutionary algorithm, and variable neighborhood search to achieve the optimal visited sequence of the sensor nodes. Finally, extensive numerical results are provided to evaluate the performance of the proposed algorithm. It draws new insights on the estimation of the feasibility of the given UAVs whose energy capacity is limited. [ABSTRACT FROM AUTHOR]

A network composed of unmanned aerial vehicles (UAVs), serving as base stations (UAV-BS network), is emerging as a promising component in next-generation communication systems. In the UAV-BS network, the optimal positioning of a UAV-BS is an essential requirement to establish line-of-sight (LoS) links for ground users. A novel deep Q-network (DQN)-based learning model enabling the optimal deployment of a UAV-BS is proposed. Moreover, without re-learning of the model and the acquisition of the path information of ground users, the proposed model presents the optimal UAV-BS trajectory while ground users move. Specifically, the proposed model optimizes the trajectory of a UAV-BS by maximizing the mean opinion score (MOS) for ground users who move to various paths. Furthermore, the proposed model is highly practical because, instead of the locations of individual mobile users, an average channel power gain is used as an input parameter. The accuracy of the proposed model is validated by comparing the results of the model with those of a mathematical optimization solver.

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]

This paper considers a rotary-wing unmanned aerial vehicle (UAV)-enabled wireless power transfer system, where a UAV is dispatched as an energy transmitter (ET), transferring radio frequency (RF) signals to a set of energy receivers (ERs) periodically. We aim to maximize the energy harvested at all ERs by jointly optimizing the UAV's three-dimensional (3D) placement, beam pattern and charging time. However, the considered optimization problem taking into account the drone flight altitude and the wireless coverage performance is formulated as a non-convex problem. To tackle this problem, we propose a low-complexity iterative algorithm to decompose the original problem into four sub-problems in order to optimize the variables sequentially. In particular, we first use the sequential unconstrained convex minimization based algorithm to find the globally optimal UAV two-dimensional (2D) position. Subsequently, we can directly obtain the optimal UAV altitude as the objective function of problem is monotonic decreasing with respect to UAV altitude. Then, we propose the multiobjective evolutionary algorithm based on decomposition (MOEA/D) based algorithm to control the phase of antenna array elements, in order to achieve high steering performance of multi-beams. Finally, with the above solved variables, the original problem is reformulated as a single-variable optimization problem where charging time is the optimization variable, and can be solved using the standard convex optimization techniques. Furthermore, we use the branch and bound method to design the UAV trajectory which can be constructed as traveling salesman problem (TSP) to minimize flight distance. Numerical results validate the theoretical findings and demonstrate that significant performance gain in terms of sum received power of ERs can be achieved by the proposed algorithm in UAV-enabled wireless power transfer networks. [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]

In the past several years, unmanned aerial vehicle (UAV) have been employed to provide enhanced coverage or relay service to mobile users in a scenario with limited or even no infrastructure since they can be deployed to almost everywhere and can be manipulated at anytime. This paper studies UAV as aerial base station (BS) enabled wireless communication system, where a UAV is dispatched to provide wireless communication service to a set of ground users with difference quality-of-experience (QoE) requirements. In real world, user requirements are randomly and unevenly distributed. In addition, UAV communication coverage and on-board energy are limited and system resources are also limited (e.g., transmission power, spectrum). In order to meet the QoE of all users with limited system resources and limited UAV energy, we jointly optimize user communication scheduling, UAV trajectory, transmit power and bandwidth allocation to maximize energy-efficiency and satisfy user QoE requirement. The formulated problem is mixes integer non-convex and non-concave so it is difficult to solve. In this paper, we solvevv the problem with two steps as follows. Firstly, we transform the objective function into a tractable form. Secondly, we divide the optimal problem into four sub-optimal problems, and then use a powerful iterative algorithm with the Dinkelbach and block coordinate descent to solve the optimal problem. That is to say, the user scheduling, UAV trajectory, transmission power and bandwidth allocation are alternately optimized in each iteration. Extensive simulation results present that our proposed method can obtain higher energy efficiency than that of baselines. Specifically, the energy efficiency obtained by our proposed method is 12.5% higher than the approach that only maximizes throughput. [ABSTRACT FROM AUTHOR]

For an unmanned aerial vehicle (UAV) carrying out a maritime radar surveillance mission, there is a tradeoff between maximizing information obtained from the search area and minimizing fuel consumption. This article presents an approach for the optimization of a UAV's trajectory for maritime radar wide area persistent surveillance to simultaneously minimize fuel consumption, maximize mean probability of detection, and minimize mean revisit time. Quintic polynomials are used to generate UAV trajectories due to their ability to provide complete and complex solutions while requiring few inputs. Furthermore, the UAV dynamics and surveillance mission requirements are used to ensure that a trajectory is realistic and mission compatible. A wide area search radar model is used within this article in conjunction with a discretized grid in order to determine the search area's mean probability of detection and mean revisit time. The trajectory generation method is then used in conjunction with a multiobjective particle swarm optimization algorithm to obtain a global optimum in terms of path, airspeed (and thus time), and altitude. The performance of the approach is then tested over two common maritime surveillance scenarios and compared to an industry recommended baseline. [ABSTRACT FROM AUTHOR]

The explosive data traffic and connections in 5G networks require the use of non-orthogonal multiple access (NOMA) to accommodate more users. Unmanned aerial vehicle (UAV) can be exploited with NOMA to improve the situation further. In this paper, we propose a UAV-assisted NOMA network, in which the UAV and base station (BS) cooperate with each other to serve ground users simultaneously. The sum rate is maximized by jointly optimizing the UAV trajectory and the NOMA precoding. To solve the optimization, we decompose it into two steps. First, the sum rate of the UAV-served users is maximized via alternate user scheduling and UAV trajectory with its interference to the BS-served users below a threshold. Then, the optimal NOMA precoding vectors are obtained using two schemes with different constraints. The first scheme intends to cancel the interference from the BS to the UAV-served user, while the second one restricts the interference to a given threshold. In both schemes, the non-convex optimization problems are converted into tractable ones. An iterative algorithm is designed. Numerical results are provided to evaluate the effectiveness of the proposed algorithms for the hybrid NOMA and UAV network. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) can be utilized as a relay to connect nodes with long distance, which can achieve significant throughput gain owing to its mobility and line-of-sight (LoS) channel with ground nodes. However, such LoS channels make UAV transmission easy to eavesdrop. In this paper, we propose a novel scheme to guarantee the security of UAV-relayed wireless networks with caching via jointly optimizing the UAV trajectory and time scheduling. For every two users that have cached the required file for the other, the UAV broadcasts the files together to these two users, and the eavesdropping can be disrupted. For the users without caching, we maximize their minimum average secrecy rate by jointly optimizing the trajectory and scheduling, with the secrecy rate of the caching users satisfied. The corresponding optimization problem is difficult to solve due to its non-convexity, and we propose an iterative algorithm via successive convex optimization to solve it approximately. Furthermore, we also consider a benchmark scheme in which we maximize the minimum average secrecy rate among all users by jointly optimizing the UAV trajectory and time scheduling when no user has the caching ability. Simulation results are provided to show the effectiveness and efficiency of our proposed scheme. [ABSTRACT FROM AUTHOR]

This paper studies the physical layer security of an unmanned aerial vehicle (UAV) network, where a UAV base station (UAV-B) transmits confidential information to multiple information receivers (IRs) with the aid of a UAV jammer (UAV-J) in the presence of multiple eavesdroppers. We formulate an optimization problem to jointly design the trajectories and transmit power of UAV-B and UAV-J in order to maximize the minimum average secrecy rate over all IRs. The optimization problem is non-convex and the optimization variables are coupled, which leads to the optimization problem being mathematically intractable. As such, we decompose the optimization problem into two subproblems and then solve it by employing an alternating iterative algorithm and the successive convex approximation technique. Our results show that the average secrecy rate performance of the proposed scheme provides about 20% and 150% performance gains over the joint trajectory and transmit power optimization without UAV-J scheme and the transmit power optimization with fixed trajectory scheme at flight period $T=150$  s, respectively. [ABSTRACT FROM AUTHOR]

The use of unmanned aerial vehicles (UAVs) as communication platforms is of great significance in future wireless networks, especially for on-demand deployment in temporary events and emergency situations. Although prior works have shown the performance improvement by exploiting the UAV’s mobility, they mainly focus on delay-tolerant applications. As delay requirements fundamentally limit the UAV’s mobility, it remains unknown whether the UAV is able to provide any performance gain in delay-constrained communication scenarios. Motivated by the above, we study, in this paper, an UAV-enabled orthogonal frequency-division multiple access (OFDMA) network where an UAV is dispatched as the mobile base station (BS) to serve a group of users on the ground. We consider a minimum-rate ratio (MRR) for each user, defined as the minimum instantaneous rate required over the average achievable throughput, to flexibly adjust the percentage of its delay-constrained data traffic. Under a given set of constraints on the users’ MRRs, we aim to maximize the minimum average throughput of all users by jointly optimizing the UAV trajectory and OFDMA resource allocation. First, we show that the max–min throughput in general decreases as the users’ MRRs become larger, which reveals a fundamental throughput-delay tradeoff in UAV-enabled communications. Next, we propose an iterative parameter-assisted block coordinate descent method to optimize the UAV trajectory and OFDMA resource allocation alternately, by applying the successive convex optimization and the Lagrange duality, respectively. Furthermore, an efficient and systematic UAV trajectory initialization scheme is proposed based on the simple circular trajectory. Finally, simulation results are provided to verify our theoretical findings and demonstrate the effectiveness of our proposed designs. [ABSTRACT FROM AUTHOR]

This paper investigates unmanned aerial vehicle (UAV) enabled secure communication systems where a mobile UAV wishes to send confidential messages to multiple ground users. To improve the security performance, a cooperative UAV is additionally considered that transmits the jamming signal. In this system, we maximize the minimum secrecy rate among the ground users by jointly optimizing the trajectory and the transmit power of the UAVs as well as the user scheduling. To efficiently solve this nonconvex problem, we adopt block successive upper bound minimization techniques, which address a sequence of approximated convex problems for each block of variables. Numerical results verify that the proposed algorithm outperforms baseline methods. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem, which maximizes the average worst case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The nonconvexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, $\mathcal {S}$ -procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst case secrecy rate significantly, as compared to two other benchmark algorithms without robust design. [ABSTRACT FROM AUTHOR]

In future mobile networks, it is difficult for static base stations (BSs) to support the rapidly increasing data services, especially for cell-edge users. Unmanned aerial vehicle (UAV) is a promising method that can assist BSs to offload the data traffic, due to its high mobility and flexibility. In this correspondence, we focus on the UAV trajectory at the edges of three adjacent cells to offload traffic for BSs. In the proposed scheme, the sum rate of UAV-served edge users is maximized subject to the rate requirements for all the users, by optimizing the UAV trajectory in each flying cycle. The optimization is a mixed-integer nonconvex problem, which is difficult to solve. Thus, it is transformed into two convex problems, and an iterative algorithm is proposed to solve it by optimizing the UAV trajectory and edge user scheduling alternately. Simulation results are presented to show the effectiveness of the proposed scheme. [ABSTRACT FROM AUTHOR]

Fixed-wing unmanned aerial vehicles (UAVs) can be an essential tool for low-cost aerial surveillance and mapping applications in remote regions. There is, however, a key limitation, which is the fact that low-cost UAVs have limited fuel capacity and, hence, require periodic refueling to accomplish a mission. Moreover, the usual mechanism of commanding the UAV to return to a stationary base station for refueling can result in the fuel wastage and inefficient mission operation time. Alternatively, one strategy could be the use of an unmanned ground vehicle (UGV) as a mobile refueling unit, where the UAV will rendezvous with the UGV for refueling. In order to accurately perform this task in the presence of wind disturbances, we need to determine an optimal trajectory in three-dimensional taking UAV and UGV dynamics and kinematics into account. In this paper, we propose an optimal control formulation to generate a tunable UAV trajectory for rendezvous on a moving UGV that also addresses the possibility of the presence of wind disturbances. By a suitable choice of the value of an aggressiveness index that we introduce in our problem setting, we are able to control the UAV rendezvous behavior. Several numerical results are presented to illustrate the reliability and effectiveness of our approach. [ABSTRACT FROM AUTHOR]

The attitude control of quadrotor unmanned aerial vehicle (UAV) is investigated. The aim of this paper is to develop a continuous multivariable attitude control law, which drives the attitude tracking errors of quadrotor UAV to zero in finite time. First, a multivariable super-twisting-like algorithm (STLA) is proposed for arbitrary order integrator systems subject to matched disturbances. A discontinuous integral term is incorporated in the control law in order to compensate the disturbances. A rigorous proof of the finite time stability of the close-loop system is derived by utilizing the Lyapunov method and the homogeneous technique. Then, the implementation of the developed method in an indoor quadrotor UAV is performed. The remarkable features of the developed algorithm includes the finite time convergence, the chattering suppression and the nominal performance recovery. Finally, the efficiency of the proposed method is illustrated by numerical simulations and experimental verification. [ABSTRACT FROM PUBLISHER]

This paper presents a novel algorithm identifying optimal flight trajectories for Unmanned Aerial Vehicles compliant with environmental constraints. Such constraints are defined in terms of obstacles, fixed way-points and selected destination points. Optimality is evaluated taking the minimum path length as the specific objective function. The proposed path planning strategy is based on an original trajectory modelling coupled with a Particle Swarm optimizer (PSO). Flight paths starting from a specified point and ending at a selected destination point are divided into a finite number of segments made up of circular arcs and straight lines. In the proposed approach such a geometrical sequence is replaced with a finite sequence of binary-coded basic manoeuvres. This novel formulation allows to easily handle the manoeuvres sequence with a fixed number of integer variables taking advantage of PSO capability in handling discrete variables; moreover the use of mixed-type variables provides the optimization procedure a useful flexibility in the “decision making” modelling and operational scenarios definition as well. Specific geometric-based linear obstacle avoidance models have been implemented in addition to suitable penalty functions. The use of these models forces each path to be consistent with the environmental constraints favouring the identification of feasible trajectories with a reduced number of iterations and particles. The path planning model has been developed with particular care devoted to reduce computational effort as well as to improve algorithm capability in handling general-shaped obstacles both in 2-D and 3-D environments. Various applications have been performed in order to test the effectiveness of the proposed flight path generator. Applicability of the proposed optimization model also to vehicles with VTOL and hovering capabilities has been preliminarily assessed. [ABSTRACT FROM AUTHOR]

In recent years, the use of modern technology in military operations has become standard practice. Unmanned systems play an important role in operations such as reconnaissance and surveillance. This article examines a model for planning aerial reconnaissance using a fleet of mutually cooperating unmanned aerial vehicles to increase the effectiveness of the task. The model deploys a number of waypoints such that, when every waypoint is visited by any vehicle in the fleet, the area of interest is fully explored. The deployment of waypoints must meet the conditions arising from the technical parameters of the sensory systems used and tactical requirements of the task at hand. This paper proposes an improvement of the model by optimizing the number and position of waypoints deployed in the area of interest, the effect of which is to improve the trajectories of individual unmanned systems, and thus increase the efficiency of the operation. To achieve this optimization, a modified simulated annealing algorithm is proposed. The improvement of the model is verified by several experiments. Two sets of benchmark problems were designed: (a) benchmark problems for verifying the proposed algorithm for optimizing waypoints, and (b) benchmark problems based on typical reconnaissance scenarios in the real environment to prove the increased effectiveness of the reconnaissance operation. Moreover, an experiment in the SteelBeast simulation system was also conducted.

In this paper, we consider a novel mobile relaying technique, where the relay nodes are mounted on unmanned aerial vehicles (UAVs) and hence are capable of moving at high speed. Compared with conventional static relaying, mobile relaying offers a new degree of freedom for performance enhancement via careful relay trajectory design. We study the throughput maximization problem in mobile relaying systems by optimizing the source/relay transmit power along with the relay trajectory, subject to practical mobility constraints (on the UAV’s speed and initial/final relay locations), as well as the information-causality constraint at the relay. It is shown that for the fixed relay trajectory, the throughput-optimal source/relay power allocations over time follow a “staircase” water filling structure, with non-increasing and non-decreasing water levels at the source and relay, respectively. On the other hand, with given power allocations, the throughput can be further improved by optimizing the UAV’s trajectory via successive convex optimization. An iterative algorithm is thus proposed to optimize the power allocations and relay trajectory alternately. Furthermore, for the special case with free initial and final relay locations, the jointly optimal power allocation and relay trajectory are derived. Numerical results show that by optimizing the trajectory of the relay and power allocations adaptive to its induced channel variation, mobile relaying is able to achieve significant throughput gains over the conventional static relaying. [ABSTRACT FROM AUTHOR]

This paper presents Multi-Step A^\ast (MSA ^\ast), a search algorithm based on A ^\ast for multi-objective 4-D vehicle motion planning (three spatial and one time dimensions). The research is principally motivated by the need for offline and online motion planning for autonomous unmanned aerial vehicles (UAVs). For UAVs operating in large dynamic uncertain 4-D environments, the motion plan consists of a sequence of connected linear tracks (or trajectory segments). The track angle and velocity are important parameters that are often restricted by assumptions and a grid geometry in conventional motion planners. Many existing planners also fail to incorporate multiple decision criteria and constraints such as wind, fuel, dynamic obstacles, and the rules of the air. It is shown that MSA ^\ast finds a cost optimal solution using variable length, angle, and velocity trajectory segments. These segments are approximated with a grid-based cell sequence that provides an inherent tolerance to uncertainty. The computational efficiency is achieved by using variable successor operators to create a multiresolution memory-efficient lattice sampling structure. The simulation studies on the UAV flight planning problem show that MSA^\ast meets the time constraints of online replanning and finds paths of equivalent cost but in a quarter of the time (on average) of a vector neighborhood-based A^\ast. [ABSTRACT FROM AUTHOR]

A network composed of unmanned aerial vehicles (UAVs), serving as base stations (UAV-BS network), is emerging as a promising component in next-generation communication systems. In the UAV-BS network, the optimal positioning of a UAV-BS is an essential requirement to establish line-of-sight (LoS) links for ground users. A novel deep Q-network (DQN)-based learning model enabling the optimal deployment of a UAV-BS is proposed. Moreover, without re-learning of the model and the acquisition of the path information of ground users, the proposed model presents the optimal UAV-BS trajectory while ground users move. Specifically, the proposed model optimizes the trajectory of a UAV-BS by maximizing the mean opinion score (MOS) for ground users who move to various paths. Furthermore, the proposed model is highly practical because, instead of the locations of individual mobile users, an average channel power gain is used as an input parameter. The accuracy of the proposed model is validated by comparing the results of the model with those of a mathematical optimization solver. [ABSTRACT FROM AUTHOR]

The ability of an autonomous Unmanned Aerial Vehicle (UAV) in an unknown environment is a prerequisite for its execution of complex tasks and is the main research direction in related fields. The autonomous navigation of UAVs in unknown environments requires solving the problem of autonomous exploration of the surrounding environment and path planning, which determines whether the drones can complete mission-based flights safely and efficiently. Existing UAV autonomous flight systems hardly perform well in terms of efficient exploration and flight trajectory quality. This paper establishes an integrated solution for autonomous exploration and path planning. In terms of autonomous exploration, frontier-based and sampling-based exploration strategies are integrated to achieve fast and effective exploration performance. In the study of path planning in complex environments, an advanced Rapidly Exploring Random Tree (RRT) algorithm combining the adaptive weights and dynamic step size is proposed, which effectively solves the problem of balancing flight time and trajectory quality. Then, this paper uses the Hermite difference polynomial to optimization the trajectory generated by the RRT algorithm. We named proposed UAV autonomous flight system as Frontier and Sampling-based Exploration and Advanced RRT Planner system (FSEPlanner). Simulation performs in both apartment and maze environment, and results show that the proposed FSEPlanner algorithm achieves greatly improved time consumption and path distances, and the smoothed path is more in line with the actual flight needs of a UAV. [ABSTRACT FROM AUTHOR]

We address the problem of optimal trajectory planning for a fixed wing- or quadrotor aircraft to satisfy linear temporal logic (LTL) specifications on its motion. To this end, we propose a randomized sampling-based motion planning algorithm with probabilistic guarantees of completeness and optimality. Similar to the well-known rapidly-exploring random tree (RRT⁎) algorithm, the proposed algorithm incrementally generates a tree in which edges are associated with vehicle control inputs. Random samples are taken from multiple copies of the state space, where each copy is uniquely associated with a state of the Büchi automaton that accepts the given LTL specification. To achieve significant reductions in computation time, we propose a sampling heuristic that provides a bias for growing the tree structure. This sampling heuristic preserves the completeness and optimality properties of the RRT⁎ algorithm. We provide numerical simulation results of the application of the proposed algorithm to show up to approximately 80% reductions in computation time achieved due to this sampling heuristic. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses articles in the issue on topics including recent advances in aerial swarm robotics, trajectory optimization for aerial robots or unmanned aerial vehicles (UAVs) and a distributed formation control algorithm for a group of aerial robots.

The unmanned aerial vehicle (UAV) enabled mobile edge computing (MEC) system is attracting a lot of attentions for the potential of low latency and low transmission energy consumption, due to the advantages of high mobility and easy deployment. It has been widely applied to provide communication and computing services, especially in Internet of Things (IoT). However, there are still some challenges in the UAV-enabled MEC system. Firstly, the endurance of the UAV is limited and further impacts the performance of the system. Secondly, mobile devices are battery-powered and the batteries of some devices are hard to change. Therefore, in this paper, a UAV-enabled MEC system in which the UAV is empowered to have computing capability and provides tasks offloading service is studied. The total energy consumption of the UAV-enabled system, which includes the energy consumption of the UAV and the energy consumption of the ground users, is minimized under the constraints of the UAV's energy budget, the number of each task's bits, the causality of the data and the velocity of the UAV. The bits allocation of uploading data, computing data, downloading data and the trajectory of the UAV are jointly optimized with the goal of minimizing the total energy consumption. Moreover, a two-stage alternating algorithm is proposed to solve the non-convex formulated problem. Finally, the simulation results show the superiority of the proposed scheme compared with other benchmark schemes. Finally, the performance of the proposed scheme is demonstrated under different settings. [ABSTRACT FROM AUTHOR]

In recent years, the use of modern technology in military operations has become standard practice. Unmanned systems play an important role in operations such as reconnaissance and surveillance. This article examines a model for planning aerial reconnaissance using a fleet of mutually cooperating unmanned aerial vehicles to increase the effectiveness of the task. The model deploys a number of waypoints such that, when every waypoint is visited by any vehicle in the fleet, the area of interest is fully explored. The deployment of waypoints must meet the conditions arising from the technical parameters of the sensory systems used and tactical requirements of the task at hand. This paper proposes an improvement of the model by optimizing the number and position of waypoints deployed in the area of interest, the effect of which is to improve the trajectories of individual unmanned systems, and thus increase the efficiency of the operation. To achieve this optimization, a modified simulated annealing algorithm is proposed. The improvement of the model is verified by several experiments. Two sets of benchmark problems were designed: (a) benchmark problems for verifying the proposed algorithm for optimizing waypoints, and (b) benchmark problems based on typical reconnaissance scenarios in the real environment to prove the increased effectiveness of the reconnaissance operation. Moreover, an experiment in the SteelBeast simulation system was also conducted. [ABSTRACT FROM AUTHOR]