• CN:11-2187/TH
  • ISSN:0577-6686

机械工程学报 ›› 2019, Vol. 55 ›› Issue (17): 185-199.doi: 10.3901/JME.2019.17.185

• 数字化设计与制造 • 上一篇    下一篇

扫码分享

基于最大公共子图挖掘和装夹性能分析的夹具耦合设计方法

秦国华1, 邱剑鹏1, 王华敏1,2, 吴铁军3   

  1. 1. 南昌航空大学航空制造工程学院 南昌 330063;
    2. 南京航空航天大学机电学院 南京 210016;
    3. 东莞职业技术学院机电工程系 东莞 523808
  • 收稿日期:2018-09-10 修回日期:2019-05-31 出版日期:2019-09-05 发布日期:2020-01-07
  • 通讯作者: 王华敏(通信作者),女,1988年出生,博士研究生。主要研究方向为复杂工件装夹布局分析与规划、切削加工变形预测与力学分析等。E-mail:910291556@qq.com
  • 作者简介:秦国华,男,1970年出生,博士,教授,博士后。主要研究方向为工件装夹分析与优化、加工过程力学分析与仿真、残余应力分析与预测、健康管理与故障诊断等。E-mail:qghwzx@126.com
  • 基金资助:
    国家自然科学基金(51465045,51765047)、江西省主要学科学术和技术带头人资助计划(20172BCB22013)、航空科学基金(2016ZE56011)、广东省教育厅特色创新类项目(2017GKTSCX102)、江西省教育厅科技项目(GJJ170572)和南昌市科技重大(2018-ZDKJGG-010)资助项目。

Couple Approach to Fixture Design Based on Maximum Common Subgraph Mining and Fixturing Performance Analysis

QIN Guohua1, QIU Jianpeng1, WANG Huamin1,2, WU Tiejun3   

  1. 1. School of Aeronautical Manufacturing Engineering, Nanchang Hangkong University, Nanchang 330063;
    2. College of Mechanical & Electrical Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016;
    3. Department of Mechanical and Electrical Engineering, Dongguan Polytechni, Dongguan 523808
  • Received:2018-09-10 Revised:2019-05-31 Online:2019-09-05 Published:2020-01-07

摘要: 大量的夹具案例积累了可重用的经验和知识,为新零件实现夹具设计提供了理论基础和决策参考,而准确的夹具检索和合理的装夹判断是成功完成夹具设计的核心与关键。为此,根据零件B-rep表示的实体模型,通过特征之间的几何拓扑关系构造零件的标号图。结合标号图的线性顺序性,提出了标定索引值的DFS词典序原则,建立了最小DFS编码的遍历方法。其次,在挖掘出零件最小DFS编码的基础上,依据边编码中特征值、属性值及特征之间的连接关系,提出零件之间最大公共子图的挖掘方法,通过定义零件相似度和库相似度两个概念,构造出相似夹具检索和排序的决策因子。最后,通过建立定位确定性和装夹稳定性分析算法,依据决策因子大小逐一评估夹具对新零件的合理装夹,直至通过装夹性能的检验,完成夹具的设计过程。由于与零件一一对应的最小DFS编码,其搜索方法为图论中用递归容易实现的经典算法,而装夹性能评估只涉及点的坐标和法矢量信息,则属于可编程实现的离散型问题,故提出的"先检索排序夹具,后验证装夹性能"的夹具耦合设计方法,不仅能丰富和拓展计算机辅助夹具设计方法和理论,而且还将大大促进计算机辅助夹具设计系统的实用性。

关键词: 最小DFS编码, 最大公共子图, 挖掘算法, 决策因子, 装夹性能

Abstract: A numerous of fixture cases, which accumulate reusable experience and knowledge, can supply the theoretical basis and decision criterion for fixture design of a new workpiece. However, the accurate search of similar fixtures from fixture cases is key to the achievement of fixture design, in addition that the searched fixtures can successfully grasp the new workpiece. Therefore, based on the entity B-Rep (i.e., Boundary Representation) model of a workpiece, the labeled graph of a workpiece is constructed according to the geometrical and topological relationships between features. In combination with the linear sequence of labeled graph, the principles of the DFS dictionary sequence, which can calibrate the index value for an arbitrary feature, are proposed to traversal the minimum DFS code. Again, based on the minimum DFS code, the mining method of maximum common subgraph is suggested for workpieces according to the feature value, performance value and link relationship between features. Furthermore, two concepts on the workpiece similarity and library similarity are defined to formulize the decision factor for the sequence of the searched fixtures. The final step is to formulize the locating determination and the fixturing stability so that the searched fixtures are one by one evaluated the fixturing performance for a new workpiece. the design process of fixture is over when and only when a fixture achieves the good fixturing performance. In fact, the minimum DFS code and a workpiece can hold a unique one to one relationship. The search method of DFS code, which is classic algorithm in graph theory, can be easily realized by the recursion method. On other hand, the fixturing performance evaluation only concern on the coordinates and the corresponding normal vectors. It belongs to the programmed discretization problem. So the presented "it is crucial for the searched fixture to satisfy the fixturing performance" method is not only well enrich the theory of computer aided fixture design, but greatly accelerate its practicability.

Key words: minimum DFS code, maximum common subgraph, mining algorithm, decision factor, fixturing performance

中图分类号: