|Title:||Cellular-connected UAV trajectory optimization assisted by radio map|
|Advisors:||Zhang, Shuowen (EIE)|
Drone aircraft -- Control systems
Hong Kong Polytechnic University -- Dissertations
|Department:||Department of Electronic and Information Engineering|
|Abstract:||The applications of unmanned aerial vehicles (UAVs) have been constantly growing. To ensure the safety of UAVs, a promising approach is to connect UAVs with the cellular network, which is termed as cellular-enabled UAV communication. This dissertation aims to study various UAV trajectory design problems under connectivity constraints with the cellular network. Specifically, we make use of radio maps which characterize the large-scale channel gains between the UAVs and the ground base stations (GBSs). First, we consider the trajectory design of a single UAV and aim to minimize its flying distance between two points, under a connectivity constraint with the GBSs. The problem is reformulated as a shortest path problem (SPP) and solved via the Dijkstra algorithm. Next, we extend our study to a scenario with multiple UAVs each under connectivity constraints, where we aim to design their trajectories to minimize their mission completion time while avoiding collision. We modified the Dijkstra algorithm for the SPP problem by considering two mechanisms for collision avoidance, based on geometry and time-delay, respectively. Finally, we consider the scenario where the UAV needs to exchange data with the GBSs, where we study the UAV trajectory design to maximize the sum achievable rate during its mission, under connectivity constraints. We reformulate this problem as a longest path problem (LPP), and propose a solution using depth-first search (DFS). Simulation results using MATLAB are provided, which show that the above problems can be effectively solved with the assistance of radio map.|
|Rights:||All rights reserved|
Files in This Item:
|6513.pdf||For All Users (off-campus access for PolyU Staff & Students only)||6.53 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: