Research on AUV Allocation Method Based on Optimization Algorithm

With the development of science and technology, the performance of autonomous underwater vehicles (AUV) has been continuously improved, and its application has become increasingly widespread, playing an important role in the military and civilian fields. AUV can perform underwater environmental reconnaissance, resource exploration, target search, and intelligence collection. In order to efficiently complete reconnaissance and search tasks, AUV resources need to be allocated scientifically and reasonably. Due to the complex underwater environment, the robustness in the search process should be considered for many influencing factors. Considering Using multiple AUVs to search multiple target areas, In this paper, an improved genetic algorithm is used for task allocation, and then the simulated annealing algorithm is used to plan the shortest path with reference to the multiple traveling salesman problem. The two algorithms are improved to improve the convergence speed, and finally use Matlab to simulate Verify the effectiveness of the improved algorithm.