检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《舰船电子工程》2011年第7期148-150,180,共4页Ship Electronic Engineering
摘 要:为解决拆卸序列规划理论算法存在的求解空间过大的问题,提出一种基于干涉矩阵的规划算法。该算法用干涉矩阵和干涉图来表现装配体零部件间的约束关系,通过对干涉矩阵的分析处理,简化干涉图,生成拆卸序列,达到了缩减求解空间的目的,保证了算法同工程实际的一致性,提高了实际应用和软件编程的能力。To solve the problem of much bigger solution space existing in the theoretic disassembly sequence planning (DSP) algorithm, an approach based on interference matrix to generate the disassembly sequence is put forward. According to this algorithm, by using interference matrix and interference chart, the assembly restrictions status is manifested. Disassembly sequence is generated, by analyzing and dealing with interference matrix, interference graph is predigested and disassembly sequence is generated finally, so that the solution space is reduced. The algorithm ensures the consistence with the actual engineering situation, and the practicability and programmable capacity are greatly improved.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.74