对拆卸与或图连通性判定算法的改进和研究  

Improvement of connectivity sieve algorithms for disassembly AND/OR graph

作　　者：陈海峰[1] 高建刚[1] 陆润民[1] 

机构地区：[1]清华大学机械工程学院精密仪器与机械学系,北京100084

出　　处：《计算机集成制造系统》2004年第7期838-842,共5页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(59935120)。~~

摘　　要：为加快拆卸与或图数据处理速度,减少连通性筛子的数据冗余,提出了一种对无效数据计算进行简化的方法。首先对与计算量有关的节点数、边数和图结构进行相关性分析,得到了计算量与它们之间的关系;然后以一定准则合并节点,对拆卸与或图进行预处理,使拆卸与或图的处理数据大大减少。通过对部分与或图图结构的计算,验证了该方法对数据处理的优化效果。To speed up Disassembly AND/OR Graph data disposal and reduce the data redundancy of Connectivity Sieve when planning the disassembly sequence in Design for Recycling (DFR), a method to simplify the useless data computation was proposed. The relativity among graph nodes, edges and structures was analyzed, thus the related computation quantity was verified. Then, the nodes were merged by some rules and Disassembly AND/OR Graph was pretreated so that the disposing data of Graph were reduced greatly. Through computing the AND/OR Graph structure partly, the data disposal is optimized.

关 键 词：与或图 数据结构 面向回收的设计 优化 

分 类 号：TH122[机械工程—机械设计及理论]