Symbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer

摘要：

　　To improve solution efficiency and automation of assembly sequence planning,a symbolic ordered binary decision diagram (OBDD) technique for assembly sequence planning problem based on unordered partition with 2 parts of a positive integer is proposed.To convert the decomposition of assembly liaison graph into solving unordered partition with 2 parts of positive integer N,a transformation method from subassembly of the assembly to positive integer N is proposed,the judgment methods for the connectivity of a graph and geometrical feasibility of each decomposition combined with symbolic OBDD technique is proposed too,and all geometrically feasible assembly sequences are represented as OBDD-based AND/OR graph.Some applicable experiments show that the symbolic OBDD based algorithm can generate feasible assembly sequences correctly and completely.

关键词： assembly sequence planning automatic assembly planning unordered partition ordered binary decision diagram

作者: Zhoubo Xu Tianlong Gu Rongsheng Dong

作者单位: Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Technology,Guilin 541004,China

会议类型: 国际会议

会议名称: 7th IFIP TC 12 International Conference (第七届智能信息处理国际会议 (IIP 2012))

会议地点: 桂林

会议语种:英文

页码: 226-233

在线出版日期: 2012-10-12（万方平台首次上网日期，不代表论文的发表时间）