串行装配环境下最优装配序列的求解

On Solution of Optimal Assembly Sequence under Serial Assembly Environment

为了使得基于装配与或图的装配序列寻优方法支持串行装配环境下的最优装配序列的求解,设计了从装配树列举装配序列的递归算法,并讨论了装配序列的评价问题.首先给出了串行装配环境下最优装配序列的求解思路,接着将装配树转换成表示装配任务优先关系的有向图,进而从有向图列举出所有可行的装配序列,最后讨论串行装配环境下装配序列的评价问题.文中给出的实例说明本文方法的可行性,本文的实验结果说明本文方法的可接受性.

To make the approach to optimal assembly sequence of assembly,which based on AND/OR graph,supports the solution of optimal assembly sequence of assembly under serial assembly environment,a recursive algorithm to enumerate all assembly sequences of a given assembly tree was proposed,and the issues of assembly sequence evaluation were discussed.Firstly,the basic idea of the generation of the optimal assembly sequence was presented,and then the assembly trees were converted to directed graphs which descript the precedence relationship of assembly tasks,all feasible assembly sequences were subsequently enumerated from the directed graph.Finally,the issues of assembly sequence evaluation under serial assembly environment were discussed.The example given in this paper illustrates the effect of our method,and the experimental results illustrate the acceptability of this method.