欢迎访问《兵工学报》官方网站,今天是

兵工学报 ›› 2005, Vol. 26 ›› Issue (6): 733-737.

• 论文 • 上一篇    下一篇

抗干扰齿轮集机构的优化编码方法

高杨   

  1. 中国工程物理研究院电子工程研究所,四川绵阳621900
  • 收稿日期:2004-11-10 上线日期:2014-12-25
  • 通讯作者: 高杨

Optimized Coding of Counter-meshing Gears Mechanism

GAO Yang   

  1. Institute of electronic Engineering, China Academy of Engineering Physics, Mianyang, Sichuan 621900,China
  • Received:2004-11-10 Online:2014-12-25
  • Contact: GAO Yang

摘要: 建立了抗干涉齿轮集( counter-meshing gears,CMG)机构编码的基本概念,提出了基于迷宫映射的图论设计方法,物理概念清晰、简洁易用。采用迷宫映射方法和“关键阱格点”互斥的“十字叉”判据,将CMG机构的编码问题转换为图论中顶点着色问题,揭示了这种锁机构的组合数学原理。对于导出的图G(V,E),其顶点集V(G)按色数X(G)着色,可得到CMG机构的优化编码,即复合齿轮的齿轮层数最少。

关键词: 机械学 , 机构设计 , 组合锁 , 迷宫 , 图论 , 顶点着色问题

Abstract: Counter-meshmg gears (CMG) mechanism is a coding and discrimination mechanism, which can be used for safety and arming applications. Essential concept of CMG mechanism coding was presented, and the coding method based on maze mapping and graph theory was given, which is simple, clear and easy to use. With the maze mapping method and the orthogonal mutually exclusive criterion of the critical trap grids, the optimized coding problem ot しMG mechanism is transformed into that of vertex coloring problem in graph theory. It is re?vealed that the working principle of the lock mechanism is combinatorics. Vertex set V(G) of the derived graph G( V, E) can be colored with X(G) colors,and finally an optimized CMG mechanism coding result was ob?tained, 1. e., with the minimal composite gear levels.

Key words: mechanics , mechanical design , combination lock , maze , graph theory , vertex coloring problem

中图分类号: