Research on path planning of vehicle dynamic obstacle avoidance based on improved RRT algorithm

被引：0

作者：

Ma, Jinhong ^{[1
]}

Luo, Jie ^{[1
]}

Li, Hao ^{[1
]}

Hu, Jinmin ^{[1
]}

机构：

[1] Wuhan Univ Technol, Wuhan, Hubei, Peoples R China

来源：

SIXTH INTERNATIONAL CONFERENCE ON ELECTROMECHANICAL CONTROL TECHNOLOGY AND TRANSPORTATION (ICECTT 2021) | 2022年 / 12081卷

关键词：

Artificial Potential Field; Rapidly Random-exploring Trees; Vehicles; Path planning; Dynamic obstacle avoidance;

D O I：

10.1117/12.2624006

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In view of the situation that the traditional path planning algorithms have the disadvantages of local optimal solution or the generated path is not smooth, on the one hand, this paper combines Artificial Potential Field with Rapidly Random-exploring Trees to improve the efficiency of path planning and solve the problem of local optimal solution; on the other hand, in order to ensure that the algorithm can be used in vehicle obstacle avoidance, the calculation formula of safe distance to obstacles is modified to make the obstacle avoidance process conform to vehicle driving behavior. At the meanwhile, in the exploring rules of RRT algorithm, vehicle dynamics constraints are added to make the path smooth and meet the maximum steering limit. In addition, driving distance information is added to each node of the path to deal with dynamic obstacles. Finally, the simulation results show that the path planned by this method can guide the vehicle to avoid dynamic obstacles smoothly.

引用

页数：9

共 17 条

[11]

Tavares P, 2016, DOUBLE A PATH PLANNI

[12]

Vadakkepat P, 2000, IEEE C EVOL COMPUTAT, P256, DOI 10.1109/CEC.2000.870304

[13]

Wang LC, 2002, PROCEEDINGS OF THE 2002 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL, P821, DOI 10.1109/ISIC.2002.1157868

[14]

Wang X., 2015, 2015 34 CHINESE CONT

[15]

Wolf M T, 2018, IEEE INT C ROBOTICS

[16]

Yang YD, 2004, IEEE INT CONF ROBOT, P4405

[17]

Zhenhua W, 2009, 2009 IEEE INT C AUTO

← 1 2 →