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

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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Multimedia tools and applications 2015-01, Vol.74 (1), p.185-198
Hauptverfasser:	Khil, A-Ra, Lee, Kang-Hee
Format:	Artikel
Sprache:	eng
Schlagworte:	3-D technology Algorithms Analysis Bulging Carts Computer Communication Networks Computer Science Data Structures and Information Theory Feasibility Information technology Multimedia Multimedia computer applications Multimedia Information Systems Optimization Packing problem Robotics Robots Special Purpose and Application-Based Systems Studies Three dimensional Transport Trays
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1380-7501 1573-7721
DOI:	10.1007/s11042-013-1843-8