A Vision-Based Intelligent System for Packing 2-D Irregular Shapes

Bouganis, Alexandros; Shanahan, Murray

doi:10.1109/tase.2006.887158

Cited by 33 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The ratio of the total area of all the packing items to the area of the rectangle sheet that encloses these items called packing density (PD) 24 should be as big as possible PD = Area items Area rectangle ð2Þ…”

Section: Definitionmentioning

confidence: 99%

Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm

Liao

et al. 2016

Advances in Mechanical Engineering

View full text Add to dashboard Cite

This article deals with the packing problem of irregular items allocated into a rectangular sheet to minimize the waste. Conventional solution is not visual during the packing process. It obtains a reasonable and relatively satisfactory solution between the nesting time and nesting solution. This article adopts a physical method that uses rubber band packing algorithm to simulate a rubber band wrapping those packing irregular items. The simulation shows a visual and fast packing process. The resultant rubber band force is applied in the packing items to translate, rotate, and slide them to make the area decrease and obtain a high packing density. An improved analogy QuickHull algorithm is presented to obtain extreme points of rubber band convex hull. An adaptive module could set a variable rubber band force and a variable time step to make a proper convergence and no intersection. A quick convex decomposition method is used to solve the problem of concave polygon. A plural vector expression approach is adopted to calculate the resultant vector of the rubber band force. Several cases are compared with the benchmark problems to prove rubber band packing algorithm performance.

show abstract

Section: Definitionmentioning

confidence: 99%

Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm

Liao

et al. 2016

Advances in Mechanical Engineering

View full text Add to dashboard Cite

show abstract

“…That all the objects must be in the plate Space and can not overlap with each other are two constraints, they can respectively be expressed as and , among . The quality evaluation of a packing scheme is usually Packing Density (PD) [2] , PD is area utilization rate that is the ratio of the total area of objects and the area of The using, higher number indicates that packing scheme is better, maximum is 100%. The number of PD only is related with Length, when the Length is minimum the PD can get the maximum.…”

Section: Strip Packing Problemsmentioning

confidence: 99%

An physical force-driven packing optimization design method in strip packing problems

Liao¹,

Guo²,

Ou³

2016

Proceedings of the 2016 International Forum on Energy, Environment and Sustainable Development

View full text Add to dashboard Cite

Abstract. This thesis put forward a physical force-driven packing optimization design method for solving the Strip Packing Problems (SPP). This thesis researched on the following aspects: The mathematical optimization model of SPP is proposed firstly. Based on the convex hull plus rubber band compact layout method, the method of physical analysis of the layout process and the time-based layout simulation process are presented definitely. An enhanced version of the mate algorithm of surplus rectangle for rectangle packing is proposed. This method use the minimal rectangle to replacing polygon objects and choose the next packing object by a series of score decision rules. Different forces are applied to the packing objects in corresponding stages which would drive them to move compactly and the optimal packing result can be obtained in the end. The comparison of computational experiment results shows that the proposed packing method have a better performance.

show abstract

“…Indeed, visual tracking has been the interests of industry and academia for many years, and still an active area of research (Bozma & Yal-cin, 2002). These studies commonly investigate the optimal way of detecting the moving object, separating them from the background, and efficiently extracting information from the images for subsequent operations (Cheng & Jafari , 2008;Bouganis & Shanahan, 2007;Lee et al, 2007;Golnabi & Asadpour, 2007;Tsai et al, 2006;Ling et al, 2005;Stewart, 1999;Yao, 1998). Note vision related studies suffer from technical difficulties in lighting irregularities, optical distortions, calibration, overlapped parts, inseparable features in the image, variations in settings, etc.…”

Section: Calibration For Vision-guided Robotics In Eqmmentioning

confidence: 99%