Affiliation:
1. CAD Center, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, People’s Republic of China
Abstract
This paper presents a new method to isomorphism identification based on two novel evolutionary approaches—ant algorithm (AA) and artificial immune system (AIS). Salient features of the two evolutionary approaches are their efficient, robust and general-purpose algorithms for isomorphism identification despite its nondeterministic polynomial (NP) hard nature. First, based on the rearrangement of the vertexes in kinematic chains, the isomorphism identification of kinematic chains is transformed into a degree-reducible traveling salesman problem (TSP), so that the dimension and complexity can be largely decreased. Then AA and AIS algorithms are adopted to solve the transformed TSP. At last, characteristics of the two evolutionary approaches are discussed based on case studies.
Subject
Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications,Software
Reference22 articles.
1. Zhang, W. J., 1991, “An Object-Oriented Mechanism Definition and Description With a Genetic Mechanism Model,” Technical Report No. BM-1.91, TU Delft, The Netherlands.
2. Zhang, W. J., and Breteler, A. J., 1996, “An Approach to Mechanism Topology Identification With Consideration of Design Progression,” J. Mech. Eng. Sci., 211(3), pp. 175–183.
3. Shin, J. K., and Krishnamurty, S., 1994, “On Identification and Canonical Numbering of Pin-Jointed Kinematic Chains,” ASME J. Mech. Des., 116(1), pp. 182–188.
4. Kobler, J., Schoning, U. J., and Toran, J., 1993, The Graph Isomorphism Problems: Its Structural Complexity, Birkhauser, Boston.
5. Tischler, C. R., Samual, A. E., and Hunt, K. H., 1995, “Kinematic Chain for Robot Hands—1. Orderly Number-Synthesis,” Mech. Mach. Theory, 30(8), pp. 1193–1215.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献