The invention relates to a UUV
route planning method with necessary points under the obstacle environment, belongs to the UUV control technology field and aims to realize the shortest path as UUV starts from a laying point, traverses all the necessary points and then returns to a
recovery point. According to the method, under the obstacle environment, estimated
route distances between the UUV laying point and the
recovery point and between every two of the necessary points are calculated; the laying point is taken as the start point, the
recovery point is taken as the
terminal point, the sequence of the UUV traversing all the necessary points is planned through a TSP
algorithm, the total estimated path of the UUV starting from the laying point, traversing all the necessary point and returning to the recovery point is made to be shortest; after optimization, the
route can be acquired on the condition that the total estimated path of the UUV starting from the laying point, traversing all the necessary point, returning to the recovery point and can further avoid all obstacles is shortest.
Path cost between two necessary points can be estimated through geometric determination, an
ant colony
algorithm is further utilized to plan a TSP scheme on the basis of the
estimation cost, namely the necessary point traversing sequence, a variable sub goal point
ant colony is further utilized to plane a route capable of realizing
obstacle avoidance.