A Brief Review of the Intelligent Algorithm for Traveling Salesman Problem in UAV Route Planning

In the future, unmanned aerial vehicles(UAVs) will be used in a wide range of applications in areas such as wireless communications, logistics, inspections, search and rescue. Path planning in these areas often involves Traveling Salesman Problem (TSP). It is extremely difficult to select the optimal path from a large number of nodes, but it is easy to solve the complex problem after converting it to TSP. The optimization methods for solving TSP include meta heuristic algorithm and fuzzy neural network. With the rapid growth of demand, there is an urgent need for faster and more accurate methods to make UAVs more intelligent. This article reviews the application of UAV route planning in the field of wireless communications and express delivery, and selects a variety of classic and up-to-date algorithms for solving TSP and its variants to promote future researches.