运动规划
路径(计算)
采样(信号处理)
计算机科学
趋同(经济学)
机器人
点(几何)
样品(材料)
领域(数学)
数学优化
人工智能
数学
计算机视觉
经济增长
滤波器(信号处理)
色谱法
经济
化学
程序设计语言
纯数学
几何学
作者
Benshan Ma,Chao Wei,Qing Huang,Jibin Hu
标识
DOI:10.1109/icmre56789.2023.10106516
摘要
Path planning is a decisive module of mobile robots and its time efficiency significantly affects the safety of the robots. Sampling-based methods have achieved great success in the robotic path planning domain. However, poor time efficiency is still a serious limitation when they are applied to a crowded environment. In this paper, we combine the RRT* algorithm and artificial potential field(APF) technic and propose an efficient sampling-based path planning method named APF-RRT*. Utilizing the prior knowledge of the mission and the environment, we construct APFs for the start point, the goal point, the reference path, and the obstacles. Then we modify the random sampling step of the RRT* algorithm. With the guidance of APF, the random sample points are closer to the optimal path, and useless sample points greatly decrease. Results show that the proposed APF-RRT* outperforms state-of-the-art sampling-based methods in convergence rate, sampling effectiveness, and time efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI