基于球面映射和拆卸树的拆卸序列生成算法  

Disassembly sequence generation algorithm based on spherical map and disassembly tree

作　　者：曹建康[1] 张秀山[1] 

机构地区：[1]海军工程大学电子工程学院,武汉430033

出　　处：《海军工程大学学报》2010年第1期72-77,82,共7页Journal of Naval University of Engineering

基　　金：国家部委基金资助项目(060251327033)

摘　　要：拆卸序列生成是虚拟维修的核心之一,直接关系到虚拟维修的可行性及成本。搜索所有可行拆卸序列、避免组合爆炸并保持算法的通用性是序列生成算法的研究难点。通过引入球面映射概念,定义了局部和全局阻碍方向及可拆卸方向,克服了传统方法中基于六坐标轴方向创建干涉矩阵的局限性。提出了一种符合拆卸规则和拆卸关系表的拆卸树生成算法,求得所有可行的拆卸序列,并通过实例在虚拟维修平台上得到了实现。Disassembly sequence generation is vital for virtual maintenance, which is directly related to the feasibility and the cost of virtual maintenance. Searching all feasible disassembly sequences, avoiding the explosion of combination and maintaining the generality of algorithm are difficult points in research as far as disassembly sequence generating algorithm is concerned. By introducing the concept of spherical map, defining partial blocking direction, full blocking direction and disassembly direction, a disassembly tree generation algorithm, which overcomes the limitation interference matrix based on six coordinates and follows disassembly rules and disassembly relation list, was presented. All feasible disassembly sequences were generated from this algorithm, and were implemented on the virtual reality maintaining platform （VRMP） through some virtual disassembly examples.

关 键 词：虚拟维修 球面映射 拆卸树 拆卸序列 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]