RRT-GoalBias and Path Smoothing Based Motion Planning of Mobile Manipulators with Obstacle Avoidance

Author(s):  
Jun Shao ◽  
Hao Xiong ◽  
Jianfeng Liao ◽  
Wei Song ◽  
Zheng Chen ◽  
...  
Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2244
Author(s):  
S. M. Yang ◽  
Y. A. Lin

Safe path planning for obstacle avoidance in autonomous vehicles has been developed. Based on the Rapidly Exploring Random Trees (RRT) algorithm, an improved algorithm integrating path pruning, smoothing, and optimization with geometric collision detection is shown to improve planning efficiency. Path pruning, a prerequisite to path smoothing, is performed to remove the redundant points generated by the random trees for a new path, without colliding with the obstacles. Path smoothing is performed to modify the path so that it becomes continuously differentiable with curvature implementable by the vehicle. Optimization is performed to select a “near”-optimal path of the shortest distance among the feasible paths for motion efficiency. In the experimental verification, both a pure pursuit steering controller and a proportional–integral speed controller are applied to keep an autonomous vehicle tracking the planned path predicted by the improved RRT algorithm. It is shown that the vehicle can successfully track the path efficiently and reach the destination safely, with an average tracking control deviation of 5.2% of the vehicle width. The path planning is also applied to lane changes, and the average deviation from the lane during and after lane changes remains within 8.3% of the vehicle width.


2017 ◽  
Vol 9 (4) ◽  
Author(s):  
Midhun S. Menon ◽  
V. C. Ravi ◽  
Ashitava Ghosal

Hyper-redundant snakelike serial robots are of great interest due to their application in search and rescue during disaster relief in highly cluttered environments and recently in the field of medical robotics. A key feature of these robots is the presence of a large number of redundant actuated joints and the associated well-known challenge of motion planning. This problem is even more acute in the presence of obstacles. Obstacle avoidance for point bodies, nonredundant serial robots with a few links and joints, and wheeled mobile robots has been extensively studied, and several mature implementations are available. However, obstacle avoidance for hyper-redundant snakelike robots and other extended articulated bodies is less studied and is still evolving. This paper presents a novel optimization algorithm, derived using calculus of variation, for the motion planning of a hyper-redundant robot where the motion of one end (head) is an arbitrary desired path. The algorithm computes the motion of all the joints in the hyper-redundant robot in a way such that all its links avoid all obstacles present in the environment. The algorithm is purely geometric in nature, and it is shown that the motion in free space and in the vicinity of obstacles appears to be more natural. The paper presents the general theoretical development and numerical simulations results. It also presents validating results from experiments with a 12-degree-of-freedom (DOF) planar hyper-redundant robot moving in a known obstacle field.


PAMM ◽  
2017 ◽  
Vol 17 (1) ◽  
pp. 799-800 ◽  
Author(s):  
Victoria Grushkovskaya ◽  
Alexander Zuyev

2016 ◽  
pp. 1177-1202 ◽  
Author(s):  
Javier Minguez ◽  
Florant Lamiraux ◽  
Jean-Paul Laumond

Sign in / Sign up

Export Citation Format

Share Document