A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety.
A Heuristic Elastic Particle Swarm Optimization Algorithm for Robot Path Planning
