Optimization of a Cart Capacity Using the Three-Dimensional Single Bin Packing Problem for a Serving Robot
Given a set of rectangular-shaped items such as dishes, cups, saucers, or forks and a rectangular tray of a cart, the three-dimensional single bin packing problem (3D-BPP) involves orthogonally packing a subset of the items within the tray. If the value of an item is given by its volume, the objective is to maximize the covered volume of the tray. Thus, this paper aims to optimize the transport capacity of a serving robot carrying a cart. This experiment, the first of its type, proves the feasibility of this endeavor efficiently.
KeywordsThree-dimensional single bin packing problem Three-dimensional knapsack problem Serving robot Cart Tray Optimization
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (grant No. 2012-0003583).
- 1.Kufner JJ (2010) Cloud-enabled robots. In: IEEE-RAS international conference on humanoid robots, Nashville, TNGoogle Scholar
- 2.PR2 Cleans Up with a Cart, http://www.willowgarage.com/pages/pr2/overview
- 3.Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38:423–429Google Scholar