运动规划
随机树
路径(计算)
计算机科学
数学优化
任意角度路径规划
采样(信号处理)
计算
规划师
A*搜索算法
算法
数学
机器人
人工智能
计算机视觉
程序设计语言
滤波器(信号处理)
作者
Hongju Tang,Qi Zhu,Erke Shang,Bin Dai,Chaofang Hu
标识
DOI:10.23919/ccc50068.2020.9189309
摘要
This paper proposes a novel local path planning algorithm for Unmanned Ground Vehicles (UGVs). Rapidly-exploring Random Tree Star (RRT*) has recently gained immense popularity in the path planning as it provides a probabilistically complete and asymptotically optimal solution. But the uniform random sampling strategy of the traditional RRT* results in blind searching and massive computation. Our algorithm introduces a reference path guided non-uniform sampling approach to improve the planning performance. When the reference path is available, the RRT* based planner samples along the reference path. When there are obstacles on the reference path, guide points are generated to guide the sampling. Simulation results show that the algorithm can reduce the blindness of search, decrease the number of extended nodes, and generate smoother paths.
科研通智能强力驱动
Strongly Powered by AbleSci AI