Symbolic ZBDD Representations for Mechanical Assembly Sequences
نویسندگان
چکیده
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.
منابع مشابه
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi-linear functions (MLFs) based on Zero-suppressed BDDs (ZBDDs), which are the graph-based representation of combinatorial item sets. Our method is different from the original approach of Darwiche et. al which encodes B...
متن کاملRepresentations of Assembly Sequences
This paper analyses four representations for assembly sequences which are based on directed graphs, on AND/OR graphs, on establishment conditions, and on precedence relationships. The latter includes two types: precedence relationships between the establishment of one connection between parts and the establishment of another connection, and precedence relatioships between the establishment of o...
متن کاملCompiling Bayesian Networks by Symbolic Probability Calculation Using Zero-suppressed BDDs
(Abstract) Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi-linear functions (MLFs) based on Zero-suppressed BDDs (ZBDDs), which are the graph-based representation of combinatorial item sets. Our method is different from the original approach of Darwiche et. al whic...
متن کاملA temporal framework for assembly sequence representation and analysis
AbstructA unifying temporal logic framework is proposed for modelling, specifying, and analyzing mechanical assembly sequences. Propositional temporal logic of Manna and Pneuli is the assertion language used for representing and analyzing all constraints or conditions that assembly sequences must satisfy. The generalization of the existing representations through the proposed framework is demon...
متن کاملClustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کامل