TY - JOUR
T1 - PRRT
T2 - 2022 4th International Symposium on Robotics and Intelligent Manufacturing Technology, ISRIMT 2022
AU - Chen, Qinhu
AU - Kang, Meilin
AU - Fan, Zeming
AU - Yu, Xiaojun
N1 - Publisher Copyright:
© Published under licence by IOP Publishing Ltd.
PY - 2022
Y1 - 2022
N2 - This paper proposes a practically executable path planning method, namely, Pheromones-RRT(PRRT), for robots with a large joint range in a complex environment. To inter-activate with the real world, the point cloud is utilized as the scene information, while for sampling, the pheromones approach is designed to describe the pheromone content carried by each sampling point. During the sampling process, random sampling nodes are performed with a probability of ϵ, or those nodes with the highest pheromone content in the current sampling tree are selected with a probability of 1-ϵ and sampled in their neighborhood. To avoid the local minimum problem, the concept of pheromone volatile factor (PVF) is proposed, while in the expansion, double trees are also generated by PRRT in both cartesian and configuration spaces to improve the speed of the algorithm. The pheromone accumulation enables PRRT to certain learning abilities, reducing the randomness of the sampling process. Simulation results show that the proposed method can effectively plan an optimal obstacle avoidance path with satisfactory performances as compared with the RRT-Connect.
AB - This paper proposes a practically executable path planning method, namely, Pheromones-RRT(PRRT), for robots with a large joint range in a complex environment. To inter-activate with the real world, the point cloud is utilized as the scene information, while for sampling, the pheromones approach is designed to describe the pheromone content carried by each sampling point. During the sampling process, random sampling nodes are performed with a probability of ϵ, or those nodes with the highest pheromone content in the current sampling tree are selected with a probability of 1-ϵ and sampled in their neighborhood. To avoid the local minimum problem, the concept of pheromone volatile factor (PVF) is proposed, while in the expansion, double trees are also generated by PRRT in both cartesian and configuration spaces to improve the speed of the algorithm. The pheromone accumulation enables PRRT to certain learning abilities, reducing the randomness of the sampling process. Simulation results show that the proposed method can effectively plan an optimal obstacle avoidance path with satisfactory performances as compared with the RRT-Connect.
UR - http://www.scopus.com/inward/record.url?scp=85145615634&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/2402/1/012025
DO - 10.1088/1742-6596/2402/1/012025
M3 - 会议文章
AN - SCOPUS:85145615634
SN - 1742-6588
VL - 2402
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 1
M1 - 012025
Y2 - 23 September 2022 through 25 September 2022
ER -