Optimization of a robot-served cart capacity using the three-dimensional single bin packing problem
- Authors
- Khil, A-Ra; Lee, Kang-Hee
- Issue Date
- Jan-2015
- Publisher
- SPRINGER
- Keywords
- Three-dimensional single bin packing problem; Three-dimensional knapsack problem; Serving robot; Optimization; Cart; Tray
- Citation
- MULTIMEDIA TOOLS AND APPLICATIONS, v.74, no.1, pp.185 - 198
- Journal Title
- MULTIMEDIA TOOLS AND APPLICATIONS
- Volume
- 74
- Number
- 1
- Start Page
- 185
- End Page
- 198
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/8837
- DOI
- 10.1007/s11042-013-1843-8
- ISSN
- 1380-7501
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > Global School of Media > 1. Journal Articles
- College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/8837)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.