• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Zhang, Wei-Bo (Zhang, Wei-Bo.) [1] (Scholars:张卫波) | Xiao, Ji-Liang (Xiao, Ji-Liang.) [2]

Indexed by:

EI PKU

Abstract:

When a rapidly-exploring random tree (RRT) algorithm is used for path planning in a complicated environment with many random barriers, the convergence is slow and the obtained path is usually twisted. To meet the requirements of path planning of an intelligent vehicle in a complicated environment, a motion planning algorithm, named homocentric circles RRT algorithm, based on a fast searching random tree is proposed. Based on basic RRT and combined with the kinematic constraints of the intelligent vehicle, the homocentric circles sampling strategy and adjacent point selection method were introduced in the proposed algorithm. The homocentric circles sampling considers the target point as the center; the homocentric circles coefficient m was used to adjust the density of the homocentric circles to generate random points to determine the next path point. Considering the vehicle kinematic constraints and target distance factor, the adjacent point selection method was adopted to calculate the proximity coefficient, and the random tree node corresponding to the minimum proximity coefficient was taken as the adjacent point. For the planned path, a path processing method based on vehicle kinematic constraints was used to simplify the obtained path, and the cubic B-spline curve was employed to optimize the path to generate a smooth and executable path. The results show that the algorithm takes the least time to find the path when the coefficient of homocentric circles is in the range of 0.5-1.5. A larger constraint value for the angle of vehicle attitude and next path point implies that less time is used to find the path and it tends to be stable when the angle is 35°. Under the same environment, the quality of the planned path obtained using the proposed RRT improves considerably compared with the basic RRT, target bias RRT, and updated RRT. Compared with the RRT, target bias RRT, and updated RRT algorithms, the required time and length of the planned path of the proposed RRT algorithm are lower by 43.1% and 18.7%, 7.3% and 15.5%, and 29.6% and 7% respectively. Finally, the effectiveness and practicability of the algorithm were verified through the intelligent vehicle experiment. © 2021, Editorial Department of China Journal of Highway and Transport. All right reserved.

Keyword:

Curve fitting Intelligent vehicle highway systems Kinematics Trees (mathematics) Vehicles

Community:

  • [ 1 ] [Zhang, Wei-Bo]School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou; 350116, China
  • [ 2 ] [Xiao, Ji-Liang]School of Mechanical Engineering and Automation, Fuzhou University, Fuzhou; 350116, China

Reprint 's Address:

Email:

Show more details

Related Keywords:

Related Article:

Source :

China Journal of Highway and Transport

ISSN: 1001-7372

CN: 61-1313/U

Year: 2021

Issue: 3

Volume: 34

Page: 225-234

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 6

Online/Total:97/10024955
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1