scholarly journals Packing Planning and Execution Considering Arrangement Rules

2021 ◽  
Vol 3 (1) ◽  
pp. 1-21
Author(s):  
Akiya Yasuda ◽  
Gustavo Alfonso Garcia Ricardez ◽  
Jun Takamatsu ◽  
Tsukasa Ogasawara

To send a consumer the ordered products in e-commerce, it is necessary to pack the products into a container. When packing, we need to consider the arrangement of the products to avoid damaging them during transportation by using the know-how of packing. In this paper, we propose a packing robot system that plans the arrangement and then executes it. To develop this robot system, we employ two ideas. The first idea is to split the whole process into the arrangement of the objects and robot motion generation. The arrangement is regarded as a 3D bin-packing problem. The second idea is to use the heuristics of the packing so that objects are stacked from the bottom. Since the space above the target position is free from collisions, the strategy to approach from the top reduces the possibility of a collision. In the experiments, we succeeded in arranging eleven objects satisfying the assigned rules and packing ten of the eleven objects using the robot.

2021 ◽  
pp. 105550
Author(s):  
Hao Zhang ◽  
Qiang Liu ◽  
Lijun Wei ◽  
Jiawei Zeng ◽  
Jiewu Leng ◽  
...  

2010 ◽  
Vol 10 (1/2/3) ◽  
pp. 217 ◽  
Author(s):  
Abdelghani Bekrar ◽  
Imed Kacem ◽  
Chengbin Chu ◽  
Cherif Sadfi

2010 ◽  
Vol 43 (8) ◽  
pp. 72-76 ◽  
Author(s):  
Mhand Hifi ◽  
Imed Kacem ◽  
Stephane Negre ◽  
Lei Wu

1994 ◽  
Vol 03 (01) ◽  
pp. 47-60
Author(s):  
R.A. McCONNELL ◽  
B.L. MENEZES

This article compares three techniques for allocating tasks in a mesh-based multi-computer. Tasks are expressed as rectangles of a certain width and height corresponding to the topology of processors desired. The task allocation problem, is thus a variant of the bin-packing problem, with one major difference: in the bin-packing problem one seeks to minimize the height of the bin, while here we seek to maximize the utilization of processors in a multicomputer. The three techniques compared are a classical level-by-level algorithm, a connectionist simulated annealing variant of the Hopfield network, and a genetic algorithm. An extension to the dynamic processor allocation problem is modeled by fixing some rectangles in place and packing the request rectangles in the residual space on the mesh; this corresponds to a pre-existing condition, i.e., some tasks have already been allocated to the Processor Mesh. Implementation and experimental results are presented.


2007 ◽  
Vol 35 (3) ◽  
pp. 365-373 ◽  
Author(s):  
François Clautiaux ◽  
Antoine Jouglet ◽  
Joseph El Hayek

Sign in / Sign up

Export Citation Format

Share Document