Systems Engineering and Electronics ›› 2024, Vol. 46 ›› Issue (4): 1364-1371.doi: 10.12305/j.issn.1001-506X.2024.04.25

• Guidance, Navigation and Control • Previous Articles     Next Articles

Improved bi-directional rapidly-exploring random tree path planning for USV

Guixiang ZHAO1, Jian ZHOU2, Yunmiao LI1, Chenxu WANG1,*   

  1. 1. School of Marine Science and Technology, Tianjin University, Tianjin 300110, China
    2. Jiangsu Autonation Research Institute, Beijing 100036, China
  • Received:2023-03-13 Online:2024-03-25 Published:2024-03-25
  • Contact: Chenxu WANG

Abstract:

Aiming at the problems of bi-directional rapidly-exploring random tree (BI-RRT) algorithm in global path planning, such as low search efficiency and many turning points, an improved BI-RRT algorithm for global path planning of unmanned surface vehicle (USV) is proposed. The proposed algorithm adopts the idea of extreme greed, a Gaussian biased random point sampling method and a heuristic node expansion strategy. The node expansion and search tree connection are also angularly constrained, and the generated paths are cut and optimized with three B-samples. The results show that the improved BI-RRT reduces the average time, random sampling points, and average path by 40.5%, 65.0%, and 24.0%, respectively, compared to the previous BI-RRT. The improved algorithm has a significant reduction in time consumption, sampling points and search tree expansion, with improved path smoothing and shorter paths.

Key words: path planning, unmanned surface vehicles (USV), bi-directional rapidly-exploring random tree (BI-RRT), Gaussian biased random points, angular constraints

CLC Number: 

[an error occurred while processing this directive]