End-to-end deep learning-based framework for path planning and collision checking: bin-picking application

被引:2
作者
Ghafarian Tamizi, Mehran [1 ]
Honari, Homayoun [2 ]
Nozdryn-Plotnicki, Aleksey [3 ]
Najjaran, Homayoun [1 ,2 ]
机构
[1] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC, Canada
[2] Univ Victoria, Dept Mech Engn, Victoria, BC, Canada
[3] Apera AI, Vancouver, BC, Canada
关键词
Path planning; artificial neural network; collision checking; bin-picking; imitation learning; data aggregation; MOTION; ALGORITHMS; SYSTEM;
D O I
10.1017/S0263574724000109
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Real-time and efficient path planning is critical for all robotic systems. In particular, it is of greater importance for industrial robots since the overall planning and execution time directly impact the cycle time and automation economics in production lines. While the problem may not be complex in static environments, classical approaches are inefficient in high-dimensional environments in terms of planning time and optimality. Collision checking poses another challenge in obtaining a real-time solution for path planning in complex environments. To address these issues, we propose an end-to-end learning-based framework viz., Path Planning and Collision checking Network (PPCNet). The PPCNet generates the path by computing waypoints sequentially using two networks: the first network generates a waypoint, and the second one determines whether the waypoint is on a collision-free segment of the path. The end-to-end training process is based on imitation learning that uses data aggregation from the experience of an expert planner to train the two networks, simultaneously. We utilize two approaches for training a network that efficiently approximates the exact geometrical collision checking function. Finally, the PPCNet is evaluated in two different simulation environments and a practical implementation on a robotic arm for a bin-picking application. Compared to the state-of-the-art path-planning methods, our results show significant improvement in performance by greatly reducing the planning time with comparable success rates and path lengths.
引用
收藏
页码:1094 / 1112
页数:19
相关论文
共 52 条
[1]  
Aleo I., 2010, 2010 INT JOINT C NEU, P1
[2]  
Antiga A., 2017, AUTOMATIC DIFFERENTI
[3]  
Bency MJ, 2019, IEEE INT C INT ROBOT, P3965, DOI [10.1109/iros40897.2019.8968089, 10.1109/IROS40897.2019.8968089]
[4]  
Boscariol P., 2023, Robot Design: From Theory to Service Applications, P69
[5]  
Boscariol R.P., 2020, INT C IFTOMM ITALY, P318
[6]  
Buchholz D, 2016, STUD SYST DECIS CONT, V44, P3, DOI 10.1007/978-3-319-26500-1_2
[7]  
Buchholz D, 2014, IEEE INT CONF ROBOT, P875, DOI 10.1109/ICRA.2014.6906957
[8]  
C. R, 2020, PYBULLET PLANNING
[9]   Reinforcement based mobile robot path planning with improved dynamic window approach in unknown environment [J].
Chang, Lu ;
Shan, Liang ;
Jiang, Chao ;
Dai, Yuewei .
AUTONOMOUS ROBOTS, 2021, 45 (01) :51-76
[10]   Learning an Optimal Sampling Distribution for Efficient Motion Planning [J].
Cheng, Richard ;
Shankar, Krishna ;
Burdick, Joel W. .
2020 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2020, :7485-7492