A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm

Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and A* search algorithm. We extract the key points from the initial route obtained by the A* search algorithm and then introduce the Bezier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.

Automated summary

This paper proposes a shortest path planning method based on AIS data, which combines ACA and A* search algorithm to establish a high-precision environment model. The key points are extracted from the initial route obtained by the A* search algorithm, and the Bezier curve method is introduced to smooth the route to obtain the planned route. The experimental results validate the effectiveness of the proposed method in obtaining shorter paths faster and more efficiently.