Thesis Structural Analysis of Planar Mechanisms Using Graph Theory
Thesis Structural Analysis of Planar Mechanisms Using Graph Theory
GRAPH THEORY
A DISSERTATION
MASTER OF TECHNOLOGY
IN
By
Gaurav Grover
(Roll No. 211394)
(Session 2011-2013)
declare that I owe full responsibility for the information, results, conclusion,
To the best of my knowledge, this dissertation report has not been submitted
in part or full elsewhere in any other University or Institution for the award of
any degree. It is further understood that by this certificate the undersigned do
not endorse or approve any statement made, opinion expressed or conclusion
drawn therein but approve the dissertation report only for the purpose for
which it is submitted.
(Prof. V.P.Singh) ~^
Associate Professor
Department of Mechanical Engineering
National Institute of Technology,
Kurukshetra, Haryana -136119
ACKNOWLEDGEMENT
III
CONTENTS:
CANDIDATE'S DECLARATION
CERTIFICATE
ACKNOWLEDGEMENT II
CONTENTS: V
CHAPTER: 1 INTRODUCTION
1.1 INTRODUCTION 1
1.2 OBJECTIVE OF PRESENT WORK 3
1.3 LITERATURE REVIEW 3
2.1 INTRODUCTION 10
2.2 MATRIX REPRESENTATION 13
2.3 COMPUTATION OF CHARACTERISTIC POLYNOMIAL 13
2.4 MATRIX NOTATION FOR AUTOMOBILE WINDOW GUIDANCE 18
2.5 TEST FOR ISOMORPHISM 22
2.6 DEGREE OF FREEDOM 29
2.6.1 TEST FOR FRACTIONATED DEGREE OF FREEDOM 29
2.6.2 TEST FOR PARTIAL FREEDOM 31
3.1 INTRODUCTION 33
3.2 MATRIX REPRESENTATION 35
3.3 MATRIX NOTATION FOR WALSCAERT'S MECHANISM 43
3.4 DEGREE OF FREEDOM 50
3.4.1 TEST FOR FRACTIONATED FREEDOM 50
3.4.2 TEST FOR PARTIAL FREEDOM 52
4.1 INTRODUCTION 53
IV
4.2 MATRIX REPRESENTATION 55
4.3 MATRIX NOTATION FOR PEAUCELLIER MECHANISM 60
4.3 DEGREE OF FREEDOM 65
4.3.1 TEST FOR FRACTIONATED FREEDOM 65
4.3.2 TEST FOR PARTIAL FREEDOM 66
INTRODUCTION
1.1 INTRODUCTION
(1) A critical examination, in the light of finding available in graph theory of the
use of the characteristic polynomial of the matrix associated with the kinematic
chain for detecting isomorphism.
(2) A simple method for the characteristic co-efficient of the matrix of the
Chain which reveals the physical significance of these co-efficient and thus leads
to a possible way of determining these co-efficient by an inspection of the chain
also.
(3) A matrix notation which permits one to derive and distinguish all possible
mechanisms from kinematic chains.
(4) Algebraic tests based on graph theory for determining whether a kinematic
chain possesses total, partial or fractionated degree of freedom.
2. Fei Yang, Zongquan Deng, Jianguo Tao, Lifang Li presented a new method
used incident matrices to Identify the isomorphism of topological graphs was
proposed in this paper. The technique of acquiring the necessary condition for
identifying the Isomorphism was developed by comparing the calculation of
incident matrices. Furthermore, it could automatically executed by programs.
With the help of the results from the necessary condition, the technique to find
the correspondence of different vertices was presented, and the sufficiency for
the isomorphism Identification was obtained. Three examples were presented to
demonstrate the validity and reliability of that method.
4. Mr. Chaudhari Ashok the work presented here was focused on the type
of freedom of simple jointed planar Kinematic chains. The type of freedom of
forty 9 links, 2-dof were found from the Hamming method. The Hamming number
was computed by using the direct method of writing the hamming matrix, which
save time and effort. Link Hamming string which was defined as the string
obtained by concatenating the link Hamming number and the frequency of
individual hamming numbers in that row was then formed. Finally, chain
hamming string defined as the string obtained by the concatenation of the chain
hamming number and the link Hamming strings in descending order was formed.
Type of freedom of multi-d.o.f. chain could found by used hamming matrix. A
multi d.o.f. could posse's full, partial or fractionated freedom. Full freedom and
partial freedom matrix were also derived to find out the type of freedom. Type of
freedom would was help full during the synthesis of multi degree of freedom
kinematic chains. C++ program was prepared to find out full freedom matrix,
partial freedom matrix and type of freedom of the chains.
5. Ashok Dargar, All Hasan, R. A. Khan presented the simple and efficient
method was proposed to identify whether a kinematic chain posses total, partial
or fractionated mobility. The proposed method used the chain flow values (CFV)
derived from the flow matrix of the given kinematic chain and successfully applied
to all known cases of 2 and 3 degree of freedom planar kinematic chains. Since
the method was systematic and efficient, it could apply to the more complex
chains which not had been reported in the literature yet. This study would be
helpful in divided the frame and input links from the view point of mobility. Some
examples were provided to demonstrate the effectiveness of this method.
6. Huafeng Ding, Jing Zhao, Zhen Huang presented the structural synthesis
theory for the variety of kinematic chains, rather than varied methods for varied
kinds of kinematic chains, was much more convenient for both the study of the
mechanism theory and its applications. This paper proposes a novel structural
synthesis method for kinematic chains with multiple joints which was derived
from the well developed structural synthesis theory of simple joint kinematic
chains and theirs atlas database technique [H.F. Ding, Z. Huang, Mech. Mach.
Theory 2007 42(6) 637-651]. First, a novel topological graph, namely the new
bicolor topological graph, for the representation of the multiple joint kinematic
chain was presented, which was derived from the topological graph of the simple
jo'mt kinematic chain. Then the structural synthesis method of multiple joint
kinematic chains based on the new bicolor topological graph was presented. One
of the merits of the method was that it unifies the structural synthesis of simple
joint kinematic chains with multiple joint kinematic chains. In addition,
isomorphism identification, one of the most difficult problems in structural
synthesis, becomes unnecessary with this synthesis method. Finally, all multiple
joint kinematic chains with several specific numbers of links, degrees-of-freedom,
and numbers of multiple joints were synthesized in batch as examples to show
the effectiveness of the method.
13. W.G. Green presented the walschaert's radial valve gear. He was given
the knowledge of the diagram of the particular gear mechanisms.
2.1 INTRODUaiON
There are three types of common mechanical devices that can be used as basic
element of a mechanism:
(c) Plane and spatial linkages are useful increasing mechanical motion for
a points or rigid body.
10
A rigid body mechanism is used to guide a rigid body in a series of
prescribed positions in space.
H^idle
11
«-<->
•//•7.
'^ y ^ '^ \
^ 'W^
.^v'.'y
6 i^
12
2.2 MATRIX REPRESENTATION:
( i ;* j ) = 0, otherwise
0 1 0 1 1 0 0
1 0 1 0 0 0 0
[A] = 0 1 0 1 0 0 1
1 0 1 0 1 1 0
1 0 0 1 0 0 0
0 0 0 1 0 0 1
0 0 1 0 0 1 0
It is clear that A is also the vertex - vertex incidence matrix of the graph
of kinematic chain. In fact the usefulness of the matrix of the kinematic chain in
determining its structural characteristics is entirely due to this fact. In the
literature on graph theory this matrix is usually termed the adjacency matrix of
the graph.
13
the kinematic chains the calculation the basic of well known results of graph
theory, involved in this method are very simple and well suited for hand
computation. An additional advantage is that the Bocher's formulae when
interpreted on the basic of well known results of graph when interpreted on the
basic of well known results of graph theory reveal the physical meaning of the
characteristic coefficients and thus lead to a possible way of arriving at these co-
efficient by an inspection of the chain itself.
tto = 1
; •
_ _i V eqn(2) ; = 1,2,3,4 ,n
r=l
0 1 0 1 1 0 0
1 0 1 0 0 0 0
0 1 0 1 0 0 1
[A] = 1 0 1 0 1 1 0
1 0 0 1 0 0 0
0 0 0 1 0 0 1
0 0 1 0 0 1 0
14
3 0 2 1 1 1 0
0 2 0 2 1 0 1
2 0 3 0 1 2 0
[AY2 =_
1 2 0 4 1 0 2
1 1 1 1 2 1 0
1 0 2 0 1 2 0
0 1 0 2 0 0 2
2 5 1 7 4 1 3
5 0 5 1 2 3 0
W' = 1 5 0 8 2 0 5
7 1 8 2 5 6 0
4 2 2 5 2 1 2
1 3 0 6 1 0 4
3 0 5 0 2 4 0
16 3 15 8 9 10 2
3 10 1 15 6 1 8
4 _
[>1] 15 1 18 3 9 13 0
8 15 3 26 9 2 14
9 6 9 9 9 7 3
10 1 13 2 7 10 0
2 8 0 14 3 0 9
15
20 31 13 50 24 10 25
31 4 33 11 18 23 2
13 33 4 55 18 3 31
5 _ 50 11 55 22 34 40 5
[A? =
24 18 18 34 18 12 16
10 23 3 40 12 2 23
25 2 31 5 16 23 0
105 33 106 67 70 75 23
33 64 17 105 42 13 56
6 _
[Ar= 106 17 119 38 68 86 7
67 105 38 179 72 27 95
70 47 68 72 58 50 30
75 13 86 27 50 63 5
23 56 7 95 30 5 54
16
For these traces are obtained as:
Tr [A] = 0 = Si
Tr [A]^ = 18 = 52
Tr [A]^ = 6 = S3
Tr [A]* = 98 = S4
Tr [A]^ = 70 = S5
Tr [A]^ = 642 = Sg
Tr[>l]^ = 672= S7
ao = 1
ai = Si = 0
a2 = - l / 2 ( a i S i + S2) = -9
17
2.4 MATRIX NOTATION FOR AUTOMOBILE WINDOW GUIDANCE MECHANISM:
1 1 0 1 1 0 0
1 0 1 0 0 0 0
0 1 0 1 0 0 1
[A] = 1 0 1 0 1 1 0
1 0 0 1 0 0 0
0 0 0 1 0 0 1
0 0 1 0 0 1 0
This representation is solely meant for the purpose of deriving all possible
mechanisms from a given kinematic chain and identifying the distinct ones among
them. It has no correspondence with graph theory where a unit diagonal element
represents a self loop. It is interesting to see that the characteristic polynomial as
an index of structural isomorphism is applicable for the matrix of the mechanism
also, since the matrix representation of the particular mechanism corresponding
to any other scheme of labeling the links can be obtained shown before through a
sequence of simultaneous permutation of rows and columns. The characteristic
polynomial of this matrix is obtained as:
18
0 1 0 0 0 0
1 0 1 0 0 1
0 1 0 1 1 0
[A] = 0 0 1 0 0 0
0 0 1 0 0 1
0 1 0 0 1 0
1 0 1 0 0 1
0 2 0 1 2 0
[Ar=2 _ 1 0 3 0 0 2
0 1 0 1 1 0
0 1 0 1 2 0
0 0 1 0 0 1
0 2 0 1 2 0
2 0 5 0 0 4
0 4 0 3 5 0
1 0 3 0 0 2
[Ar=3 _ 1 0 4 0 0 3
0 1 0 1 2 0
19
2 0 5 0 0 4
0 7 0 5 9 0
4 0 12 0 0 9
0 4 0 3 5 0
[Ar=
0 5 0 4 7 0
1 0 4 0 0 3
0 7 0 5 9 0
7 0 21 0 0 16
1 16 0 12 21 0
[A]' = 4 0 12 0 0 9
5 0 16 0 0 12
0 5 0 4 7 0
7 0 21 0 0 16
2 28 0 21 37 0
[Ar=6 _ 16 0 49 0 0 37
1 16 0 12 21 0
1 21 0 16 28 0
5 0 16 0 0 12
Tr [A] = 0 = Si
20
Jr[A]^ = 1 0 = 52
Tr [AY = 0 = S3
Tr [A]^ = 34 = S4
Tr[A]^= 0 = S5
Tr [A]^ = 136 = Sg
Now given by
Qo = 1
a^ = Si = 0
02 = -l/2(aiSi + S2) = -5
The equation of mechanism has been found by the subtractions of the main
equation to the equation of which we consider the fixed link are obtained as:
21
2.5 TEST FOR ISOMORPHISM:
0 1 0 1 1 0 0
1 0 1 0 0 0 0
0 1 0 1 0 0 1
[A] = 1 0 1 0 1 1 0
1 0 0 1 0 0 0
0 0 0 1 0 0 1
0 0 1 0 0 1 0
Figure 2.3 show two such graphs whose matrices, it may be verified, have
identical characteristic polynomial.
22
polynomial has been found to distinguish ail known l<inematic chains, (10) it is
hoped that it constitutes a sufficient test for isomorphism of kinematic chains.
23
I
A'
\
\
\
\ ft
/: , • ^x\ \
\
•y>-'
is \
y
\ X
y
\ S/f^
24
Let the polynomial be :
^n-l^ "'" ^n
0 1 . 1 0 1 0 1
1 0 1 0 0 0 0
1 1 0 1 0 0 1
[X] = 0 0 1 0 1 0 0
1 0 0 1 0 1 0
0 0 0 0 1 0 1
1 0 0 0 0 1 0
4 1 1 2 0 2 0
1 2 1 1 1 0 1
lxY2 =_ 1 1 3 0 2 0 1
2 1 0 2 0 1 0
0 1 2 0 3 0 2
2 0 0 1 0 2 0
0 1 1 0 2 0 2
2 5 7 1 8 0 6
5 2 4 2 2 2 1
3 _ 7 4 2 5 1 3 1
[^p= 1 2 5 0 5 0 3
8 2 1 5 0 5 0
0 2 3 0 5 0 4
0 1 1 3 0 4 0
25
26 9 8 15 3 14 3
9 9 9 6 9 3 7
8 9 16 3 15 2 10
15 6 3 10 1 8 1
4 _
[xr= 3 9 15 1 18 0 13
14 3 2 8 0 9 0
2 7 10 1 13 0 10
23 34 50 11 55 5 40
34 18 24 18 18 16 12
50 24 20 31 13 25 10
11 18 31 33 4 31 3
5 _
[xr= 55 18 13 33 4 31 3
5 16 25 2 31 0 23
40 12 10 23 3 63 2
179 72 67 105 38 95 27
72 58 70 42 68 30 50
67 70 105 33 106 23 75
6 _
[xr= 105 42 33 64 17 56 13
38 68 106 17 119 7 86
95 30 23 56 7 54 5
27 50 75 13 86 5 63
25
204 246 356 105 379 65 274
246 142 172 138 144 118 102
[xV = 356 172 170 211 123 181 90
105 138 211 50 225 30 161
379 144 123 225 62 205 45
65 118 181 30 205 12 149
274 102 90 161 45 149 132
Tr[x] = 0 = ^1
Trlx]2 = 18 = ^2
lx[xf = 6 == ^3
Tr [;c]* = 98 := ^4
Tr [x]^ = 71 •= ^5
Tr [x]^ = 642 == ^6
Tr[xy = 772 := ^7
ao = l
ai = Si = 0
27
a 2 = - l / 2 ( a i 5 i + S2) = -9
28
2.6 DEGREE OF FREEDOM
F = 3{n-l) - 2j-h
F = 3(7-1)-2(8)-l
F=l
There are three types of degree of freedom viz. total, partial and
fractionated degree of freedom. A chain is said to have a total degree of freedom
f if any f links of the chain can be moved independent of one another, relative to
any other link and the motion of all the remaining links is dependent on the
motion of all these f and not less than links. A chain which does not satisfy these
conditions is said to have a partial degree of freedom. A chain which besides
violating these conditions consists of a link (called separation link) by cutting
which in to two, the chain of f degree of freedom fi and /2 such that f^+ f2 = f
is said to have a fractionated degree of freedom.
29
degree of freedom chains. It is seen tliat when vertex 9 is deleted the graph
becomes disconnected. In graph theory such a vertex is called a 'cut vertex' and
the graph consisting of such vertex or vertices is called a separate graph.
Therefore, the presence of a cut vertex in the graph of the kinematic chain is
necessary and sufficient to conclude that the chain has fractionated freedom. The
test for fractionated freedom can, therefore, proceed as follows:
(i) Check for the presence of row with more than three non zero entries in them
(it is obvious that a separation link has to be at least a quaternary link or the cut
vertex must have a degree of at least four) if there are no such rows the chain
cannot have fractionated freedom. If there are one or more such rows, proceed
to the next step.
(ii) Obtain the matrix Af^ (n — 1) * (n — 1) by deleting row (and column) k from
matrix A (n * n) where the k^^ row has more than three non zero entries.
here I is the identity matrix and Aj^ ,Aji^ AK^~^ a''^ the power of A^. All the
computations involved in finding Rjc are carried out as per Boolean algebra viz.
1 + 1 = 1,1 + 0 = 0 + 1 = 1,0 + 0 = 0 , 1 * 0 = 0 * 1 = 0 , 1 * 1 = 1.
(iv) Check for the presence of zeros in R,^ indicates that k is a cut vertex and that
graph becomes disconnected after deleting the vertex k. this means that the
kinematic chain has fractionated freedom with k as a separation link A non zero
if^ entry in Rj^ indicates that vertex j is reachable from vertex I and vice versa in
the graph of Aj^ via a path of (n-2) or fewer edges. If there are no zero entries in
/?/c proceed to next step.
(v) If k is the only row in A with more than three non zero entries we conclude
that there are no cut vertices in the graph and chain does not represent a
fractionated chain. Otherwise we repeat the step (ii) to (iv) with the other rows
consisting of more than three non zero entries in them. This is done till there are
30
no more such rows in the matrix. If the test is not satisfied for all such rows we
conclude that the chain cannot have fractionated freedom. It may have partial or
total freedom.
After incurring that the chain does not possess fractionated freedom. It
has been proved by Ashok Dargar, All Hasan & Mr. Chaudhari Ashok that
kinematic chains with degree of the freedom greater than three and consisting of
more than one simple circuit (which is indicated by the number of joints being
greater than number of links) cannot have total freedom and hence can have only
fractionated or partial freedom. Such chains, if they do not satisfy the preceding
test for fractionated freedom. Hence the proposed test for partial freedom need
not applied only for two and three degree of freedom chains. The following
results from Ashok Dargar, All Hasan & Mr. Chaudhari are form the basis of our
algebraic tests for determining whether a chain has partial freedom or not.
(i) Kinematic chains of degree of freedom f in which all sub chains have a
degree of freedom > f have total freedom.
(ii) Kinematic chains of degree of freedom f every sub chain having a degree
of freedom / ^ in the range 0</^<f have partial or fractionated freedom.
(iii) If in kinematic chain of degree of freedom f every sub chain has a degree
of freedom > f then f is equal to one and the chain must contain at least
three independent circuits and eight links.
31
It is clear that all these results can be particularized to any sub chain of a
kinematic chain as well provided we take f to mean the degree of freedom of the
sub chain considered and the term sub chain to mean sub-sub chains of the sub
chain considered. The simplest sub chains are, of course, a simple closed
sequence of kinematically paired links or loops.
32
CHAPTER: 3
3.1 INTRODUCTIOM:
The fig 3.1 shows the 10 linl< walschaert's radial valve gear mechanism
(14). Link 2 and 3 is crank which revolves while link 4, 5,6,7,8 & 10 are floating
links. The link 9 is slider which reciprocates and moves the piston. This is
explaining in fig. 3.2
'HWt,
r^
33
FIG. 3.2 WALSCAERTS RADIAL VALVE GEAR MECHANISM LINKAGES SYSTEM
%li«^^ H/
v"^'
34
s ^~
..i^-.
X \G
/
\ \ ,
> :
A = ajy in which
( i ?^ j ) = 0, otherwise
35
Qj = - - y aj_f. Sfj eqn(2) j = 1,2,3,4 .............n
r=l
[A] =
0 1 1 0 1 0 0 0 1 0
1 0 0 0 0 0 0 0 0 1
1 0 0 1 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 0
1 0 0 1 0 1 0 0 0 0
0 0 0 0 1 0 1 0 0 0
0 0 0 0 0 1 0 1 0 0
0 1 0 0 0 0 1 0 1 0
1 0 0 0 0 0 0 1 0 1
0 1 0 0 0 0 0 0 1 0
L
36
[AY2 _=
4 0 0 2 0 1 0 1 0 2
0 1 2 0 2 0 0 0 1 0
2 0 0 2 0 1 0 0 0 0
0 1 2 0 3 0 1 0 1 0
1 0 0 1 0 2 0 1 0 0
1 0 2 0 3 0 1 0 1 0
0 0 0 0 1 0 2 0 1 0
1 0 0 0 0 1 0 2 0 1
0 2 1 0 1 0 1 0 3 0
2 0 0 0 0 0 0 1 0 2
[Af3 =_
0 6 6 0 7 0 2 0 7 0
6 0 0 2 0 1 0 2 0 4
6 0 0 4 0 2 0 1 0 2
0 2 4 0 5 0 1 0 2 0
7 0 0 5 0 4 0 2 0 2
0 1 2 0 4 0 3 0 2 0
2 0 0 1 0 3 0 3 0 1
0 2 1 0 2 0 3 0 4 0
7 0 0 2 0 2 0 4 0 5
0 4 2 0 2 0 1 0 5 0
37
4 _
[Ar=
26 0 0 13 0 9 0 9 1 13
0 10 8 0 9 0 3 0 12 0
0 8 10 0 12 0 3 0 9 0
13 0 0 9 0 6 0 3 0 4
0 9 12 0 16 0 6 0 11 0
9 0 0 6 0 7 0 5 0 3
0 3 3 0 6 0 6 0 6 0
9 0 0 3 0 5 0 7 0 6
0 12 9 0 11 0 6 0 16 0
13 0 0 4 0 3 0 6 0 9
[A] 5 _
0 39 39 0 48 0 18 0 48 0
39 0 0 17 0 12 0 15 0 22
39 0 0 22 0 15 0 12 0 17
0 17 22 0 28 0 9 0 20 0
0 12 15 0 22 12 0 17 0 20
18 0 0 9 0 12 0 12 0 9
0 15 12 0 17 0 12 0 22 0
48 0 0 20 0 17 0 22 0 28
1 0 0 0 0 0 0 1 0 1
0 1 0 0 0 0 0 0 1 0
38
[Ar=
174 0 0 87 0 66 0 66 0 87
0 61 56 0 68 0 27 0 76 1
0 56 61 0 76 0 27 0 68 0
87 0 0 50 0 37 0 29 0 37
0 68 76 0 98 0 39 0 85 0
66 0 0 37 0 34 0 29 0 29
0 27 27 0 39 0 24 0 39 0
66 0 0 29 0 29 0 34 0 37
0 76 68 0 85 0 39 0 98 0
87 0 0 37 0 29 0 37 0 50
[Ar=
39
w«=
9 _
M'=
40
[Ar=
Tr [A] = 0 = Si
Tr[A]'^ = 24 = S2
Tr [v4]3 = 0 = Ss
Tr [A]^ = 116 = S4
Tr[v4]^ = 0 = -^5
Tr [A]^ = 684 = Se
Tr [Ay = 0 = S7
Tr [A]^ = 4396 = SQ
Tr [Ay = 0 = ^9
Tr [Ay° = 29244 = %0
41
Then characteristics co-efficient according to equation (2)
ao = 1
a^ = Si = 0
Hence the characteristics polynonniai of the ten link Walscaert's Radial Valve Gear
linkage is given by:
42
3.3 MATRIX NOTATION FOR WALSCAERT'S RADIAL VALVE GEAR MECHANISM
[A] =
1 1 1 0 1 0 0 0 1 0
1 0 0 0 0 0 0 0 0 1
1 0 0 1 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 0
1 0 0 1 0 1 0 0 0 0
0 0 0 0 1 0 1 0 0 0
0 0 0 0 0 1 0 1 0 0
0 1 0 0 0 0 1 0 1 0
1 0 0 0 0 0 0 1 0 1
0 0 0 0 1 0
43
This representation is solely meant for the purpose of deriving all possible
mechanisms from a given kinematic chain and identifying the distinct ones among
them. It has no correspondence with graph theory where a unit diagonal element
represents a self loop. It is interesting to see that the characteristic polynomial as
an index of structural isomorphism is applicable for the matrix of the mechanism
also, since the matrix representation of the particular mechanism corresponding
to any other scheme of labeling the links can be obtained shown before through a
sequence of simultaneous permutation of rows and columns. We are removed
first row and first column of the matrix:
[A] =
0 0 0 0 0 0 0 0 1
0 0 1 0 1 0 0 0 0
0 1 0 1 0 0 0 0 0
0 0 1 0 1 0 0 0 0
0 0 0 1 0 1 0 0 0
0 0 0 0 1 0 1 0 0
1 0 0 0 0 1 0 1 0
0 0 0 0 0 0 1 0 1
1 0 0 0 0 0 0 1 0
44
[Af2 =_
1 0 0 0 0 0 0 1 1
0 1 0 2 0 1 0 0 0
0 0 2 0 2 0 0 0 0
0 1 0 2 0 1 0 0 0
0 0 1 0 2 0 1 0 0
1 0 0 1 0 2 0 1 0
0 0 0 0 1 0 2 0 1
2 0 0 0 0 1 0 •2 0
1 0 0 0 0 0 1 0 2
[AY3 =
_
0 0 0 0 0 0 1 0 0
0 0 3 0 4 0 1 0 0
0 2 0 4 0 2 0 0 0
0 0 3 0 4 0 1 0 0
1 1 0 3 0 3 0 1 0
0 0 1 0 3 0 3 0 1
4 0 0 1 0 3 0 4 0
0 0 0 0 1 0 3 0 3
3 0 0 0 0 1 0 3 0
45
4 _
[Ar=
3 0 0 0 0 1 0 3 0
1 3 0 7 0 5 0 1 0
0 0 6 0 8 0 0 0 0
1 3 0 7 0 5 0 1 0
0 0 4 0 7 0 4 0 1
5 1 0 4 0 6 0 5 0
0 0 1 0 4 0 7 0 6
7 0 0 1 0 4 0 7 0
0 0 0 0 1 0 4 0 5
[A]' =
0 0 0 0 1 0 4 0 5
0 0 10 0 15 0 6 0 1
2 6 0 14 0 10 0 2 0
0 0 10 0 15 0 6 0 1
6 4 0 11 0 11 0 6 0
0 0 5 0 11 0 11 0 7
15 1 0 5 0 11 0 15 0
0 0 1 0 5 0 11 0 11
12 0 0 1 0 5 0 10 0
46
w=6 _
10 0 0 1 0 5 0 10 0
8 10 0 25 0 21 0 8 0
0 0 20 0 30 0 12 0 2
8 10 0 25 0 21 0 8 0
0 0 15 0 26 0 17 0 8
21 5 0 16 0 22 0 21 0
0 0 6 0 17 0 26 0 23
25 1 0 6 0 16 0 25 0
0 0 1 0 6 0 15 0 16
{A\
0 0 1 0 6 0 15 0 16
0 0 35 0 56 0 29 0 10
16 20 0 50 0 42 0 16 0
0 0 35 0 56 0 29 0 10
29 15 0 41 0 43 0 29 0
0 0 21 0 43 0 43 0 31
56 6 0 23 0 43 0 56 0
0 0 7 0 23 0 41 0 39
35 1 0 7 0 21 0 35 0
47
[A]»8 =_
38 1 0 7 0 21 0 35 0
45 35 0 91 0 85 0 47 0
0 0 70 0 112 0 58 0 20
46 35 0 91 0 85 0 47 0
0 0 56 0 99 0 72 0 41
85 21 0 64 0 86 0 85 0
0 0 29 0 72 0 99 0 86
91 7 0 30 0 64 0 91 0
0 0 8 0 29 0 56 0 55
[A] 9 _
0 0 8 0 29 0 56 0 55
0 0 126 0 211 0 130 0 61
91 70 0 182 0 170 0 94 0
0 0 126 0 211 0 130 0 61
131 56 0 155 0 171 0 132 0
0 0 85 0 171 0 171 0 127
126 29 0 106 0 201 0 226 0
0 0 37 44 101 0 175 0 171
136 8 0 47 0 105 0 136 0
48
For these traces are obtained as:
Tr [A] = 0 = Si
Tr [Af = 16 = S2
lx[Af = 0 = S3
Jr[AY= 51 = S4
•\v{Af= 0 = %
Tr [i4]^ = 180 = Sg
Tr[^]^ = 0 = S7
-[r[Af = 661 = Sg
Tr [A]'^ = 0 = Sg
ao = l
ai = Si = 0
a2 = -l/2(aiSi + S2) = -8
49
ttg = -l/SiaySi + aQS2 + tts^s + 0454 + a^s^ + a2S6 + a^Sy + SQ) = 0
ttg = -l/9(a8Si + ayS2 + asS2 + a5S4 + a4S5 + a^s^ + az^y + a^SQ + Sg) = 0
F= 3{L-1)-2J
= 3(10-1)-2(12)
= 3
But kinematic chain has three types of degree of freedom, total as shown earlier,
fractionated and partial freedom.
(1) Check for the presence of row with more than three non zero entries in them
(it is obvious that a separation link has to be at least a quaternary link or the cut
vertex must have a degree of at least four) if there are no such rows the chain
50
cannot have fractionated freedom. If there are one or more such rows, proceed
to the next step.
(iii) Compute what is called the reach ability matrix R^ given by:
So i?fc becomes:
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1
( iv ) Check for the presence of zeros in i?^. There are no zeros in /?fc. So, the
chain does not have any fractionated degree of freedom.
51
3.4,2 TEST FOR PARTIAL FREEDOM:
After ensuring that the chain does not possess fractionated freedom we
can test for partial freedom. It has been proved that kinematic chains with a
degree of freedom greater than three and consisting of more than one simple
circuit cannot have total freedom and hence can have only fractionated or partial
freedom. For such chains if they do not satisfy the preceding test for fractionated
freedom, we conclude that they have partial freedom. Hence, the proposed test
for partial freedom need be applied only for 2 & 3 degree of freedom chains.
Since chain for walschaert's radial valve gear having 3 degree of freedom but they
does not have partial degree of freedom because:--
( 1 ) Sub chains of the chain mechanism having not a degree of freedom / i in the
range of 0 < /^ < f have partial or fractionated degree of freedom.
{ 2 ) Every sub chain has a degree of freedom is not greater then f and f =3.
So, the walscaert's radial gear valve mechanism does not have any partial degree
of freedom.
52
CHAPTER: 4
4.1 INTRODUCTION:
53
A ••
5
• " - #
c
7
yy"
--<l^
,1 i
54
.,*
—n
('\^l) = 0, otherwise
55
r ^rj ,eqn(2) ;•= 1,2,3,4 ,72
r=l
0 1 1 0 0 0 0 1
1 0 0 1 1 0 0 0
[A] = 1 0 0 1 0 0 1 .1
0 1 1 0 1 0 1 0
0 1 0 1 0 1 0 0
0 0 0 0 1 0 1 1
0 0 1 0 1 0 0 0
1 0 1 0 0 1 1 0
3 0 1 2 1 1 2 1
0 3 2 1 1 1 1 1
1 2 4 1 1 2 2 2
[A] 2 _
2 1 1 4 1 2 1 2
1 1 1 1 3 0 2 1
1 1 2 2 0 3 1 1
2 1 2 1 2 1 4 2
1 1 2 2 1 1 2 4
56
2 6 8 4 3 4 5 7
6 2 3 1 1 0 0 0
3 _ 8 3 6 1 0 0 1 1
[Ar = 4 7 9 0 1 0 1 0
3 5 0 1 0 1 0 0
4 3 0 0 1 0 1 1
5 5 1 0 1 0 1 0
7 4 1 0 0 1 1 0
21 9 18 22 14 15 23 19
9 18 22 15 12 14 17 14
18 22 35 23 17 23 29 28
[Ar= 22 15 23 32 15 22 23 26
14 12 17 15 18 9 22 17
15 14 23 22 9 21 18 19
23 17 29 23 22 18 35 28
19 17 28 26 17 19 28 32
46 57 85 64 46 56 74 77
57 36 58 69 47 46 68 62
5 _ 85 58 98 103 65 74 109 105
[Ar= 64 69 103 76 69 64 103 90
46 47 68 69 36 57 58 62
56 46 74 64 57 46 85 77
74 68 109 103 58 85 98 105
77 62 105 90 62 77 105 94
57
219 156 261 262 177 197 282 261
156 173 256 209 151 177 235 229
261 256 402 333 235 282 380 366
262 209 333 344 209 262 333 334
[^r = 177 151 235 209 173 156 256 229
197 111 282 262 156 219 261 261
282 235 380 333 256 261 402 366
261 229 366 334 229 261 366 364
58
From these traces are obtained as:
Tr[A] = 0 = Si
Jr[A]^ = 28 = S2
lr[AY =30 = S3
Tr [A]^ = 212 = S4
Tr [A]^ = 530 = S5
Tr [i4]6 = 2301 = Sg
Tr[>l]^ = 7406 = Sy
Tr [.4]^ = 27920 = Sg
ao = 1
tti = 5i = 0
59
Hence the characteristics polynomial of the eight lini<s peaucellier linl<age is given
by:
1 1 1 0 0 0 0 1
1 0 0 1 1 0 0 0
1 0 0 1 0 0 1 1
0 1 1 0 1 0 1 0
[A] =
0 1 0 1 0 1 0 0
0 0 0 0 1 0 1 1
0 0 1 0 1 0 0 0
1 0 1 0 0 1 1 0
60
This representation is solely meant for the purpose of deriving all possible
mechanisms from a given kinematic chain and identifying the distinct ones among
them. It has no correspondence with graph theory where a unit diagonal element
represents a self loop. It is interesting to see that the characteristic polynomial as
an Index of structural isomorphism is applicable for the matrix of the mechanism
also, since the matrix representation of the particular mechanism corresponding
to any other scheme of labeling the links can be obtained shown before through a
sequence of simultaneous permutation of rows and columns.
We neglect the fixed link row and column, the matrix is:
0 0 1 1 0 0 0
0 0 1 0 0 1 1
[A] = 1 1 0 1 0 1 0
1 0 1 0 1 0 0
0 0 0 1 0 1 1
0 1 0 1 0 0 0
0 1 0 0 1 1 0
2 1 1 1 1 1 0
1 3 0 2 1 3 0
1 1 3 2 1 2 1
[Ar=
1 1 1 3 0 2 1
1 2 1 1 2 2 0
1 1 2 1 1 2 1
0 1 1 2 0 3 2
61
2 2 4 5 1 4 2
2 3 6 5 2 7 4
[Af- 5 5 4 7 3 8 2
4 4 5 4 4 5 1
2 3 4 6 1 7 4
3 5 3 6 2 7 1
3 6 3 4 4 7 1
9 9 9 11 5 13 3
11 16 10 17 9 - 22 4
11 14 18 20 9 23 8
[^] 4 _
9 10 12 18 5 19 8
10 15 11 14 10 19 3
9 12 14 15 8 19 6
7 11 13 ,i fag 5 21 9
v\ .:
20 24 30 38 14 42 16
27 37 35 52 22 63 19
38 47 45 61 29 73 21
[ ^ f5 =_
30 39 38 45 26 55 14
25 33 39 49 20 59 20
30 41 33 49 24 60 15
29 38 36 50 22 60 18
62
68 86 83 106 55 128 35
89 115 109 141 78 193 52
107 141 136 184 86 220 64
[Ar= 104 114 148 63 174 57
83
84 112 110 145 69 179 51
87 117 106 146 72 178 48
86 116 104 151 68 183 52
Tr[A] = 0 = ^1
Tr[A]^ = 17 = ^2
Jr[A]^ = 22 = ^3
Tr [A]^ = 99 = S4
Tr [A]^ = 245 = Ss
63
Tr [A]^ = 771 = Se
Jr[Ay = 2310 = Sy
tto = 1
Ui = Si = 0
a2 = -l/2(aiSi + S2) = -8
[x^ - lAx^ - lOx^ + 45%* + 34:^3 - 48x2 - 2Ax + 47) - (x^ - Sx^ - 7x* +
9x^ + lOx^ + 2;c - 3 )
64
4.4 DEGREE OF FREEDOM:
F= 3(L-1)-2J
= 3(8-1)-2(10)
= 1
But kinematic chains have three types of degree of freedom, total as shown
earlier, fractionated and partial freedom.
(1) Check for the presence of row with more than three non zero entries in them
(it is obvious that a separation link has to be at least a quaternary link or the cut
vertex must have a degree of at least four) if there are no such rows the chain
cannot have fractionated freedom. If there are one or more such rows, proceed
to the next step.
(iii) Compute what is called the reach ability matrix R^ given by:
Here I is the identity matrix and A/^ ,Ak^........Af(^~'^ are the powers
of Aji. All the computations involved in finding Rjc are carried out as per Boolean
algebra viz. 1 + 1 = 1,1 + 0 = 0 + 1 = 1, 0 + 0 = 0 , 1 * 0 = 0 * 1 = 0 , 1 * 1 = 1.
So Rk becomes
65
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 . 1
1 1 1 1 1 1 1 1
R,. =
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1
( iv ) Check for the presence of zeros in R^. There are no zeros in R^. So the
chain does not have any fractionated degree of freedom.
After ensuring that the chain does not possess fractionated freedom we can
test for partial freedom. It has been proved that kinematic chains with a degree of
freedom greater than three and consisting of more than one simple circuit cannot
have total freedom and hence can have only fractionated or partial freedom. For
such chains if they do not satisfy the preceding test for fractionated freedom, we
conclude that they have partial freedom. Hence, the proposed test for partial
freedom need be applied only for 2 & 3 degree of freedom chains. Peaucellier
mechanism has one degree of freedom. So, they do not have partial degree of
freedom.
66
CHAPTER: 5
(B) ISOMORPHISM:
(b) Walscaert's radial valve gear mechanism has total degree of freedom but does
not have fractionated degree of freedom because there is no presence of zero in
67
the Rji matrix. It does not have partial degree of freedom because the every
subchain has a degree of freedom not greater than f and f is equal to three.
CONCLUSION:
68
APPENDIX-1
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
Int ij,k,n,p;
cIrscrO;
scanf("%d",&n);
printf{"\n");
for{i=l;i<=n;i++)
printf{"s[%d]=",i);
scanf("%f",&s[i]);
printf{"\n");
printf("a[0]=");
scanf("%r,&a[0]);
printf{"\n");
69
a[l]=s[l];
printf{"a[l]=%f",a[l]);
printf("\n");
P=0;
for{i=2;i<=n;i++)
P=0;
forG=l;j<=i;j++)
p=p+(a[i-j]*s[j]);
a[i]=-p/j;
printf{"a[%d]=%r,i,a[i]);
printf("\n");
}
getchO;
70
APPENDIX-2
Data Flow
Process
Storage
71
REFFERENCE:
2. Fei Yang, Zongquan Deng, Jianguo Tao, Lifang LI "A new method for
isomorphism identification topological graphs using incident matrices"
Mechanism and Machine theory volume 49, march 2012 Pp. 298-307
7. A.K Mallik was delivered the topic "Rigid and compliant planar linkages"
in fourteenth national conference on Machine and Mechanisms
NACOMM - 09, organized by the Mechanical Department of NIT
Durgapur, dec-17-18 2009.
72
8. Peter Mitrouchev give formulation for actuator's number enumeration for
main structures in robotics G-SCOP Laboratory, 46, 2007 pp. 622-646
10. Eric A. Butcher, Chris Hartman " Efficient enumeration and hierarchical
classification of planar sinnple-jointed kinematic chains" Mechanism and
machine theory, volume 40 issue-9 September 2005 pp. 1030-1050
16. V.P. Agarwal and J.S. Rao "Identification and Isomorphism of Kinematic
Chains and Mechanism" Mechanism and Machine theory vol.24, issue 4,
1989. pp. 309-321
73