GFPack++:通过注意力学习梯度场改进二维不规则装箱
GFPack++: Attention-Driven Gradient Fields for Optimizing 2D Irregular Packing
AI总结:
本文提出GFPack++,一种基于注意力的梯度场学习方法,通过几何编码与关系编码策略解决二维不规则装箱问题,支持连续旋转,在空间利用率和推理速度上优于现有方法。
摘要:
二维不规则装箱是一个经典的组合优化问题,在材料利用和纹理图集生成等多个领域有广泛应用。这个NP难问题需要高效算法来优化空间利用率。传统数值方法存在收敛速度慢和计算成本高的问题。现有的基于学习的方法,如基于分数的扩散模型,也存在局限性,例如不支持旋转、频繁发生碰撞、对任意边界的适应性差以及推理速度慢。从教师装箱数据中学习的难点在于捕捉装箱样本之间复杂的几何关系,这些关系包括物体的空间(位置、朝向)关系、它们的几何特征以及容器边界条件。在潜在空间中表示这些关系具有挑战性。我们提出了GFPack++,一种基于注意力的梯度场学习方法来解决这一挑战。它包含两个关键策略:用于有效特征编码的基于注意力的几何编码和用于学习复杂关系的基于注意力的关系编码。我们研究了教师数据与推理数据之间的利用率分布,并设计了一个加权函数,在训练过程中优先考虑更紧凑的教师数据,从而提升学习效果。我们的扩散模型支持连续旋转,并在多个数据集上优于现有方法。我们在多个广泛使用的基线方法上实现了更高的空间利用率,推理速度比之前的基于扩散的方法快一个数量级,并且对任意边界展现出良好的泛化能力。我们计划发布源代码和数据集,以支持该方向的进一步研究。
英文摘要:
2D irregular packing is a classic combinatorial optimization problem with various applications, such as material utilization and texture atlas generation. Due to its NP-hard nature, conventional numerical approaches typically encounter slow convergence and high computational costs. Previous research (GFPack) introduced a generative method for gradient-based packing, providing early evidence of its feasibility but faced limitations such as insufficient rotation support, poor boundary adaptability, and high overlap ratios. In this paper, we propose GFPack++, a deeply investigated framework that adopts attention-based geometry and relation encoding, enabling more comprehensive modeling of complex packing relationships. We further design a constrained gradient and a weighting function to enhance both the feasibility of the produced solutions and the learning effectiveness. Experimental results on multiple datasets demonstrate that GFPack++ achieves higher space utilization, supports continuous rotation, generalizes well to arbitrary boundaries, and infers orders of magnitude faster than previous approaches. Codes for this paper are at https://github.com/TimHsue/GFPack-pp.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。