TY - JOUR
T1 - Smooth path planning under maximum curvature constraints for autonomous underwater vehicles based on rapidly-exploring random tree star with B-spline curves
AU - Feng, Haobo
AU - Hu, Qiao
AU - Zhao, Zhenyi
AU - Feng, Xinglong
N1 - Publisher Copyright:
© 2024 Elsevier Ltd
PY - 2024/7
Y1 - 2024/7
N2 - In recent decades, Rapidly-exploring Random Tree star (RRT*) has garnered significant attention in the field of path planning due to its asymptotical optimality feature. However, the paths obtained by RRT* are comprised of polylines and too tortuous to be followed by underwater robots. To solve the drawback, this paper proposes a novel autonomous underwater vehicle (AUV) path planning method based on B-spline RRT* (BSRRT*). It focuses on planning optimal paths under maximum curvature constraints, which considerably improves the path smoothness. Different from conventional RRT*-based methods, the tree generated by BSRRT* is composed of piecewise B-spline curves that meet the curvature constraint. The analytical formulas of curve curvature and curve length enable BSRRT* to extend the tree with a low computational cost. Furthermore, start and end orientations constraints are imposed via the introduction of start node pairs and end node pairs. BSRRT* also combines with the expanded candidate strategy and the goal-biased strategy for a faster convergence rate. Simulation results demonstrate that compared to existing approaches, BSRRT* can provide shorter smooth paths with lower time costs.
AB - In recent decades, Rapidly-exploring Random Tree star (RRT*) has garnered significant attention in the field of path planning due to its asymptotical optimality feature. However, the paths obtained by RRT* are comprised of polylines and too tortuous to be followed by underwater robots. To solve the drawback, this paper proposes a novel autonomous underwater vehicle (AUV) path planning method based on B-spline RRT* (BSRRT*). It focuses on planning optimal paths under maximum curvature constraints, which considerably improves the path smoothness. Different from conventional RRT*-based methods, the tree generated by BSRRT* is composed of piecewise B-spline curves that meet the curvature constraint. The analytical formulas of curve curvature and curve length enable BSRRT* to extend the tree with a low computational cost. Furthermore, start and end orientations constraints are imposed via the introduction of start node pairs and end node pairs. BSRRT* also combines with the expanded candidate strategy and the goal-biased strategy for a faster convergence rate. Simulation results demonstrate that compared to existing approaches, BSRRT* can provide shorter smooth paths with lower time costs.
KW - B-spline curve
KW - Expanded candidate strategy
KW - Goal-biased strategy
KW - Orientation node pair strategy
KW - Path planning
KW - Rapidly-exploring random tree
UR - https://www.scopus.com/pages/publications/85194048545
U2 - 10.1016/j.engappai.2024.108583
DO - 10.1016/j.engappai.2024.108583
M3 - 文章
AN - SCOPUS:85194048545
SN - 0952-1976
VL - 133
JO - Engineering Applications of Artificial Intelligence
JF - Engineering Applications of Artificial Intelligence
M1 - 108583
ER -