Skip to main content

Optimization of a Cart Capacity Using the Three-Dimensional Single Bin Packing Problem for a Serving Robot

  • Conference paper
  • First Online:
  • 1093 Accesses

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 253))

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.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Kufner JJ (2010) Cloud-enabled robots. In: IEEE-RAS international conference on humanoid robots, Nashville, TN

    Google 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–429

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

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).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ara Khil .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Khil, A., Lee, KH. (2013). Optimization of a Cart Capacity Using the Three-Dimensional Single Bin Packing Problem for a Serving Robot. In: Park, J., Barolli, L., Xhafa, F., Jeong, HY. (eds) Information Technology Convergence. Lecture Notes in Electrical Engineering, vol 253. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6996-0_105

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-6996-0_105

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-6995-3

  • Online ISBN: 978-94-007-6996-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics