Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
References
De Fazio, T.L., Whitney, D.E.: Simplified generation of all mechanical assembly sequences. IEEE Journal of Robotics and Automation 3(6), 640–658 (1987)
Homen de Mello, L.S., Sanderson, A.C.: A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Transactions on Robotics and Automaition 7(2), 228–240 (1991)
Wang, J.F., Liu, J.H., Zhong, Y.F.: A novel ant colony algorithm for assembly sequence planning. International Journal of Advanced Manufacturing Technology 25(11), 1137–1143 (2005)
Bryant, R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surverys 24(3), 293–318 (1992)
Burch, J., Clarke, E., Mcmillan, K., et al.: Symbolic model checking:1020 states and beyond. Information and Computation 98(2), 142–170 (1998)
Gu, T.L., Xu, Z.B., Yang, Z.F.: Symbolic OBDD representations for mechanical assembly sequences. Computer-Aided Design 40(4), 411–421 (2008)
Gu, T.L., Liu, H.D.: The symoblic OBDD scheme for generating mechanical assembly sequences. Formal Methods in System Design 33(1/3), 29–44 (2008)
Xu, Z.B., Gu, T.L.: A constraint satisfaction problem model and its symbolic OBDD solving for assembly sequence planning problem. Journal of Computer-Aided Design & Computer Graphics 22(5), 803–810 (2010)
Gottipolu, R.B., Ghosh, K.: A simplified and efficient representation for evaluation and selection of assembly sequences. Computer in Industry 50(3), 251–264 (2003)
Cudd, S.F.: CU decision diagram package release 2.3.1, http://vlsi.Colorado.edu/fabio/CUDD/cuddIntro.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Xu, Z., Gu, T., Dong, R. (2012). Symbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer. In: Shi, Z., Leake, D., Vadera, S. (eds) Intelligent Information Processing VI. IIP 2012. IFIP Advances in Information and Communication Technology, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32891-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-32891-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32890-9
Online ISBN: 978-3-642-32891-6
eBook Packages: Computer ScienceComputer Science (R0)