Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMulti-UAV Cooperative Trajectory for Servicing Dynamic Demands and Charging Battery
226
0
0.0
(
0
)
Added by
Xiao Zhang
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Unmanned Aerial Vehicle (UAV) technology is a promising solution for providing high-quality mobile services to ground users, where a UAV with limited service coverage travels among multiple geographical user locations (e.g., hotspots) for servicing their demands locally. How to dynamically determine a UAV swarms cooperative path planning to best meet many users spatio-temporally distributed demands is an important question but is unaddressed in the literature. To our best knowledge, this paper is the first to design and analyze cooperative path planning algorithms of a large UAV swarm for optimally servicing many spatial locations, where ground users demands are released dynamically in the long time horizon. Regarding a single UAVs path planning design, we manage to substantially simplify the traditional dynamic program and propose an optimal algorithm of low computation complexity, which is only polynomial with respect to both the numbers of spatial locations and user demands. After coordinating a large number $K$ of UAVs, this simplified dynamic optimization problem becomes intractable and we alternatively present a fast iterative cooperation algorithm with provable approximation ratio $1-(1-frac{1}{K})^{K}$ in the worst case, which is proved to obviously outperform the traditional approach of partitioning UAVs to serve different location clusters separately. To relax UAVs battery capacity limit for sustainable service provisioning, we further allow UAVs to travel to charging stations in the mean time and thus jointly design UAVs path planning over users locations and charging stations. Despite of the problem difficulty, for the optimal solution, we successfully transform the problem to an integer linear program by creating novel directed acyclic graph of the UAV-state transition diagram, and propose an iterative algorithm with constant approximation ratio.
rate research
Read More
Designing clustered unmanned aerial vehicle (UAV) communication networks based on cognitive radio (CR) and reinforcement learning can significantly improve the intelligence level of clustered UAV communication networks and the robustness of the system in a time-varying environment. Among them, designing smarter systems for spectrum sensing and access is a key research issue in CR. Therefore, we focus on the dynamic cooperative spectrum sensing and channel access in clustered cognitive UAV (CUAV) communication networks. Due to the lack of prior statistical information on the primary user (PU) channel occupancy state, we propose to use multi-agent reinforcement learning (MARL) to model CUAV spectrum competition and cooperative decision-making problem in this dynamic scenario, and a return function based on the weighted compound of sensing-transmission cost and utility is introduced to characterize the real-time rewards of multi-agent game. On this basis, a time slot multi-round revisit exhaustive search algorithm based on virtual controller (VC-EXH), a Q-learning algorithm based on independent learner (IL-Q) and a deep Q-learning algorithm based on independent learner (IL-DQN) are respectively proposed. Further, the information exchange overhead, execution complexity and convergence of the three algorithms are briefly analyzed. Through the numerical simulation analysis, all three algorithms can converge quickly, significantly improve system performance and increase the utilization of idle spectrum resources.
The use of aerial anchors for localizing terrestrial nodes has recently been recognized as a cost-effective, swift and flexible solution for better localization accuracy, providing localization services when the GPS is jammed or satellite reception is not possible. In this paper, the localization of terrestrial nodes when using mobile unmanned aerial vehicles (UAVs) as aerial anchors is presented. We propose a novel framework to derive localization error in urban areas. In contrast to the existing works, our framework includes height-dependent UAV to ground channel characteristics and a highly detailed UAV energy consumption model. This enables us to explore different tradeoffs and optimize UAV trajectory for minimum localization error. In particular, we investigate the impact of UAV altitude, hovering time, number of waypoints and path length through formulating an energy-constrained optimization problem. Our results show that increasing the hovering time decreases the localization error considerably at the cost of a higher energy consumption. To keep the localization error below 100m, shorter hovering is only possible when the path altitude and radius are optimized. For a constant hovering time of 5 seconds, tuning both parameters to their optimal values brings the localization error from 150m down to 65m with a power saving around 25%
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.
The recent trend towards the high-speed transportation system has spurred the development of high-speed trains (HSTs). However, enabling HST users with seamless wireless connectivity using the roadside units (RSUs) is extremely challenging, mostly due to the lack of line of sight link. To address this issue, we propose a novel framework that uses intelligent reflecting surfaces (IRS)-enabled unmanned aerial vehicles (UAVs) to provide line of sight communication to HST users. First, we formulate the optimization problem where the objective is to maximize the minimum achievable rate of HSTs by jointly optimizing the trajectory of UAV and the phase-shift of IRS. Due to the non-convex nature of the formulated problem, it is decomposed into two subproblems: IRS phase-shift problem and UAV trajectory optimization problem. Next, a Binary Integer Linear Programming (BILP) and a Soft Actor-Critic (SAC) are constructed in order to solve our decomposed problems. Finally, comprehensive numerical results are provided in order to show the effectiveness of our proposed framework.
Due to the merit without requiring charging cable, wireless power transfer technologies have drawn rising attention as a new method to replenish energy to Wireless Rechargeable Sensor Networks (WRSNs). In this paper, we study mobile charger scheduling problem for multi-node recharging with deadline-series. Our target is to maximize the overall effective charging utility, and minimize the traveling time as well. Instead of charging only once over a scheduling cycle, we incorporate the multiple charging strategy for multi-node charging with deadline constraint, where charging spots and tour are jointly optimized. Specifically, we formulate the effective charging utility maximization problem as to maximize a monotone submodular function subject to a partition matroid constraint, and propose a simple but effective 1/2 -approximation greedy algorithm. After that, we present the grid-based skip-substitute operation further to save the traveling time, which can increase the charging utility. Finally, we conduct the evaluation for the performance of our scheduling scheme. Comparing to the Early Deadline First scheme, the simulation and field experiment results show that our algorithm outperform EDF by 37.5% and 37.9%, respectively.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
