计算机科学
路径(计算)
树(集合论)
运动规划
实时计算
分布式计算
人工智能
计算机网络
机器人
数学
数学分析
作者
Bo Cui,Rongxin Cui,Weisheng Yan,Y. Wang,Zhang Shi
出处
期刊:
日期:2024-10-14
卷期号:: 5380-5387
被引量:4
标识
DOI:10.1109/iros58592.2024.10802722
摘要
Path planning in unpredictable dynamic environments remains a challenging problem due to the unpredictable appearance, disappearance, and movement of dynamic obstacles during navigation. To address this problem, we propose a reverse tree guided rapid exploration random tree (RTRRT) algorithm that can efficiently perform navigation tasks in dynamic environments. The method first constructs a reverse tree rooted as goal state to search for an initial path. If a collision occurs on the path, The RT-RRT constructs a forward tree rooted as the current robot state in the same configuration space, until it connects with the reverse tree to find a new path. Furthermore, The RT-RRT improves the tree construction method and designs a path optimization strategy to reduce the path cost. The method is validated in different scenarios and has excellent navigation capabilities in unpredictable dynamic environments. In the same scenarios, the RT-RRT algorithm improves the success rate by 16.7%, reduces the path length by 20.54% and reduces the travel time by 10X compared to the RRTX algorithm with the same number of samples.
科研通智能强力驱动
Strongly Powered by AbleSci AI