Key points are not available for this paper at this time.
In order to ensure the safety of seafarer and comprehensively improve the intelligence of maritime field, the topic of unmanned ship has become more and more popular in recent years, and the ability of collision avoidance path planning of unmanned ship is one of its key technologies, which is an important embodiment of its intelligence. In this paper, aiming at solving the path planning problem of unmanned ship in known environment map, using mathematical modeling software simulation, some algorithm fields of unmanned ship path planning are reproduced, and the running results of related algorithms are compared. Dijkstra algorithm belongs to the single source shortest path algorithm. The original Dijkstra classical algorithm is used to realize the path planning. The experimental results show that there are many unnecessary inflection points after using the Dijkstra algorithm. The pheromone idea of ant colony algorithm is added to the classic Dijkstra algorithm criterion. The experimental results show that the optimized algorithm can greatly reduce the redundant points in the process of path planning and reduce the moving cost of unmanned ship routing.
Zhu et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: