Shandong Science ›› 2021, Vol. 34 ›› Issue (3): 109-118.doi: 10.3976/j.issn.1002-4026.2021.03.015

• Other Research Article • Previous Articles     Next Articles

Path planning of robot based on improved BI-RRT algorithm

HAN Feng-jiana, QIU Shu-bob, LI Qing-huab*, LIU Hai-yinga   

  1. a. School of Electrical Engineering and Automation; b. School of Electronic and Information Engineering(Department of Physics),Qilu University of Technology (Shandong Academyof Sciences), Jinan 250353, China
  • Received:2020-11-09 Online:2021-06-20 Published:2021-06-07

Abstract: Aiming at the problems of BI-RRT algorithm in path planning, such as poor target orientation, slow convergence speed, and numerous inflection points, an improved BI-RRT algorithm is proposed in this paper. The random tree is guided to grow faster toward the target point through target orientation to accelerate the convergence speed. In addition, the introduction of greedy path optimization strategy effectively reduces the path inflection points and improves the efficiency of path planning algorithm. Furthermore, a disk collision detection algorithm is also proposed. Path planning simulation experiments on a disk mobile robot is performed in several scenarios using Matlab. The feasibility and effectiveness of the proposed algorithm are verified via experimental results.

Key words: path planning, BI-RRT algorithm, greedy algorithm, convergence speed

CLC Number: 

  • TN96