A Hierarchical Planning Method for AUV Search Tasks Based on the Snake Optimization Algorithm.

In a complex and dynamic battlefield environment, enabling autonomous underwater vehicles (AUVs) to reach dynamic targets in the shortest possible time using global autonomous planning is a key issue affecting the completion of search tasks. In this study, ahierarchicalAUV task planning method that uses a combination of hierarchical programming and a snake optimization algorithm is proposed for two typical cases where the platform can provide initial target information. This method decomposes the search task problem into a three-level programming problem, with the outer task planning goal of achieving the shortest encounter time between AUV and dynamic targets; the goal of task planning in the middle layer is to achieve the shortest actual navigation time for AUVs under different operating conditions; and the internal task planning is responsible for considering the comprehensive trajectory optimization under navigation constraints such as threat zone, path length, and path smoothness.