http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Stack-RRT*: A Random Tree Expansion Algorithm for Smooth Path Planning
Bin Liao,Yi Hua,Fangyi Wan,Shenrui Zhu,Yipeng Zong,Xinlin Qing 제어·로봇·시스템학회 2023 International Journal of Control, Automation, and Vol.21 No.3
Most RRT-based extension algorithms can generate safe and smooth paths by combining parameter curve-based smoothing schemes. For example, the Spline-based Rapidly-exploring Random Tree (SRRT) guarantees that the generated paths are G2-continuous by considering a Bezier curve-based smoothing scheme. In this paper, we propose Stack-RRT*, a random tree expansion method that can be combined with different parameter curve-based smoothing schemes to produce feasible paths with different continuities for non-holonomic robots. Stack-RRT* expands the search for possible parent vertices by considering not only the set of vertices contained in the tree, as in the RRT-based algorithm, but also some newly created nodes close to obstacles, resulting in a shorter initial path than other RRT-based algorithms. In addition, the Stack-RRT* algorithm can achieve convergence by locally optimizing the connection relation of random tree vertices after each expansion. Rigorous simulations and analysis demonstrate that this new approach outperforms several existing extension schemes, especially in terms of the length of the planned paths.