Computer Science ›› 2016, Vol. 43 ›› Issue (6): 28-31, 49.doi: 10.11896/j.issn.1002-137X.2016.06.005

Previous Articles     Next Articles

Symbolic ZBDD-based Judgment Method for Assembly Feasibility

PENG Rui, LI Feng-ying, CHANG Liang and MENG Yu   

  • Online:2018-12-01 Published:2018-12-01

Abstract: To enlarge the solution scale and improve the efficiency of assembly sequence planning the level of assembly automation,zero-suppressed binary decision diagram(ZBDD) was proposed to represent assembly connection matrix and interference matrix.A novel ZBDD-based method was presented to judge the feasibility of assembly operation,thereby feasible assembly operations of an assembly can be obtained efficiently.The experimental results demonstrate the validity and feasibility of ZBDD-based assembly model and judgment method for feasible assembly operation.

Key words: Assembly feasibility,Assembly connection matrix,Assembly interference matrix,Zero-suppressed binary decision diagram

[1] Molloy E,Yang H,Browne J.Feature-based Modeling in Design for Assembly [J].International Journal of Computer Integrated Manufacturing,1993,6(12):119-125
[2] Wang Jun-feng,Li Shi-qi,Liu Ji-hong,et al.Computer AidedAssembly Planning:a Survey [J].Journal of Engineering Graphics,2005,26(2):1-6(in Chinese) 王俊峰,李世其,刘继红,等.计算机辅助装配规划研究综述 [J].工程图学学报,2005,26(2):1-6
[3] Uma R N,Wein J,Williamson D P.On the Relationship between Combinatorial and LP-Based Lower Bounds for NP-hard Sch-eduling Problems [J].Theoretical Computer Science,2006,361(2):241-256
[4] Fazio D T,Whitney D E.Simplified Generation of All Mechanical Assembly Sequences [J].IEEE Journal Robotics and Automation,1987,3(6):640-658
[5] de Mello L S H,Sanderson A C.A Correct and Complete Algorithm for Mechanical Assembly Sequences [J].IEEE Transaction on Robotics and Automation,1991,7(2):228-240
[6] Bryant R E.Symbolic Boolean Manipulation with Ordered Binary Decision Diagram [J].ACM Computing Surverys,1992,24(3):293-318
[7] Xu Zhou-bo,Gu Tian-long,Zhao Ling-zhong.A Novel Symbolic ADD Algorithm for Maximum Flow in Networks [J].Journal on Communications,2005,26(2):1-8(in Chinese) 徐周波,古天龙,赵岭忠.网络最大流问题的一种新的符号ADD求解算法 [J].通信学报,2005,26(2):1-8
[8] Luiz S,Homen D M,Sanderson A C.AND/OR Graph Representation of Assembly Plans [J].IEEE Transactions on Robo-tics and Automation,1990,6(2):188-198
[9] Gu Tian-long,Liu Hua-dong.Symbolic OBDD-based techniquefor generating assembly sequences [J].Computer Integrated Manufacturing Systems,2008,14(2):321-328(in Chinese) 古天龙,刘华东.基于符号有序二叉决策图的装配序列生成技术 [J].计算机集成制造系统,2008,14(2):321-328
[10] Minato S.Zero-suppressed BDDs and Their Applications [J].International Journal on Software Tools for Technology Transfer,2001,3(2):156-170
[11] Li Feng-ying,Gu Tian-long,Chang Liang,et al.Timed Petri and ZBDD Based Approach for Assembly Sequence Planning [J].Computer Science,2012,39(2):170-174(in Chinese) 李凤英,古天龙,常亮,等.一种基于赋时Petri网和ZBDD的装配序列规划方法 [J].计算机科学,2012,39(2):170-174
[12] Gu Tian-long,Xu Zhou-bo,Yang Zhi-fei.Symbolic OBDD Representations for Mechanical Assembly Sequences [J].Computer-Aided Design,2008,40(4):411-421
[13] Hu Min,Wang Yan-wei,Nie Bin,et al.Assembly SequencePlanning Based on Contact-Relation Analysis [J].Journal of Computer-Aided Design & Computer Graphics,2014,26(8):1374-1384(in Chinese) 胡敏,王彦伟,聂斌,等.基于接触关系分析的装配序列规划 [J].计算机辅助设计与图形学学报,2014,26(8):1374-1384
[14] Homem D E,Mello L S,Sanderson A C.Representation of Mechanical Assembly Sequence [J].IEEE Transactions on Robo-tics and Automation,1991,7(2):211-227
[15] Gottipolu R B,Ghost K.A Simplified and Efficient Representation for Evaluation and Selection of Assembly Sequences [J].Computer in Industry,2003,50(2):251-264
[16] Gottipolu R B,Ghosh K.An Integrated Approach to the Gene-ration of Assembly Sequences [J].International Journal of Computer Application in Technology,1995,8(3):125-138

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .