摘要： 提出一种新颖的使用传递闭包图(TCG)的表示方法，通过TCG表达的广义对称可行性和狭义对称可行性条件，将其引申到探索解决具有高复杂限制条件，并且期望产生对称解空间的排样问题。给出的TCG对称智能排样算法已试用于汽车内饰件、皮料的排样。实验结果证明，该方法优于常规以绝对坐标表示的排样寻优方式和采用对称序列对的排样方法。

关键词: 排样, 对称, 智能, 图

Abstract: A novel scheme using the Transitive Closure Graph(TCG) representation is proposed to explore the symmetry solution space in the placement problem, which usually abounds in complex constraints. General-symmetric-feasibility and special-symmetric-feasibility conditions of a TCG representation are used. The proposed TCG symmetry placement algorithm has been tested using several skins of trim. Experimental results show its superiority to both the conventional absolute coordinate representation and the symmetry sequence-pair approaches.

Key words: nesting, symmetry, intelligent, graph

中图分类号: 

• TP301