摘要
有向图是表示机械产品装配关系的有力结构,为减少有向图构造时的工作量,从拆装路径的空间可行性出发,提出了一种新的构造方法,从产品模型中提取装配关系矩阵并初始化有向图,建立层次化的结构,对产品中的零件进行路径规划,结合路径查找结果逐层填充节点,根据不同层次中节点的关系补充零件间的优先约束,从而生成相对完善的有向图。该方法基于CATIA二次开发自动进行几何推理,可用于存在复杂拆装路径的机械产品,具有良好的通用性。有向图拓扑排序生成的序列质量较高,运用粒子群算法对这些序列进行启发式搜索,相比传统方式缩小了搜索空间,能够更快找出较优的装配序列。
Directed graph is a powerful data structure that represents the assembly relationship of mechanical products.In this article,in order to reduce the workload of constructing directed graphs,a new method is proposed based on the spatial feasibility of disassembly paths.The matrix of assembly relationship is extracted from the product model and adopted to initialize the directed graph,and a hierarchical structure is worked out.The path planning is performed on different parts of the product,and the nodes are filled layer by layer according to the result of path finding.The relationship of nodes complements the precedence constraints among the parts,which ensures that the directed graph is relatively complete.The method automatically ensures the geometric reasoning based on the CATIA secondary development,and is widely used for mechanical products with complicated disassembly and assembly paths.The sequences generated by the directed-graph topology sorting are of high quality,and then the algorithm of particle swarm optimization is adopted for heuristic search on these sequences.Compared with the traditional method,the new method has made the search space smaller,and as a result,the optimal assembly sequence can be worked out in the possible shortest time.
作者
白利征
阎鑫
齐少璞
赵守智
BAI Li-zheng;YAN Xin;QI Shao-pu;ZHAO Shou-zhi(Department of Reactor Engineering Technology,China Institute of Atomic Energy,Beijing 102413)
出处
《机械设计》
CSCD
北大核心
2020年第3期72-76,共5页
Journal of Machine Design
关键词
装配关系矩阵
CATIA二次开发
粒子群算法
装配序列规划
assembly relationship matrix
CATIA secondary development
particle swarm optimization algorithm
assembly sequence planning
