一种基于有向割集分解的装配序列生成改进算法  

A iImprovement method for assembly sequences planning based on cut-set analysis of directional graph

作　　者：张庆霞[1] 钟艳如[1] 马如林[1] 

机构地区：[1]桂林电子科技大学计算机与控制学院,桂林541004

出　　处：《机械设计与制造》2008年第6期68-70,共3页Machinery Design & Manufacture

基　　金：国家自然科学基金(60563005)

摘　　要：基于有向图割集分解的装配顺序规划算法是在无向割集的启发下,结合有向图设计出的一种新的装配序列生成算法。尽管有向割集分解算法本身具有优良的计算和描述特性,但已有的有向装配联接图模型却存在不少缺陷。在保证装配过程与拆卸过程可逆的前提下,对已有的有向割集算法进行合理的改进,加入了反映装配结构特性和内在关系的操作,建立了分层有向装配连接图模型,提出了基于该模型的装配顺序分层规划方法,并通过实例验证了改进算法的有效性。Assembly sequences planning based on cut-set analysis of directional graph which is enlightened by unoriented cut-set and designed with directional graph, is a novel method for assembly sequence generation algorithm Although the algorithm itself has excellent calculation and description characteristics, there are many drawbacks existed in the existing directional assembly connection graph model On the premise of the reversibility of assembly and disassembly, it offers a newly modified algorithm based on former directional cut-set algorithm, adds the operation reflecting the structure and internal relation of assembly, builds the model of the layered directional assembly connection graph and presents the layered assembly sequence planning based on this model Finally, case analysis demonstrates that the method is more effective and simplified.

关 键 词：装配建摸 有向割集 分层有向图 

分 类 号：TH12[机械工程—机械设计及理论] TP391[自动化与计算机技术—计算机应用技术]