2012 | OriginalPaper | Chapter
Symbolic ZBDD Representations for Mechanical Assembly Sequences
Authors : Fengying Li, Tianlong Gu, Guoyong Cai, Liang Chang
Published in: Intelligent Information Processing VI
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The representations of assembly knowledge and assembly sequences are crucial in assembly planning, where the size of parts involved is a significant and often prohibitive difficulty. Zero-suppressed binary decision diagram (ZBDD) is an efficient form to represent and manipulate the sets of combination, and appears to give improved results for large-scale combinatorial optimization problems. In this paper, liaison graphs, translation functions, assembly states and assembly tasks are represented as sets of combinations, and the symbolic ZBDD representation of assembly sequences is proposed. An example is given to show the feasibility of the ZBDD-based representation scheme.