摘要
为构造机电产品拆卸与或图模型,需对拆卸与或图进行连通性筛选。在图论、二值布尔代数和组合学的基础上,利用图及其导出子图、布尔矩阵、布尔向量、组合等工具,提出了部件顶点连通性判定定理和连通部件顶点构造定理,并给出了连通性筛子顶点筛选率的上限与下限。通过连通性筛选,剔除了拆卸与或图中的不合理部件顶点,并使顶点数量得到有效削减。连通性筛子顶点筛选率的限值为合理安排所有筛子的筛选顺序提供了基础。
Construction of a disassembly andor graph for an electromechanical product requires sieving of the graph according to part connectivities in the product. Judgement and construction theorems of connected subassembly vertices were developed based on graph theory, Boolein vector combinations in graph theory, and combinatorics. The theorems were used to estimate the upper and lower limits of the connectivity sieve rate. The connectivity sieve was used to delete illogical vertices from the disassembly andor graph, which reduced the number of vertices. The limits provide a basis for finding the best application sequence for all sieves.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2003年第8期1045-1048,共4页
Journal of Tsinghua University(Science and Technology)
基金
国家自然科学基金重点项目(59935120)
国家"八六三"高技术项目(2002AA421240)
关键词
机械设计
回收性拆卸
维修性拆卸
拆卸规划
拆卸与或图
连通性筛子
导出子图
mechanical design
disassembly for recycling
disassembly for maintenance
disassembly planning
disassembly and-or graph
connectivity sieve
