 |
Traditional UAVs relies on simple point-to-point (P2P) wireless links to communicate with the ground base station (GBS), which may cause some problems such as low data rate transportation, system vulnerability, and so on. Previous research usually transforms the 3-Dimension traditional path planning into a Shortest Path Problem in graph theory and uses some algorithm such as A Star algorithm to solve an SPP. With the research on the cellular network, 4G and 5G have been proven useful and ultra-reliable in long-range communication, especially for UAVs. To enhance the data transportation performance between UAV and GBS, a novel technology called cellular-connected UAV has been developed. How to plan a path for UAV while maintaining a cellular network became a hot problem. In this case, we propose to abstract this problem into a Travel Salesman Problem, TSP defines a question of giving a list of cities and the distances between each pair of cities, which is the shortest possible route that a salesman can visit each city and returns to the origin city. In other words, it is to find the shortest path to traveling each point from a start point to an endpoint. The way to find the answer to TSP is to find all the possible paths first and choose the best path from the possible paths.
|
IEEE/ICACT20230128 Slide.03
[Big Slide]