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.
assembly sequence assembly knowledge Zero-suppressed binary decision diagram
Fengying Li Tianlong Gu Guoyong Cai Liang Chang
Guangxi Key Laboratory of Trusted Software,Guilin University of Electronic Technology,Guilin 541004,China
国际会议
7th IFIP TC 12 International Conference (第七届智能信息处理国际会议 (IIP 2012))
桂林
英文
208-215
2012-10-12(万方平台首次上网日期,不代表论文的发表时间)