23.12.2014 Views

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Proceedings <strong>of</strong> the National Conference on<br />

Trends and Advances in Mechanical Engineering,<br />

<strong>YMCA</strong> <strong>University</strong> <strong>of</strong> <strong>Science</strong> & <strong>Technology</strong>, Faridabad, Haryana, Oct <strong>19</strong>-<strong>20</strong>, <strong>20</strong>12<br />

2. Theoretical analysis<br />

2.1. Vector loop analysis <strong>of</strong> 4R linkage<br />

Fig.1 shows the 4-bar linkage with vector loop. There are 10 independent variables, L1 , L2,<br />

L3<br />

, L4,<br />

L5<br />

, β , θ<br />

2,<br />

θ1,<br />

L0,<br />

L6<br />

.<br />

L<br />

Where 5<br />

and β L5<br />

are two parameters to locate the coupler point. the distance from a convenient reference<br />

point, and the angle that the line AP makes with the line <strong>of</strong> centre <strong>of</strong> the coupler AB.<br />

The loop closure equation is:<br />

L + L + L + L 0<br />

(1)<br />

1 2 3 4 =<br />

Using Euler equivalence Eq. (1) becomes:<br />

Fig.1. 4-bar Linkage: Vector Loop and Variables<br />

iθ1<br />

iθ<br />

2<br />

iθ<br />

3<br />

iθ<br />

4<br />

L e + L e + L e + L e 0<br />

(2)<br />

1 2<br />

3<br />

4 =<br />

The coordinates <strong>of</strong> coupler C, in the reference frame OXY, are,<br />

P X = L 2 cos θ 2 + AP cos ( θ 3 + β )<br />

(3)<br />

P Y<br />

= L<br />

2<br />

sin θ<br />

2<br />

+ AP sin ( θ<br />

3<br />

+ β )<br />

(4)<br />

Eqs. (3) and (4) are used in Eqs. (A1) and (A2) to develop the first part <strong>of</strong> the goal function.<br />

Fig.1.shows the variables <strong>of</strong> the 4R linkage.<br />

2.2. Optimization Techniques<br />

When the objective function is nonlinear and non-differentiable, direct search approaches are the methods <strong>of</strong><br />

choice. The best known <strong>of</strong> these are the algorithm by Nelder and Mead, genetic algorithms, by Hook and Jeeves,<br />

evolutionary algorithms. Here we have used evolutionary algorithm.<br />

Users generally require that a practical optimization technique should fulfill three requirements. First, the<br />

method should find the global minimum, regardless <strong>of</strong> the initial system parameter values. Second, convergence<br />

should be fast. Third, the program should have a minimum number <strong>of</strong> control parameters so that it will be easy<br />

to use. The optimization method presented here i.e. the DE possesses all the above mentioned properties.<br />

The main steps <strong>of</strong> DE algorithm are: Initialization, Evaluation, Repeat, Mutation, Recombination, Evaluation,<br />

Selection, (Until termination criteria are met).<br />

In DE an optimization task consisting <strong>of</strong> ‘D’ parameters can be represented by a ‘D’ dimensional vector; a<br />

population <strong>of</strong> ‘NP’ solution vectors is randomly created at the start; this population is successfully improved by<br />

applying mutation, crossover and selection operators.<br />

2.3. The Objective Function<br />

The objective function is the sum <strong>of</strong> two terms. The first part computes the position error (also called the<br />

structural error) as the sum <strong>of</strong> squares <strong>of</strong> the Euclidian distances between each desired points along the coupler<br />

247

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!