An Encoder-Decoder Approach for Packing Circles
Akshay Kiran Jose, Gangadhar Karevvanavar, Rajshekhar V Bhat

TL;DR
This paper introduces a neural network-based encoder-decoder method for packing identical circles within a larger circle, offering a novel approach that generalizes to higher dimensions and shapes, achieving competitive results.
Contribution
A novel encoder-decoder neural network architecture for packing circles within a larger circle, providing a flexible and generalizable solution to a complex non-convex problem.
Findings
Achieves competitive packing performance compared to classical methods.
Can be extended to higher dimensions and different shapes.
Provides a sub-optimal but effective packing solution.
Abstract
The problem of packing smaller objects within a larger object has been of interest since decades. In these problems, in addition to the requirement that the smaller objects must lie completely inside the larger objects, they are expected to not overlap or have minimum overlap with each other. Due to this, the problem of packing turns out to be a non-convex problem, obtaining whose optimal solution is challenging. As such, several heuristic approaches have been used for obtaining sub-optimal solutions in general, and provably optimal solutions for some special instances. In this paper, we propose a novel encoder-decoder architecture consisting of an encoder block, a perturbation block and a decoder block, for packing identical circles within a larger circle. In our approach, the encoder takes the index of a circle to be packed as an input and outputs its center through a normalization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Advanced Manufacturing and Logistics Optimization · Robotic Path Planning Algorithms
