返回
Robot path planning optimization method based on heuristic multi-directional rapidly-exploring tree
DOI:10.1016/j.compeleceng.2020.106688.png)
摘要
En 中文
Aiming at the problems of low exploration efficiency and high optimal solution cost for existing robot path planning methods, a robot path planning optimization method based on heuristic multi-directional rapidly-exploring tree is implemented. In high-dimensional configuration space, drawing on the Rapid-exploration Random Tree (RRT) related algorithm idea, directional sampling control module works under the guidance of the robot goal course as a heuristic exploration. A flexible multi-directional rapidly-exploring tree construction method is used due to a degree of directional instability. In accordance with the principle of the centripetal growth of the tree, new multi-directional trees will be built on demand to arrive at specific coverage of the space. Then based on the previous path exploration vertices, through the merging method of the trees, a closed loop path is formed and optimized to finally generate a relative optimal path. Simulation experiment results show that this method could effectively im prove the exploring efficiency with low computational cost. (c) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Path planning
RRT-related
Heuristic exploration
Multi-directional rapidly-exploring tree
Optimal path
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间?
A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time基于模式遗传算法的多机器人覆盖路径规划最小化完成时间
Faster RRT-based Nonholonomic Path Planning in 2D Building Environments Using Skeleton-constrained Path Biasing使用骨架约束路径偏置在2D建筑环境中更快的基于RRT的非完整路径规划

