计算机科学
强化学习
装箱问题
机器人
聚类分析
人工智能
蒙特卡罗树搜索
数学优化
算法
蒙特卡罗方法
箱子
数学
统计
作者
Jie Jia,Huiliang Shang,Xiong Chen
标识
DOI:10.1109/icnsc55942.2022.10004170
摘要
In the field of logistics and warehousing, it is extremely challenging and practically useful to realize an intelligent palletizing robot which can quickly stack and place cartons of various sizes in disorder. The core technology is the solution of the Online 3D Bin Packing Problem (Online 3D-BPP). For the task of estimating the size and pose of objects by robots, we propose an object size and orientation estimation algorithm based on Euclidean clustering of point cloud information, principal components analysis and minimum circumscribed matrix fitting. In order to solve the extremely challenging Online 3D-BPP, we propose a solution strategy by combining deep reinforcement learning (DRL) and Monte Carlo tree search (MCTS) algorithm, which can combine the information of the prospective K objects to be packed to find the best packing scheme. At the same time, we use the improved Actor-Critic algorithm to train the model and introduce the packing configuration tree model based on heuristic rules, which overcomes the disadvantage that DRL cannot converge when the degree of discretization of the action space increases. The extensive evaluation demonstrates that our learned policy achieves a more efficient and robust packing strategy than current state-of-the-art methods and is practically usable for real-world applications.
科研通智能强力驱动
Strongly Powered by AbleSci AI