Symbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer - Intelligent Information Processing VI Access content directly
Conference Papers Year : 2012

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

Zhoubo Xu
  • Function : Author
  • PersonId : 990791
Tianlong Gu
  • Function : Author
  • PersonId : 990789
Rongsheng Dong
  • Function : Author
  • PersonId : 1008460

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.
Fichier principal
Vignette du fichier
978-3-642-32891-6_29_Chapter.pdf (170.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524943 , version 1 (19-05-2017)

Licence

Attribution

Identifiers

Cite

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⟩
37 View
66 Download

Altmetric

Share

Gmail Facebook X LinkedIn More