TY - GEN
T1 - Simultaneous dual-arm motion planning considering shared transfer path for minimizing operation time
AU - Kurosu, Jun
AU - Yorozu, Ayanori
AU - Takahashi, Masaki
N1 - Funding Information:
*Research supported by JST CREST Grant Number JPMJCR14E3.
Funding Information:
ACKNOWLEDGMENT This study was supported by “A Framework PRINTEPS to Develop Practical Artificial Intelligence” of the Core Research for Evolutional Science and Technology (CREST) of the Japan Science and Technology Agency (JST) under Grant Number JPMJCR14E3.
Publisher Copyright:
© 2017 IEEE.
PY - 2018/2/7
Y1 - 2018/2/7
N2 - One of the most basic tasks that a dual-arm robot does is pick-up and place work. Pick-up and place work consists of tasks in which the robot carries objects from a start position (initial position) to a goal position. The following three important points should also be considered when the dual-arm robot does this work efficiently: 1) collision avoidance of the arms, 2) which arm should move an object, and 3) the order in which the objects should be picked up and placed. In addition, dual-arm robot has operation range constraints. Depending on the position relationship between a start position and goal position, unless both arms are used, the object may not be transferred to a goal position. In this paper, we define the transfer path which must use both arms as 'shared transfer path'. Therefore, we propose a motion planning method to achieve efficient pick-up and place work considering shred transfer path. First, we use mixed integer linear programming (MILP) based planning for the pick-up and place work to determine which arm should move an object and in which order these objects should be moved while considering the dual-arm robot's operation range. Second, we plan the path using the rapidly exploring random tree (RRT) so that the arms do not collide, enabling the robot to perform efficient pick-up and place work based on the MILP planning solution. The effectiveness of proposed method is confirmed by simulations and experiments using the HIRO dual-arm robot.
AB - One of the most basic tasks that a dual-arm robot does is pick-up and place work. Pick-up and place work consists of tasks in which the robot carries objects from a start position (initial position) to a goal position. The following three important points should also be considered when the dual-arm robot does this work efficiently: 1) collision avoidance of the arms, 2) which arm should move an object, and 3) the order in which the objects should be picked up and placed. In addition, dual-arm robot has operation range constraints. Depending on the position relationship between a start position and goal position, unless both arms are used, the object may not be transferred to a goal position. In this paper, we define the transfer path which must use both arms as 'shared transfer path'. Therefore, we propose a motion planning method to achieve efficient pick-up and place work considering shred transfer path. First, we use mixed integer linear programming (MILP) based planning for the pick-up and place work to determine which arm should move an object and in which order these objects should be moved while considering the dual-arm robot's operation range. Second, we plan the path using the rapidly exploring random tree (RRT) so that the arms do not collide, enabling the robot to perform efficient pick-up and place work based on the MILP planning solution. The effectiveness of proposed method is confirmed by simulations and experiments using the HIRO dual-arm robot.
UR - http://www.scopus.com/inward/record.url?scp=85047488494&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047488494&partnerID=8YFLogxK
U2 - 10.1109/ASCC.2017.8287215
DO - 10.1109/ASCC.2017.8287215
M3 - Conference contribution
AN - SCOPUS:85047488494
T3 - 2017 Asian Control Conference, ASCC 2017
SP - 467
EP - 472
BT - 2017 Asian Control Conference, ASCC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 11th Asian Control Conference, ASCC 2017
Y2 - 17 December 2017 through 20 December 2017
ER -