1) disassembly constraint graph
拆卸约束图
1.
To solve the problem,we explain the disassembly constraint graph(DCG) and then propose the adjacent point judgment method based on interference matrix.
针对拆卸序列规划过程中的可行拆卸序列遗漏问题,首先阐述了拆卸约束图(disassembly constraint graph,DCG)理论,提出了一种基于干涉矩阵的邻接点判断方法,结合拆卸约束图,建立拆卸模型,给出了生成产品所有可行拆卸序列的算法。
2) disassembly constraint
拆卸约束
1.
Analyzed the disassembly constraint information between common machine elements and standard connectors.
提出了一种基于联接件知识规则和几何推理相结合的自动生成拆卸约束方法。
3) additional disassembly constraints
附加拆卸约束
4) disassembly priority restriction matrix
拆卸优先约束矩阵
1.
So it is necessary to acquire the part disassembly priority restriction matrix from CAD model.
拆卸优先约束矩阵为建立产品的拆卸层次信息图模型提供了基础信息,保证了拆卸序列规划结果的正确性和有效性。
5) disassembly AND/OR graph
拆卸与或图
1.
DfD(design for disassembly)is a key part of environmentally conscious manufacturing for electr(on)ic products,and DAOG(disassembly AND/OR graph)is a kind of graph models used for disassembly process planning in DfD.
面向拆卸的设计是机电产品绿色制造系统中的重要组成部分,拆卸与或图是进行面向拆卸的设计时开展拆卸过程规划所需的一种模型。
2.
The research has resolved a key problem in automatic performance of the connectivity sieve, and promoted the automation level of constructing a disassembly model based on disassembly AND/OR graph for electromecha.
解决了连通性筛子自动执行中的关键问题 ,为机电产品基于拆卸与或图的拆卸建模的自动化提供了有力的支
3.
Several sieves are applied during the course of modeling of disassembly AND/OR graph, and the estimate of sieving rate is the precondition of reasonable sieving sequence.
拆卸与或图是拆卸模型中的一种,它的建模过程需要利用多重筛子进行筛选,筛选率的估计是合理安排筛选顺序的前提。
6) disassembly hybrid graph
拆卸混合图
1.
To solve product disassembly sequence planning problem efficiently,Product disassembly hybrid graph model,which describes the mating contact and non-contact priority relationships among constituting components,is established based on the characteristic of disassembly.
为了能以较高的效率求解出产品拆卸序列的方案,本文首先根据拆卸特点构建了产品拆卸混合图模型。
2.
To solve the product SDSP problem efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristics of disassembly.
为了能以较高的效率求解出产品拆卸序列的方案,首先根据拆卸特点构建了产品拆卸混合图模型。
3.
To solve product disassembly sequence planning problem efficiently,product disassembly hybrid graph model,which described the connection,non-connection and precedence relationships between the product parts,was established based on the characteristics of disassembly.
为了能以较高的效率求解出产品拆卸序列的方案,首先,根据拆卸特点构建了产品拆卸混合图模型,该模型描述了零部件之间的连接关系和优先关系。
补充资料：图的减缩图(或称图子式)
图的减缩图(或称图子式)
minor of a graph
图的减缩图(或称图子式)【.皿以ofa脚户;MHHoPrpa中a」【补注】设G是一个图(graph)(可以有环及多重边).G的一个减缩图(nullor)是从G中接连进行下述运算而得的任何一个图: i)删去一条边; 五)收缩一条边; 说)去掉一个孤立顶点. NRobe由on与P.D.Se脚aour的图减缩定理(脚Ph nl的。r theon习11)如下所述:已知有限图的无穷序列G，，GZ，…，则存在指标i
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条