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

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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01524943
Contributor : Hal Ifip <>
Submitted on : Friday, May 19, 2017 - 10:43:07 AM
Last modification on : Friday, May 19, 2017 - 10:45:57 AM
Document(s) archivé(s) le : Tuesday, August 22, 2017 - 10:51:26 AM

File

978-3-642-32891-6_29_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Zhoubo Xu, Tianlong Gu, Rongsheng Dong. Symbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.226-233, ⟨10.1007/978-3-642-32891-6_29⟩. ⟨hal-01524943⟩

Share

Metrics

Record views

37

Files downloads

24