返回
Improved path planning algorithm for mobile robots
DOI:10.1007/s00500-023-08674-z.png)
摘要
En 中文
Path planning is an NP-hard problem in road network environments. Considering that the existing path planning algorithms mainly have the problems of low smoothness and low search efficiency in generating paths in large-scale complex environments, an improved rapidly exploring random tree (RRT) algorithm is proposed in this paper. First, the grid method is applied to model the road network environment, and the RRT algorithm based on adjacency expansion is proposed to search the initial path. Then, the strategies of identifying paths and eliminating redundant paths are adopted, respectively, to further optimize the selected paths. Experimental results show that, compared with other path planning algorithms, our algorithm can achieve faster convergence speed, shorter search path, and better smoothness in a complex map of the environment.
Keyword:
Path planning
Rapidly exploring random tree
Adjacent-relation extension
Repetitive sequence optimization
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
ELIMINATION OF C14-LABELED THYROXINE IN THE BILE, URINE AND EXPIRED AIR OF RATS IN ALTERED THYROID STATES1C14标记甲状腺素在胆汁、尿液和呼出气中的消除(大鼠在改变的甲状腺状态时)1
A Generalized Voronoi Diagram-Based Efficient Heuristic Path Planning Method for RRTs in Mobile Robots基于广义Voronoi图的移动机器人RRTs高效启发式路径规划方法
A review: On path planning strategies for navigation of mobile robot移动机器人导航路径规划策略研究综述
DEFENCE TECHNOLOGY
IF5.9
A novel hybrid algorithm based on PSO and FOA for target searching in unknown environments
APPLIED INTELLIGENCE
IF3.5

