Efficiently Disassemble-and-Pack for Mechanism

Mingyuan Li, Xiaoheng Jiang, Ning-Bo Gu, Weiwei Xu, Junxiao Xue, Bing Zhou, Mingliang Xu

Abstract

Packing complex mechanical objects into containers is a significant challenge in logistics due to their sprawling geometries and internal joints. This paper introduces a "disassemble-and-pack" strategy that treats a mechanism's joints as optimization parameters. By hierarchically disassembling the object and folding sub-assemblies into their most compact forms, the system achieves superior space utilization compared to traditional methods.

Introduction

The 3D bin packing problem is a classic NP-complete computational challenge. For mechanical objects like robot arms or engines, the difficulty is compounded by awkward shapes that create substantial "dead air" when packed as static units. While previous methods have explored splitting objects, they often ignore the logical structure of mechanisms. This research proposes using the mechanism's own joints to break it down and fold it into a minimal volume for efficient storage and shipping.

Methodology

The proposed system follows a two-stage pipeline: Hierarchical Disassembly and Mechanical Group Packing.

The proposed disassemble-and-pack pipeline, showing the transition from a full assembly to a packed container.

Hierarchical Disassembly

The mechanism is modeled as a set of rigid bodies connected by various joint types (e.g., revolute, gear-to-gear). The algorithm generates a hierarchy of potential disassembly points. Crucially, for each sub-assembly, the system calculates the degrees of freedom allowed by the remaining joints and adjusts the parts to find the Minimum Oriented Bounding Box (MOBB). This "folding" step ensures each group is as compact as possible before packing.

Mechanical Group Packing

Once the object is decomposed into optimized groups, they are placed into the container using a heuristic search:

  1. Sorting: Groups are ordered by their maximum extension.
  2. Roto-translation: Quaternions and vectors are used to determine the optimal orientation and position.
  3. Hole-Filling: The algorithm actively searches for empty volumes (holes) created by previously placed parts to maximize density. If no suitable hole is found, it places the part to minimize the total height increase.

Experimental Results

The approach was evaluated on four representative mechanical models: a Robot-arm, a Crank-block, a Motor, and an Excavator.

Packing results for (a) Crank-block, (b) Motor, and (c) Excavator, demonstrating significant volume reduction.

The results demonstrate that the algorithm successfully condenses sprawling machinery into compact rectangular footprints. By exploiting joint disconnections and internal motion, the method produces group sets with minimal total volume, leading to tighter packing than static heuristics.

Discussion and Future Work

A key insight of this work is treating joints as variables rather than constraints. This allows the algorithm to find "good enough" solutions efficiently through breadth-first search. However, limitations remain. The current model assumes all parts are rigid, ignoring flexible components like hoses. Additionally, while qualitative results are strong, further quantitative benchmarking against industrial state-of-the-art heuristics is needed. Future research could integrate machine learning to predict optimal disassembly points, further accelerating the process for highly complex assemblies.

Summary updated

Abstract

In this paper, we present a disassemble-and-pack approach for a mechanism to seek a box which contains total mechanical parts with high space utilization. Its key feature is that mechanism contains not only geometric shapes but also internal motion structures which can be calculated to adjust geometric shapes of the mechanical parts. Our system consists of two steps: disassemble mechanical object into a group set and pack them within a box efficiently. The first step is to create a hierarchy of possible group set of parts which is generated by disconnecting the selected joints and adjust motion structures of parts in groups. The aim of this step is seeking total minimum volume of each group. The second step is to exploit the hierarchy based on breadth-first-search to obtain a group set. Every group in the set is inserted into specified box from maximum volume to minimum based on our packing strategy. Until an approximated result with satisfied efficiency is accepted, our approach finish exploiting the hierarchy.
BibTeX
@misc{li2018efficiently,
  author = {Mingyuan Li and Xiaoheng Jiang and Ning-Bo Gu and Weiwei Xu and Junxiao Xue and Bing Zhou and Mingliang Xu},
  title = {{Efficiently Disassemble-and-Pack for Mechanism}},
  year = {2018},
  eprint = {1801.02356},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1801.02356},
}
Figure