Skip to main content
SpringerLink
Log in

Optimization of a robot-served cart capacity using the three-dimensional single bin packing problem

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. ASIMO. http://world.honda.com/ASIMO

  2. Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38:423–429

    Article  MATH  Google Scholar 

  3. Chung FKR, Garey MR, Johnson DS (1982) On packing two-dimensional bins. SIAM J Algebr Discret Methods 3:66–76

    Article  MATH  MathSciNet  Google Scholar 

  4. Kuffner JJ (2010) Cloud-enabled robots. In: IEEE-RAS international conference on humanoid robots. Nashville

  5. Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manag Sci 44:388

    Article  MATH  Google Scholar 

  6. Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48:256–267

    Article  MATH  MathSciNet  Google Scholar 

  7. PR2 Cleans Up with a Cart. http://www.willowgarage.com/pages/pr2/overview

  8. The 2012 PR2 Workshop in Freiburg. http://www.youtube.com/watch?v=kvahil80ayw

  9. 400 year old tea-serving robot kit. http://www.boingboing.net/2005/10/29/400-year-old-teaserv.html

Download references

Acknowledgments

This research was supported by the National Research Foundation of Korea Grant funded by the Korean Government (NRF-2013-S1A5A8020988).

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, College of Information Technology, Soongsil University, 511 Sangdo-Dong, Dongjak-Gu, Seoul, Republic of Korea

    A-Ra Khil

  2. Global School of Media, College of Information Technology, Soongsil University, 511 Sangdo-Dong, Dongjak-Gu, Seoul, Republic of Korea

    Kang-Hee Lee

Authors
  1. A-Ra Khil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang-Hee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kang-Hee Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khil, AR., Lee, KH. Optimization of a robot-served cart capacity using the three-dimensional single bin packing problem. Multimed Tools Appl 74, 185–198 (2015). https://doi.org/10.1007/s11042-013-1843-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-013-1843-8

Keywords

Search

Navigation