Variety and connectivity in kinematic chains. (English) Zbl 1206.70006
Summary: The enumeration of kinematic chains, also known as number synthesis, has been used for at least the past four decades as a means of finding better mechanisms for some predefined purpose. In practice, however, enumeration can be difficult to implement since the number of kinematic chains generated is often too large to manually consider the individual merits of each chain. For this reason, the concepts of variety and connectivity can be used to classify kinematic chains according to the constraints required as described in the literature. In this regard, this paper presents three new results. First, a redefinition of the concepts of variety and connectivity in an algorithmic form is introduced. Second, a set of important relations between connectivity and variety, introduced by C. R. Tischler, A. E. Samuel and K. H. Hunt [Mech. Mach. Theory 30, No. 8, 1217–1239 (1995)] as conjectures lacking formal proofs, are stated as theorems in this paper and formally proved. Finally, a new algorithm is proposed for the computation of the variety of a kinematic chain; this algorithm includes other parameters such as connectivity and redundancy.
MSC:
| 70B15 | Kinematics of mechanisms and robots |
References:
| [1] | Davies, T. H.; Crossley, F. E.: Structural analysis of plane linkages by franke’s condensed notation, Journal of mechanisms 1, 171-183 (1966) |
| [2] | Tischler, C. R.; Samuel, A. E.; Hunt, K. H.: Kinematic chains for robot hands: part 2 kinematic constraints, classification, connectivity, and actuation, Mechanism and machine theory 30, No. 8, 1217-1239 (1995) |
| [3] | Tischler, C. R.; Samuel, A. E.; Hunt, K. H.: Dextrous robot fingers with desirable kinematic forms, International journal of robotics research 17, 996-1012 (1998) |
| [4] | Tischler, C.; Samuel, A.; Hunt, K.: Selecting multi-freedom multi-loop kinematic chains to suit a given task, Mechanism and machine theory 36, No. 8, 925-938 (2001) · Zbl 1140.70364 · doi:10.1016/S0094-114X(01)00026-X |
| [5] | Belfiore, N. P.; Benedetto, A. D.: Connectivity and redundancy in spatial robots, The international journal of robotics research 19, No. 12, 1245-1261 (2000) |
| [6] | A. Piga Carboni, D. Martins, Redundancy and connectivity in kinematic chains, Journal of Mechanical Design, submitted for publication. · Zbl 1206.70006 |
| [7] | Hunt, K. H.: Kinematic geometry of mechanisms, (1978) · Zbl 0401.70001 |
| [8] | Phillips, J.: Freedom in machinery, Freedom in machinery 1 (1984) |
| [9] | Tsai, L. -W.: Mechanism design: enumeration of kinematic structures according to function, (2001) |
| [10] | Manber, U.: Introduction to algorithms: A creative approach, (1989) · Zbl 0825.68397 |
| [11] | Shoham, M.; Roth, B.: Connectivity in open and closed loop robotic mechanisms, Mechanism and machine theory 32, No. 3, 279-293 (1997) |
| [12] | Liberati, A.; Belfiore, N. P.: A method for the identification of the connectivity in multi-loop kinematic chains: analysis of chains with total and partial mobility, Mechanism and machine theory 41, 1443-1466 (2006) · Zbl 1102.70002 · doi:10.1016/j.mechmachtheory.2006.01.015 |
| [13] | Mruthyunjaya, T. S.; Raghavan, M. R.: Computer-aided analysis of the structure of kinematic chains, Mechanism and machine theory 19, No. 3, 357-368 (1984) |
| [14] | Manolescu, N. I.: A unified method for the formation of all planar joined kinematic chains and baranov trusses, Environment and planning B 6, 447-454 (1979) |
| [15] | Seshu, S.; Reed, M. B.: Linear graphs and electrical networks, (1961) · Zbl 0102.34001 |
| [16] | Liu, H.; Wang, J.: A new way to enumerate cycles in graph, Proceedings of the advanced international conference on telecommunications and international conference on Internet and web applications and services, 57-59 (2006) |
| [17] | Johnson, D.: Find all the elementary circuits of a directed graph, J. SIAM 4, 77-84 (1975) · Zbl 0275.05112 · doi:10.1137/0204007 |
| [18] | Gibbs, N.: A cycle generation algorithm for finite undirected linear graphs, Journal of the ACM (JACM) 16, No. 4, 564-568 (1969) · Zbl 0191.22801 · doi:10.1145/321541.321545 |
| [19] | Honkanen, P.: Circuit enumeration in an undirected graph, Proceedings of the 16th annual southeast regional conference, 49-53 (1978) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
