Research and Improvement of Path Planning Algorithms for Different Types of Destinations

Considering the needs of various groups of people such as tourists and crew on the cruise ship, this paper establishes a vectorized map data model which is suitable for navigation for the large and complex space of the cruise ship. For different types of destinations, this paper researches and improves the applicable path planning algorithms. For a single designated destination, the Dijkstra Algorithm is used for path planning, and the path relaxation rules are improved for the case of no destination and the path is fixed in length, and the path with the minimum distance error is obtained. For multiple designated destinations, this paper improves the Ant Colony Algorithm with considering the fact that the starting point is in the middle of the road section and the road section can be passed repeatedly. The probability rules for the ant colony to transfer between nodes are improved, and finally a better solution of the multi-destination path planning is obtained.