.png){kind=icon}
返回
Path Planning Method for Mobile Robot Based on a Hybrid Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10846-023-01985-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a hybrid algorithm to complete path planning and dynamic obstacle avoidance in complicated maps for mobile robot. The hybrid algorithm (A*-DWA-B) combines the advantages of A* algorithm and Dynamic Window Approach (DWA). Firstly, methods of environmental modeling and collision detection are set. The improvement of A* algorithm lies in the establishment of a new calculation method for the evaluation function. After adding the risky cost, the parent node information is introduced into the calculation of the estimated cost, and the influence of the robot starting and braking modes is added to the calculation of the actual cost. Secondly, after removing superfluous nodes, the path obtained by the improved A* algorithm is divided into several linear segment paths. Then the endpoints of each line segment path are taken as the start node and target node of DWA for path planning. Adaptive initial attitude is set and two dynamic obstacle avoidance strategies are added for DWA. After integrating the paths planned by DWA, the B-spline smoothing method is used to optimize the integrated path, and finally obtained a smooth path. Compared with other similar algorithms, the proposed algorithm has advantages in path cost and turning angle. Experimental results show that the hybrid algorithm not only has strong ability of safe and smooth path planning, but also can avoid dynamic obstacles in time and effectively.
Keyword:
Path Planning
A* Algorithm
Collision detection
Dynamic Window Approach
Dynamic obstacle avoidance strategy
B-spline
期刊
J
IF:
2.8
论文数:
3.9K
被引数:
6.9K
机构
引用论文
A Mobile Robot Path Planning Algorithm Based on Improved A* Algorithm and Dynamic Window Approach基于改进A * 算法和动态窗口的移动机器人路径规划算法.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容