Obstacle Avoidance and Path Planning for Multi-Joint Manipulator in a Space Robot

被引:30
作者
Xie, Yaen [1 ]
Zhang, Zhidan [2 ]
Wu, Xiande [2 ]
Shi, Zhen [1 ]
Chen, Yangyang [3 ]
Wu, Baixuan [2 ]
Mantey, Kofi Akrofi [2 ]
机构
[1] Harbin Engn Univ, Coll Automat, Harbin 150001, Peoples R China
[2] Harbin Engn Univ, Coll Aerosp & Civil Engn, Harbin 150001, Peoples R China
[3] Beijing Inst Elect Syst Engn, Beijing 100854, Peoples R China
基金
中国国家自然科学基金;
关键词
FABRIK; multi-joint manipulator; obstacle avoidance; path planning; rapidly-exploring random tree; INVERSE KINEMATICS; OPTIMIZATION; ATTITUDE;
D O I
10.1109/ACCESS.2019.2961167
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An obstacle avoidance and path planning algorithm for a multi-joint manipulator in a space robot is presented in this paper. In this paper, the end-effector of the manipulator is used to capture some special target in a space environment with obstacles. To ensure the safety of the operation, a collision-free path from the initial position to the target position is essential. Therefore, an obstacle avoidance and path planning algorithm based on the Rapidly-Exploring Random Tree (RRT) algorithm and the Forward and Backward Reaching Inverse Kinematics (FABRIK) algorithm is presented in this paper. First, a path planning algorithm based on the Rapidly-Exploring Random Tree (RRT) algorithm is designed for the multi-joint manipulator. Further, a method to generate a random point by artificial guidance is introduced for a higher searching speed. The RRT algorithm can effectively explore the entire workspace and find a feasible path without collision for the end-effector. To calculate the positions of each joint, the Forward and Backward Reaching Inverse Kinematics (FABRIK) algorithm is introduced and improved for the problem of inverse kinematics. The FABRIK algorithm avoids the use of rotational angles or matrices, and instead finds each joint position by locating a point on a line, and thus, it has a low computational cost. Therefore, the improved obstacle avoidance and path planning algorithm can quickly plan a feasible path for the multi-joint manipulator in a space environment with obstacles. A numerical simulation is carried out to analyze the proposed obstacle avoidance and path planning method. It is observed that the method finds a feasible path without collision for the multi-joint manipulator with a low computational cost. These results validated the effectiveness of the proposed method for path planning to avoid the obstacles.
引用
收藏
页码:3511 / 3526
页数:16
相关论文
共 38 条
[1]   Semi-lazy probabilistic roadmap: a parameter-tuned, resilient and robust path planning method for manipulator robots [J].
Akbaripour, Hossein ;
Masehian, Ellips .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2017, 89 (5-8) :1401-1430
[2]  
Alekh V, 2016, INT J CONTROL THEORY, V9, P71
[3]  
[Anonymous], J MECH ENG
[4]  
[Anonymous], P 7 IEEE RAS INT C H
[5]  
[Anonymous], P 10 INT WORKSH ROB
[6]   FABRIK: A fast, iterative solver for the Inverse Kinematics problem [J].
Aristidou, Andreas ;
Lasenby, Joan .
GRAPHICAL MODELS, 2011, 73 :243-260
[7]  
Benevides J. R., 2015, P 12 LAT AM S 3 BRAZ
[8]   A DISJUNCTIVE PROGRAMMING APPROACH FOR MOTION PLANNING OF MOBILE ROUTER NETWORKS [J].
Bezzo, Nicola ;
Fierro, Rafael ;
Swingler, Ashleigh ;
Ferrari, Silvia .
INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2011, 26 (01) :13-25
[9]  
Buss S. R., 2005, Journal of Graphics Tools, V10, P37
[10]  
Buss S. R., 2004, IEEE Journal of Robotics and Automation, V17, P16