상세 보기
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. © 2013 Springer Science+Business Media Dordrecht.
- 제목
- Optimization of a cart capacity using the three-dimensional single bin packing problem for a serving robot
- 저자
- Khil, A.; Lee, K.-H.
- 발행일
- 2013
- 학회명
- 5th FTRA International Conference on Information Technology Convergence and Services, ITCS 2013 and the 3rd International Conference on Intelligent Robotics, Automations, Telecommunication Facilities, and Applications, IRoA 2013
- 개최지
- Fukuoka
- 학회 개최일
- 2013-07-08 ~ 2013-07-10