基于蚁群算法的机构同构判定的研究  

An Algorithm for Mechanism Isomorphism Identification Based on Ant Colony Algorithm

作　　者：王静平[1] 李俊萍[1] 

机构地区：[1]安徽工程科技学院 先进数控和伺服驱动技术安徽省重点实验室,芜湖241000

出　　处：《机械科学与技术》2010年第8期1112-1115,1120,共5页Mechanical Science and Technology for Aerospace Engineering

基　　金：国家特色专业建设点机械设计制造及其自动化项目(TS10310);安徽工程科技学院青年基金项目(2008yq034)资助

摘　　要：针对传统的机构同构判定算法难以提供理想的求解结果的情况,笔者根据机构运动链的特性,将机构同构判定问题转化为一个可降次的旅行商问题(TSP问题),大大的降低了问题求解的难度,接着建立TSP问题的模型,然后应用提出的蚁群算法去求解这类机构同构判定问题,最后应用实例证明了该算法的有效性。Existing algorithms for mechanism isomorphism identification algorithm is not satisfactory. In this paper, according to the features of mechanism kinematic chains,the mechanism isomorphism identification problem is translated into an Traveling Salesman Problem （ TSP） . In this way,the problem＇s dimension is decreased. Then, we build the model. Finally,we proposed an improved ant colony algorithm for solving the problem. A case study is provided to demonstrate the preliminary success of the algorithm. Compared with the existing algorithms,our algorithm is easier to realize,and has very obvious advantage in solving large-scale mechanism isomorphism problem.

关 键 词：机构同构 运动链 蚁群算法 

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