Journal Article

A Hybrid Multi-Target Path Planning Algorithm for Unmanned Cruise Ship in an Unknown Obstacle Environment

Yang, Meng, Xu, Jiping, Yu, Jiabin, Bai, Yuting, Zhao, Zhiyao, Liu, Guandong, Chen, Zhihao, Wang, Xiaoyi

2022

Overview

To solve the problem of traversal multi-target path planning for an unmanned cruise ship in an unknown obstacle environment of lakes, this study proposed a hybrid multi-target path planning algorithm. The proposed algorithm can be divided into two parts. First, the multi-target path planning problem was transformed into a traveling salesman problem, and an improved Grey Wolf Optimization (GWO) algorithm was used to calculate the multi-target cruise sequence. The improved GWO algorithm optimized the convergence factor by introducing the Beta function, which can improve the convergence speed of the traditional GWO algorithm. Second, based on the planned target sequence, an improved D* Lite algorithm was used to implement the path planning between every two target points in an unknown obstacle environment. The heuristic function in the D* Lite algorithm was improved to reduce the number of expanded nodes, so the search speed was improved, and the planning path was smoothed. The proposed algorithm was verified by experiments and compared with the other four algorithms in both ordinary and complex environments. The experimental results demonstrated the strong applicability and high effectiveness of the proposed method.

• Publisher: MDPI AG,MDPI
• Subject: Accuracy / Algorithms / Computer Simulation / Cruise ships / Efficiency / improved D Lite algorithm / improved grey wolf optimization algorithm / Lakes / Management science / Methods / Mutation / Optimization / Planning / Ships / Travel / Traveling salesman problem / unknown obstacle environment / Unmanned aerial vehicles / unmanned cruise ship multi-target path planning