.png){kind=icon}
返回
Improved RRT-Connect Based Path Planning Algorithm for Mobile Robots
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3123622.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Path planning plays a key role in the application of mobile robots and it is an important way to achieve intelligent mobile robots. Traditional path planning algorithms need to model environmental obstacles in a deterministic space, which is complex and easily trapped in local minimal. The sampling-based path planning algorithm performs collision detection on the environment and it is able to quickly obtain a feasible path. In order to solve the problem of inefficient search of the sampling-based Rapidly Expanding Random Tree (RRT-Connect) path planning algorithm, an improved RRT-Connect mobile robot path planning algorithm (IRRT-Connect) is proposed in this paper. In order to continue to speed up the search of the algorithm, a simple and efficient third node is generated in the configuration space, allowing the algorithm to be greedily extended with a quadruple tree in the proposed algorithm. Further, the method of adding guidance is proposed to make the algorithm have the characteristics of biasing towards the target point when expanding, which improves the exploration efficiency of the algorithm. In order to verify the effectiveness of the proposed algorithm, this paper compares the execution performance of the four algorithms in six environments of different complexity. The results of the simulation experiments show that the proposed improved algorithm outperforms the RRT, RRT-Connect and RRT* algorithms in terms of the number of algorithm iterations, planning time and final path length in different environments. In addition, the improved algorithm was ported to the ROS mobile robot for experiments with real-world scenarios.
Keyword:
Path planning
Mobile robots
Planning
Heuristic algorithms
Costs
Search problems
Probabilistic logic
Mobile robots
path planning
RRT-connect
target bias
dichotomous method
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm基于改进遗传算法的连续环境多目标多机器人路径规划
PREAI
分享收藏A Method on Dynamic Path Planning for Robotic Manipulator Autonomous Obstacle Avoidance Based on an Improved RRT Algorithm.png)
SENSORS
OAAI
SENSORSIF3.5
OAAI分享收藏Hybrid Path Planning Algorithm Based on Membrane Pseudo-Bacterial Potential Field for Autonomous Mobile RobotsIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm基于混合PSO-MFB优化算法的自主移动机器人多目标路径规划OAAI
OAAI分享收藏An enhanced heuristic ant colony optimization for mobile robot path planningSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容