Motion planning of unicycle-like robot using single RRT with branch and bound algorithm
Rui-Jun Yan, Jing Bing Wu, Jiyeong Lee · 2013
This paper presents the motion planning of unicycle-like robot using single Rapidly-exploring Random Tree (RRT) algorithm, combining with Branch and Bound (BB) method. RRT can construct the searching tree efficiently between initial configuration and goal configuration. Based on the constructed searching tree, the optimal path can be extracted with BB algorithm rapidly. Obstacles avoidance is realized by checking whether the contour points of robot locate in the space of obstacles. The simulation result in a complex environment with unicycle-like robot proves the validity of proposed algorithms.