基于成本和并行装配的装配序列有向图求解

The solution of assembly sequence based on assembly cost and parallel assembly with orientation graph

针对虚拟装配中装配序列规划问题,引入了有向图来描述装配过程中的零件以及零件间的装配约束关系。结合装配成本、并行装配、装配经验优化了装配关系有向图的拓扑排序算法。提出了将装配方向变化次数作为衡量装配成本的一项重要指标。提出了将单次可装配的零件数量作为装配优先方向的参考依据。文章最后给出了装配序列生成的具体算法。

According to assembly sequence planning（ASP）in virtual assembly,orientation graph was introduced to describe the parts and the restrained relation among the parts.Assembly cost,parallel assembly and assembly experience were used to optimize the algorithm of topological sort.An assembly cost evaluation factor which depends on times of assembly direction changes was submitted. A basis relied on the amount of unrestrained parts for the prior assembly direction was submitted.Finally,the paper gave the algorithm of assembly sequence planning generation.