Motion Planning for Closed-Chain Constraints Based on Probabilistic Roadmap With Improved Connectivity

被引:23
作者
Jang, Keunwoo [1 ]
Baek, Jiyeong [1 ]
Park, Suhan [1 ]
Park, Jaeheung [2 ,3 ]
机构
[1] Seoul Natl Univ, Dept Intelligence & Informat, Seoul 08826, South Korea
[2] Seoul Natl Univ, RICS, Grad Sch Convergence Sci & Technol ASRI, Seoul 08826, South Korea
[3] Adv Inst Convergence Technol, Suwon 16229, South Korea
基金
新加坡国家研究基金会;
关键词
Planning; Manifolds; End effectors; Task analysis; Trajectory; Kinematics; Probabilistic logic; Closed-chain constraint; inverse kinematics (IK); motion planning; probabilistic roadmap (PRM); REDUNDANT MANIPULATORS; SPACE;
D O I
10.1109/TMECH.2022.3175260
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiarm systems can perform complex and difficult tasks, such as manipulating a heavy or large object, that cannot be accomplished by a single manipulator owing to workspace and payload limitations. However, the motion planning problem for performing such a task is challenging because of the need to consider the closed-chain constraint. This article proposes an efficient motion planner that considers the closed-chain constraint based on a probabilistic roadmap. The proposed planner utilizes the following strategies. First, the planner obtains feasible nodes by randomly sampling the object pose, followed by computing the inverse kinematics (IK) solution of the multiarm. This can directly find a collision-free node satisfying the closed-chain constraint. Second, the planner repeatedly updates the new IK solution of the multiarm for the start and goal object pose. The IK solution is computed as close as possible to the joint configuration of the neighbor node. Consequently, the planner is more efficient than the existing methods that generate a node by sampling the joint configuration with projection method and have one pair of the start and goal node. Therefore, the planner can efficiently compute the path for object manipulation using a multiarm under a closed-chain constraint. The effectiveness of the proposed planner is validated by comparison with the existing planners in several scenarios. A video clip of the experiments in various scenarios can be found at https://youtu.be/PR9aFf3juu4.
引用
收藏
页码:2035 / 2043
页数:9
相关论文
共 28 条
[1]  
Beeson P, 2015, IEEE-RAS INT C HUMAN, P928, DOI 10.1109/HUMANOIDS.2015.7363472
[2]   Task Space Regions: A framework for pose-constrained manipulation planning [J].
Berenson, Dmitry ;
Srinivasa, Siddhartha ;
Kuffner, James .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2011, 30 (12) :1435-1460
[3]   CLOSED-LOOP INVERSE KINEMATICS SCHEMES FOR CONSTRAINED REDUNDANT MANIPULATORS WITH TASK SPACE AUGMENTATION AND TASK PRIORITY STRATEGY [J].
CHIACCHIO, P ;
CHIAVERINI, S ;
SCIAVICCO, L ;
SICILIANO, B .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1991, 10 (04) :410-425
[4]  
Cortés J, 2005, SPRINGER TRAC ADV RO, V17, P75
[5]  
De Maeyer J, 2017, IEEE INT C EMERG, DOI 10.1109/etfa.2017.8247616
[6]   Automated Milling Path Tracking and CAM-ROB Integration for Industrial Redundant Manipulators [J].
Gracia, Luis ;
Andres, Javier ;
Gracia, Carlos .
INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2012, 9
[7]   A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].
HART, PE ;
NILSSON, NJ ;
RAPHAEL, B .
IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+
[8]   Path Planning Under Kinematic Constraints by Rapidly Exploring Manifolds [J].
Jaillet, Leonard ;
Porta, Josep M. .
IEEE TRANSACTIONS ON ROBOTICS, 2013, 29 (01) :105-117
[9]   Analysis of probabilistic roadmaps for path planning [J].
Kavraki, LE ;
Kolountzakis, MN ;
Latombe, JC .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (01) :166-171
[10]   Tangent bundle RRT: A randomized algorithm for constrained motion planning [J].
Kim, Beobkyoon ;
Um, Terry Taewoong ;
Suh, Chansu ;
Park, F. C. .
ROBOTICA, 2016, 34 (01) :202-225