Next Article in Journal
Neural Network Algorithm with Dropout Using Elite Selection
Next Article in Special Issue
Singularities of Serial Robots: Identification and Distance Computation Using Geometric Algebra
Previous Article in Journal
Dynamic Linkages among Carbon, Energy and Financial Markets: Multiplex Recurrence Network Approach
Previous Article in Special Issue
Adaptive Rejection of a Sinusoidal Disturbance with Unknown Frequency in a Flexible Rotor with Lubricated Journal Bearings
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Complete Balancing of the Six-Bar Mechanism Using Fully Cartesian Coordinates and Multiobjective Differential Evolution Optimization

by
María T. Orvañanos-Guerrero
1,
Mario Acevedo
2,
Claudia N. Sánchez
1,
Daniel U. Campos-Delgado
3,
Amir Aminzadeh Ghavifekr
4,
Paolo Visconti
1,5 and
Ramiro Velázquez
1,*
1
Facultad de Ingeniería, Universidad Panamericana, Aguascalientes 20290, Mexico
2
Facultad de Ingeniería, Universidad Panamericana, Zapopan 45010, Mexico
3
Facultad de Ciencias, Instituto de Investigación en Comunicación Óptica, Universidad Autónoma de San Luis Potosí, San Luis Potosí 78295, Mexico
4
Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz 5166616471, Iran
5
Department of Innovation Engineering, University of Salento, 73100 Lecce, Italy
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(11), 1830; https://doi.org/10.3390/math10111830
Submission received: 23 April 2022 / Revised: 19 May 2022 / Accepted: 21 May 2022 / Published: 26 May 2022
(This article belongs to the Special Issue Applied Mathematics to Mechanisms and Machines)

Abstract

:
The high-speed operation of unbalanced machines may cause vibrations that lead to noise, wear, and fatigue that will eventually limit their efficiency and operating life. To restrain such vibrations, a complete balancing must be performed. This paper presents the complete balancing optimization of a six-bar mechanism with the use of counterweights. A novel method based on fully Cartesian coordinates (FCC) is proposed to represent such a balanced mechanism. A multiobjective optimization problem was solved using the Differential Evolution (DE) algorithm to minimize the shaking force (ShF) and the shaking moment (ShM) and thus balance the system. The Pareto front is used to determine the best solutions according to three optimization criteria: only the ShF, only the ShM, and both the ShF and ShM. The dimensions of the counterweights are further fine-tuned with an analysis of their partial derivatives, volumes, and area–thickness relations. Numerical results show that the ShF and ShM can be reduced by 76.82% and 77.21%, respectively, when importance is given to either of them and by 45.69% and 46.81%, respectively, when equal importance is given to both. A comparison of these results with others previously reported in the literature shows that the use of FCC in conjunction with DE is a suitable methodology for the complete balancing of mechanisms.

1. Introduction

The high-speed motion of the links of a mechanism generates dynamic reactions that are transmitted as vibrations to the fixed frame producing undesirable effects such as noise, wear, fatigue, and energy losses that will eventually limit the mechanism’s performance and operating life. In addition to these technical problems, vibrations may induce a constant machine maintenance involving wastes that have an environmental impact and noise pollution that can lead to health problems [1].
The dynamic reactions under discussion are produced by both external and inertial forces. The former are naturally forces generated outside the mechanism such as those induced by an actuator. The latter are due to the large accelerations of the links. Some representative methods for calculating dynamic reactions in mechanisms are those of Uicker [2] and Waldron [3].
The force and the moment that occur at the mechanism’s fixed frame are typically known as shaking force (ShF) and shaking moment (ShM), respectively. Thus, a traditional but still open challenge in machine theory is how to effectively remove or minimize the dynamic reactions, i.e., the ShF and ShM, derived from the mechanism’s motion. This process is known as complete (or dynamic) balancing.
The dynamic balancing of mechanisms has been widely studied in mechanical engineering. Some recent historical reviews addressing the topic can be found in [1,4,5,6].
Among the first publications, we can find the work of Fischer introducing in 1902 a method called principal vectors [7]. This method allows for the balancing of the ShF by analyzing each of the links of the mechanism and determining the points, called principal points, in which the static balancing can be reached. The work of Fischer provided the basis for the methods studying the motion of the centers of mass (CoM) of the links in a mechanism. The method of principal vectors was subsequently used by Goryachkin [8], Yudin [9], and Kreutzinger [10].
Another early method proposed for the dynamic balancing of mechanisms was the static substitution of masses. Its aim is to statically replace the mass of the coupler by concentrated masses, thus transforming the problem of mechanism balancing into a simpler problem of balancing the rotating links. The works of Maxwell [11], Smith [12], and Talbourdet [13] are based on this method.
The 1920s were marked by a special interest in the balancing of engines [14,15] and machines related to agriculture [16]. The Lanchester balancer stands out among these works. It is still being used for balancing four-stroke engines.
During the 1940s, some methods based on function approximation were proposed to achieve partial equilibrium. The work of Gheronimus [17] is a representative example. In this work, the balancing conditions were formulated by minimizing the root mean square (RMS) or the maximum values of the ShM. The duplicate mechanism method [18] was also proposed in this decade. It achieves a complete balancing with the addition of axial and mirror symmetric mechanism duplicates.
The balancing methods based on harmonic analysis appeared in the 1960s with the use of the crank-slider mechanism in internal combustion engines [19,20]. Such methods reduce the ShM by balancing certain harmonics of both the ShF and ShM. To carry out this process, the unbalanced forces and moments are divided into Fourier series and then analyzed in parts.
In 1969, Berkof and Lowen [21] proposed a new solution for dynamic balancing using a method called linearly independent vectors. This method consists of formulating an equation considering a vector representation describing the position of the total CoM of the mechanism in conjunction with the equation representing the closed kinematic chain. A system of equations containing linearly independent vectors is then obtained allowing to find the balancing conditions of the mechanism by reducing to zero the time-dependent coefficients. This method was subsequently explored in [22,23].
In the 1970s, the dynamic balancing theory achieved significant advances. Berkof [24] formulated the first method for complete balancing using counterweights and counter-inertias to eliminate the undesired forces and moments of the moving links, respectively. It then became clear that a complete balancing of mechanisms is feasible at the expense of considering complex design modifications and an inevitable increase of the total mass and volume of the mechanism.
Methods proposing a partial balancing were then proposed searching to keep the added mass reasonably small. In [25], Wiederrich and Roth formulated simple general conditions for determining the inertia properties of a four-bar mechanism and achieved its partial balancing. Dresig examined the partial balancing conditions for several 2D mechanims with six and eight-bar linkages [26].
Later approaches involved the use of planetary [27] and auto-balanced systems [28]. More recent ones propose the use of the instantaneous dynamic balancing conditions [29], the trajectory planning of the CoM of the mechanism [30], and the reformulation of the balancing conditions following a Taylor-based approach [29]. Finally, the most recent and novel balancing method encompasses the flexibility of the links of the mechanism [31].
We focus our attention on Berkof’s counterweight approach. After the partial balancing methods, optimization techniques were then explored searching a tradeoff between the added mass and the reduction of the ShF and ShM.
In 1998, Segla presented the static balancing optimization of a robotic mechanism [32]. The balancing conditions were first obtained and then, a basic genetic algorithm programmed in Fortran was used for the optimization.
Currently, the most popular optimization techniques for mechanical problems are based on metaheuristic methods: evolutionary [33], differential evolution [34], genetic [35], and Firefly [36] algorithms. These proposals were designed to find heuristics (i.e., partial solutions) that may provide sufficiently good tradeoffs for the dynamic balancing problem.
To our knowledge, all previous works addressing optimization techniques for the dynamic balancing of mechanisms make use of Cartesian coordinates (CC) to obtain the expressions of the dynamic reactions. A major drawback of CC is that they involve trigonometric functions that derive into complex mathematical expressions that are computationally burdensome.
Our research approach differs from the existing literature in that it presents an alternative to CC: fully Cartesian coordinates (FCC), which are also called natural coordinates [37]. By using FCC, the dynamic reactions at the fixed frame can be formulated by means of equations of less complexity (no angular variables). Then, the resulting ShF and ShM expressions are used to optimize the dynamic balancing of mechanisms through the use of counterweights.
Our previous work [38,39] successfully reported the dynamic balancing of a four-bar mechanism and its optimization with Projected Gradient Descent. In this paper, we address the dynamic balancing of a more complex system, a six-bar mechanism, and explore the differential evolution (DE) algorithm as our optimization method.
Parallel mechanisms are increasingly being used in robotic applications [40,41]. The six-bar mechanism is a typical parallel manipulator. This single degree-of-freedom planar linkage is typically used as a variable-speed transmission mechanism where the input crank rotates at constant speed and the output link works as an overrunning clutch mounted on the output shaft [42].
The rest of the paper is organized as follows: In Section 2, the FCC-based mass-matrix definition for the six-bar mechanism with counterweights is introduced together with the expressions of the ShF and ShM. In Section 3, the details of the multiobjective DE optimization are presented. In Section 4, a numerical example is presented to illustrate the proposed approach. In Section 5, results are discussed and compared to others previously reported in the literature. Finally, Section 6 concludes, summarizing the main contributions and giving the future work perspectives of this research.

2. Mechanical Analysis

2.1. FCC-Based Definition of the Mass Matrix of an Element Defined by Three Basic Points

This section details the method used to obtain the mass matrix M 3 P of elements defined by three basic points using FCC and the concept of virtual work.
Consider an element defined by three basic points i, j, and k, as shown in Figure 1. The element is located in a global coordinate system ( x , y ) and in a local coordinate system ( x ¯ , y ¯ ) with its origin at point i and the x ¯ axis directed toward point j.
The location of any point P in this element is defined by a vector r in the global reference system and a vector r ¯ in the local coordinate system. In this way, r can be expressed, according to Equation (1).
r = r i + A r ¯
where A is the rotation matrix. Being the element rigid, the local position of vector r ¯ remains constant regardless of the element’s motion. Thus, the position of point P can be defined according to Equation (2).
r = r i + A r ¯ = r i + c 1 ( r j ri ) + + c 2 ( r k r i )
where c 1 and c 2 are the components of vector r ¯ in the local coordinate system. The components of vector r can be expressed in matrix form as shown in Equation (3).
r = x y = 1 c 1 c 2 0 c 1 0 c 2 0 0 1 c 1 c 2 0 c 1 0 c 2 x i y i x j y j x k y k = Cq
where q T = x i y i x j y j x k y k is the vector that contains the FCC of the element. Note that matrix C is constant for a given point P and does not change with the system’s motion, thus fulfilling Equations (4) and (5).
r ˙ = C q ˙
r ¨ = C q ¨
Coefficients c 1 and c 2 in matrix C can be expressed in terms of the coordinates of points i, j, and k in the local reference frame according to Equation (6).
r ¯ = c 1 ( r j r i ) + c 2 ( r k r i )
Since r i ¯ = 0 is located at the local reference origin, Equation (6) can be rewritten as shown in Equation (7).
r ¯ = [ r j ¯ | r k ¯ ] c 1 c 2 = X ¯ c
Vector c contains the coefficients c 1 and c 2 , and matrix X ¯ has the components of vectors r j ¯ and r k ¯ in its columns (Equation (8)).
X ¯ = [ r j ¯ | r k ¯ ] = x j x k y j y k = l i j K x 0 K y
Now, it is possible to define the virtual work W generated by the inertial forces (Equation (9)).
W = ρ Ω r ˙ T r ¨ d Ω
where ρ is the density of the element’s material. Substituting Equations (4) and (5) into Equation (9) yields to the definition of virtual work (Equation (10)):
W = ρ Ω q ˙ T C T C q ¨ d Ω
Since vectors q ˙ T and q ¨ are independent of Ω , they can be taken out of the integral as expressed by Equation (11).
W = q ˙ T ρ Ω C T C d Ω q ¨
On the other hand, taking into account the definition of virtual work proposed in [43] (Equation (12)) and comparing it to Equation (11), the mass matrix M 3 P can be expressed by Equation (13).
W = q ˙ T M q ¨
M 3 P = ρ Ω C T C d Ω
Further development of the product of C T C in Equation (13) yields to Equation (14).
M 3 P = ρ Ω c e 0 c f 0 c g 0 0 c e 0 c f 0 c g c f 0 c h 0 c i 0 0 c f 0 c h 0 c i c g 0 c i 0 c j 0 0 c g 0 c i 0 c j d Ω
with:
c e = c 1 2 + 2 c 1 c 2 2 c 1 + c 2 2 2 c 2 + 1
c f = c 1 2 c 1 c 2 + c 1
c g = c 1 c 2 c 2 2 + c 2
c h = c 1 2
c i = c 1 c 2
c j = c 2 2
Note that Equation (14) involves solving the integrals of Equations (21)–(23).
Ω ρ d Ω = m
Ω ρ c d Ω = Ω ρ X ¯ 1 r ¯ d Ω = ρ Ω 1 l i j K x K y l i j 0 1 K y x ¯ y ¯ d Ω = ρ Ω x ¯ l i j y ¯ K x K y l i j y ¯ K y d Ω = m x ¯ g l i j m y ¯ g K x K y l i j m y ¯ g K y
Ω ρ c c T d Ω = X ¯ 1 Ω ρ r ¯ r ¯ T d Ω X ¯ T = X ¯ 1 Ω ρ x ¯ 2 x ¯ y ¯ x ¯ y ¯ y ¯ 2 d Ω X ¯ T = X ¯ 1 I y I x y I x y I x X ¯ T = I x K x 2 K y 2 l i j 2 2 I x y K x K y l i j 2 + I y l i j 2 I x K x K y 2 l i j + I x y K y l i j I x K x K y 2 l i j + I x y K y l i j I x K y 2
where m is the total mass of the element, r ¯ represents the local coordinates of the center of gravity, and I x , I y , and I x y are the moments and products of inertia with respect to local coordinates with origin at the basic point i.
By substituting the integrals of Equations (21)–(23) into Equation (14), we finally obtain the mass matrix M 3 P (Equation (24)).
M 3 P = e 0 f 0 g 0 0 e 0 f 0 g f 0 h 0 i 0 0 f 0 h 0 i g 0 i 0 j 0 0 g 0 i 0 j
with:
e = I x K x 2 K y 2 l 2 2 I x K x K y 2 l i j + I x K y 2 2 I x y K x K y l i j 2 + 2 I x y K y l i j + I y l i j 2 + 2 K x m y ¯ g K y l i j + m 2 m x ¯ g l i j 2 m y ¯ g K y
f = I x K x 2 K y 2 l i j 2 + I x K x K y 2 l i j + 2 I x y K x K y l i j 2 I x y K y l i j I y l i j 2 K x m y ¯ g K y l i j + m x ¯ g l i j
g = I x K x K y 2 l i j I x K y 2 I x y K y l i j + m y ¯ g K y
h = I x K x 2 K y 2 l i j 2 2 I x y K x K y l i j 2 + I y l i j 2
i = I x K x K y 2 l i j + I x y K y l i j
j = I x K y 2

2.2. Six-Bar Mechanism

Figure 2 shows the six-bar mechanism. This kind of mechanism exhibits one degree of freedom and five mobile links.
Each of the links has a local coordinate system with its origin located at point i and the x axis directed toward point j. Each of the links has a mass m b n and a center of gravity located at local coordinates ( x b n , y b n ) for 1 n 5 . The distribution of the points is detailed in Table 1.
For this mechanism, it is possible to define a vector q representing the positions of its basic points (Equation (31)).
q = [ A x A y B x B y C x C y D x D y E x E y F x F y G x G y ] T
By time-deriving q , it is possible to obtain a new vector q ˙ representing the velocities of each of the basic points of the mechanism (Equation (32)). Similarly, by time-deriving the velocity vector, the acceleration vector q ¨ can be obtained (Equation (33)).
q ˙ = [ V A x V A y V B x V B y V C x V C y V D x V D y V E x V E y V F x V F y V G x V G y ] T
q ¨ = [ A A x A A y A B x A B y A C x A C y A D x A D y A E x A E y A F x A F y A G x A G y ] T

2.3. Counterweight Addition

To proceed with the dynamic balancing of the six-bar mechanism, a set of cylindrical counterweights is added to its structure (Figure 3).
To simplify the procedure, let us assume that all counterweights are coincident with the basic point i of each of the elements of the mechanism. The center of gravity of each counterweight is located at the local coordinates ( x c n , y c n ) for 1 n 5 . Their thickness is defined by t c n for 1 n 5 .
It is then possible to define the mass m c n of each counterweight as a function of its density ρ c n = ρ , its thickness t c n , and the location of its CoM ( x c n , y c n ), as shown in Equation (34).
m c n = ρ V = ρ π t c n ( x c n 2 + y c n 2 )
It is also possible to obtain the mass moments for each of the counterweights with respect to the local coordinate system origin, as shown in Equations (35) and (36).
I x c n = 1 4 m c n ( x c n 2 + y c n 2 ) + m y c n 2 = 1 4 m c n ( x c n 2 + 5 y c n 2 ) = 1 4 ρ π t c n ( x c n 2 + y c n 2 ) ( x c n 2 + 5 y c n 2 )
I y c n = 1 4 m c n ( x c n 2 + y c n 2 ) + m x c n 2 = 1 4 m c n ( 5 x c n 2 + y c n 2 ) = 1 4 ρ π t c n ( x c n 2 + y c n 2 ) ( 5 x c n 2 + y c n 2 )
The polar moment of inertia of each counterweight I z c n with respect to the local coordinate system origin can be defined by Equation (37).
I z c n = I x c n + I y c n = 3 2 m c n ( x c n 2 + y c n 2 ) = 3 2 ρ π t c n ( x c n 2 + y c n 2 ) 2
Similarly, the product of inertia of each counterweight with respect to the local coordinate system origin can be calculated with Equation (38).
I x y c n = m c n x c n y c n = ρ π t c n ( x c n 2 + y c n 2 ) x c n y c n

2.4. Mass Matrix for the Six-Bar Mechanism with Counterweights

To formulate the mass matrix of the balanced mechanism, it is necessary to obtain the mass matrices for each of the linkages (link and counterweight) first. The details of these individual mass matrices can be found in Appendix A.
Given that the mechanism consists of seven basic points, each of them represented by one (x, y) coordinate, the resulting mass matrix will consist of 14 columns and 14 rows.
Equation (39) shows the mass matrix M representing the six-bar mechanism with counterweights.
M = a 2 0 0 0 b 2 c 2 0 0 0 0 0 0 0 0 0 a 2 0 0 c 2 b 2 0 0 0 0 0 0 0 0 0 0 e 3 0 0 0 0 0 g 3 0 f 3 0 0 0 0 0 0 e 3 0 0 0 0 0 g 3 0 f 3 0 0 b 2 c 2 0 0 d 2 + e 1 0 g 1 0 f 1 0 0 0 0 0 c 2 b 2 0 0 0 d 2 + e 1 0 g 1 0 f 1 0 0 0 0 0 0 0 0 g 1 0 a 4 + j 1 0 i 1 0 0 0 b 4 c 4 0 0 0 0 0 g 1 0 a 4 + j 1 0 i 1 0 0 c 4 b 4 0 0 g 3 0 f 1 0 i 1 0 h 1 + i 3 0 i 3 0 0 0 0 0 0 g 3 0 f 1 0 i 1 0 h 1 + i 3 0 i 3 0 0 0 0 f 3 0 0 0 0 0 i 3 0 a 5 + h 3 0 b 5 c 5 0 0 0 f 3 0 0 0 0 0 i 3 0 a 5 + h 3 c 5 b 5 0 0 0 0 0 0 b 4 c 4 0 0 b 5 c 5 d 4 + d 5 0 0 0 0 0 0 0 c 4 b 4 0 0 c 5 b 5 0 d 4 + d 5
where a n , b n , …, j n are the terms of the different mass matrices for linkages n = 1, …, 5 (see Appendix A).

2.5. Linear Momentum and Shaking Force

Once vectors q , q ˙ , and q ¨ have been defined (Equations (31)–(33)), it is possible to calculate the linear momentum L associated to the balanced mechanism (Equation (40)).
L i L j = BM q ˙
where B (Equation (41)) is a matrix formed by identity matrices matching the number of basic points in the mechanism.
B = 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 T
By solving Equation (40) and considering that the velocity of the fixed points is always zero ( V A X = 0 , V A Y = 0 , V B X = 0 , V B Y = 0 ), the expressions of the linear momentum ( L i and L j ) can be obtained.
The ShF i and ShF j of the mechanism can be computed by time-deriving the equations L i and L j (Equation (40)) (expressions are not included in the paper because of their length).
To guarantee the equilibrium, the result of these derivatives must be constant (normally zero) in the analyzed period of time.

2.6. Angular Momentum and Shaking Moment

The use of FCC allows us to express the angular momentum H of the mechanim, as shown in Equation (42):
H = q × ( M q ˙ ) = rM q ˙
where r is given as a function of the basic points and can be expressed as Equation (43):
r = A Y A X B Y B X C Y C X D Y D X E Y E X F Y F X G Y G X T
The ShM can then be calculated by time-deriving H (Equations (44) and (45)).
S h M = d H d t = rM ( d ( q ˙ ) d t ) + ( d r d t ) M q ˙
S h M = d H d t = rM q ¨ + r ˙ M q ˙
with:
r ˙ = [ VA Y VA X VB Y VB X VC Y VC X VD Y VD X VE Y VE X VF Y VF X VG Y VG X ] T
To guarantee the dynamic equilibrium of the mechanism, the ShM must be constant, i.e., the time-derivative of H (Equation (45)) must be zero.
The ShM of the mechanism is finally obtained by solving Equation (45) and considering VA X = 0, VA Y = 0, VB X = 0 y VB Y = 0 (equation is not included in the paper because of its length).

3. Optimization

3.1. Objective Function

Two dimensionless balancing indexes β i , containing the motion parameters ( q , q ˙ , and q ¨ ) of the six-bar mechanism, can be used to define the optimization’s objective function: β S h F and β S h M .
β S h F (Equation (47)) is defined by the RMS value of the ShF reaction of the optimized mechanism ( r m s ( o S h F ) ) with respect to the RMS value of the original mechanism ( r m s ( S h F ) ), which are both considered over a time period T.
β S h F = r m s ( o S h F ) r m s ( S h F ) = k = 1 N ( o S h F i k 2 + o S h F j k 2 ) k = 1 N ( S h F i k 2 + S h F j k 2 )
β S h M (Equation (48)) can be calculated in a similar way. Nevertheless, the reaction produced by ShM must also be considered.
β S h M = k = 1 N o S h M k 2 k = 1 N S h M k 2
where o S h M is the shaking moment of the optimized mechanism and S h M is a constant representing the shaking moment of the unbalanced mechanism.
A multiobjective optimization problem emerges as it is desired to minimize both β S h F and β S h M considering the variables boundaries (i.e., the physical limits for the locations of the CoM ( x c n and y c n ) and the thickness ( t c n ) of each counterweight). To solve this problem, a linear combination of the objectives is performed as proposed in Equation (49).
f ( X ) = γ β S h M + ( 1 γ ) β S h F
where γ is a scalar value that assigns the importance to each optimization objective. Thus, the 15 variables to be optimized are: x c 1 , y c 1 , t c 1 , x c 2 , y c 2 , t c 2 , x c 3 , y c 3 , t c 3 , x c 4 , y c 4 , t c 4 , x c 5 , y c 5 , and t c 5 . The boundaries for optimization are defined according to Equation (50).
x c n m i n x c n x c n m a x y c n m i n y c n y c n m a x t c n m i n t c n t c n m a x

3.2. Algorithm

Once the objective function has been proposed, an optimization method can be applied. In this paper, we explore Differential Evolution (DE) [44].
Being an evolutionary algorithm, DE uses approaches inspired by the theory of evolution. It optimizes a problem by proposing a population of candidate solutions and creating new candidate solutions with the ones that obtained the best scores. Thus, the new generations are better than the previous ones. Recently, DE has been successfully applied to disruptive fields such as the oil market [45] and genome studies [46].
The DE algorithm proposed for the complete balancing optimization of the six-bar mechanism is presented in Algorithm 1. It was programmed in Python.    
Algorithm 1: Differential Evolution (DE).
Mathematics 10 01830 i001
Given that the number of variables to optimize is equal to 15, a population of N = 15 2 = 225 solutions is created, identifying the n t h solution of generation k with the vector X N k . Solutions are initialized following a uniform distribution bounded by limits between the allowed ranges for each variable. Three solutions are then selected to perform the random mutation: X γ k , X δ k , and X η k to generate a new solution: X ^ i k = X γ k + F ( X δ k X η k ) with F being a random value between 0 and 2.
The crossover is performed with a probability C R = 0.7 . Then, Y i k and X i k are evaluated in the function to be optimized. To be considered part of the new generation, the one with the best results is chosen. The generations are repeated 100 times, resulting in the solution exhibiting the lowest value.

4. Results

This section presents the numerical results of the dynamic balancing of the six-bar mechanism with FCC and DE optimization. To better visualize the influence of the counterweights on the procedure, a Pareto front analysis is proposed. This tool allows to restrict our attention to the set of best solutions and ease the decision-making process.
Table 2 summarizes the physical parameters of the six-bar mechanism shown in Figure 2. Steel links have been considered with a density of 7800 kg/m 3 . The counterweights are considered to be made of brass with a density ρ c n = 8500 kg/m 3 .
A motor located at point A is responsible for actuating the mechanism. Its rotating speed has been fixed at 500 rpm. Using direct kinematics, it is possible to obtain a sample of the positions, velocities, and accelerations at each of the basic points of the mechanism.
By replacing all known parameters in the equations of the balancing indexes (Equations (47) and (48)), it is possible to define the objective function (Equation (49)). According to the mechanical characteristics of this particular example, the boundaries considered for the optimization are shown in Equation (51):
0.16 m x c n , y c n 0.16 m 0.005 m t c n 0.04 m

4.1. Optimization with Five Counterweights

The DE algorithm was executed until 200 valid solutions (i.e., solutions resulting from the objective function optimization with values between 0 and 1) were obtained considering γ as a random value with uniform distribution in the range (0, 1), following the random search of the hyper-parameters presented in [47].
Figure 4a shows the relationship between the β S h F and the β S h M values for all the solutions found. Different colors are used to represent the values used for γ in the objective function f(X) (Equation (49)).
In Figure 4b, the dark points represent the Pareto front while the light ones represent the dominated solutions.
Among all the solutions found in the Pareto front, it is possible to select the one that is the most appropriate according to the desired type of balancing. To exemplify this statement, let us consider three different solutions from the Pareto front.
In the first one, a greater importance is given to balancing the ShM ( β S h M = 0.235917108, β S h F = 0.932850297). In the second one, a greater importance is given to balancing the ShF ( β S h M = 0.924195224, β S h F = 0.270900009). Finally, in the third solution, the same importance is given to balancing both the ShF and ShM ( β S h M = 0.580111266, β S h F = 0.558041831). These solutions are detailed below.
  • In the first solution, a greater importance is given to balancing the ShM. This is achieved by choosing the minimum value of index β S h M ( β S h M = 0. 235917108), which allows us to obtain an improvement of 76.4% without considering any improvement of the ShF ( β S h F = 0.932850297). The following variables values correspond to this solution:
x c 1 = 0.02611622 y c 1 = 0.033186164 t c 1 = 0.021370695
x c 2 = 0.06 y c 2 = 0.012314794 t c 2 = 0.039459546
x c 3 = 0.06 y c 3 = 0.016752092 t c 3 = 0.039814955
x c 4 = 0.002045161 y c 4 = 0.000151565 t c 4 = 0.005
x c 5 = 0.001614171 y c 5 = 0.00639164 t c 5 = 0.005106848
2.
The second chosen solution in the Pareto front is the one with the minimum value in β S h F ( β S h F = 0.270900009), which achieves an improvement of 72.91% in balancing the ShM. This choice assigns no importance to the balancing of the ShM ( β S h M = 0.924195224). This solution yields to the following variable values:
x c 1 = 0.049437705 y c 1 = 0.04279353 t c 1 = 0.0074319
x c 2 = 0.06 y c 2 = 0.001485936 t c 2 = 0.038953174
x c 3 = 0.050813691 y c 3 = 0.017724236 t c 3 = 0.039660979
x c 4 = 0.001669535 y c 4 = 0.005996916 t c 4 = 0.005
x c 5 = 0.000387207 y c 5 = 0.013090811 t c 5 = 0.005
3.
The third chosen solution is the one in the Pareto front where both indexes are optimized ( β S h M = 0.580111266, β S h F = 0.558041831). By using this solution, the ShM is reduced by 41.99% and the ShF is reduced by 44.2%. It corresponds to the following variable values:
x c 1 = 0.06 y c 1 = 0.030069707 t c 1 = 0.006021448
x c 2 = 0.06 y c 2 = 0.00383543 t c 2 = 0.04
x c 3 = 0.06 y c 3 = 0.004650961 t c 3 = 0.028206906
x c 4 = 0.000606455 y c 4 = 0.001322538 t c 4 = 0.005416754
x c 5 = 0.000545683 y c 5 = 0.0000185 t c 5 = 0.005
To measure the method’s efficiency, we assessed two parameters: convergence and computing time. Figure 5 shows the process of convergence of the objective function f ( X ) as a function of generations. Six executions are presented with different γ values. Note that all executions exhibit values higher than 1.0 at the beginning of the execution (i.e., not optimized at all). After the 40th generation, all reach convergence (the closer the value to zero, the better), proving that the DE method actually optimizes the objective function.
Computing time is a major concern in the efficiency of optimization algorithms. To measure it, we executed 50 times the DE optimization procedure on a desktop computer with an Intel Core i7 processor (2.40 GHz), 8 GB RAM, and Windows 10 OS. The average computing time was 15.22 min with a standard deviation of 0.25 min. Being a mechanical design application, the optimization procedure does not require a fast or real-time computing but rather a practical one.

4.2. Dimensions of the Counterweights

An analysis is now presented to determine if the proposed boundaries for the optimization are the most suitable or if they should be modified (in case there is the possibility of changing them due to the mechanical constraints of the mechanism and its surrounding space).
Figure 6 shows the box plots of the partial derivatives of the objective function with respect to each of the variables to be optimized x n , y n , and t n for each of the n counterweights ( 1 n 5 ) when evaluated at the optimal solutions.
We can state that optimal boundaries have been found when all the values of the partial derivatives of the objective function are close to zero. In the box plots of Figure 6, it can be seen that the partial derivatives of the variables x 1 , y 1 , y 2 , y 3 , x 4 , y 4 , t 4 , x 5 , y 5 , and t 5 are close to zero, implying that the proposed boundaries allow such variables to reach their optimal values.
However, note that variables t 1 , x 2 , t 2 , x 3 , and t 3 have partial derivative values that are not close to zero. For example, in t 1 and even more significantly in x 2 and x 3 , the values tend to be greater than zero; hence, it can be deduced that better optimization results could be obtained if: (1) the thicknesses of counterweight 1 were smaller than the fixed boundary of 0.005 m (i.e., practically eliminating counterweight 1) and (2) the x-axis positions of counterweights 1 and 3 were less than the limit of 0.16 m (i.e., moving their CoM in their –x local axis).
On the other hand, the values of the partial derivatives of variables t 2 and t 3 tend to be less than zero, which means that, if possible, it would be convenient to further extend the boundaries of the optimization of these variables to values greater than 0.04 m.
Note that the information obtained from the Pareto front of the partial derivatives of the objective function is extremely useful to make decisions concerning the boundaries of the optimization, allowing us to foresee pertinent changes in the linkages as far as their mechanical conditions allow it.
Figure 7a shows the histograms of the volumes of the counterweights obtained from the different optimization results. Together with the analysis of the counterweights’ area and thickness shown in Figure 7b, it is possible to conclude that counterweight 4 can be eliminated: it has a very small volume compared to the other counterweights, and its thickness and area are practically negligible.
In addition, for both counterweights 2 and 3, it can be appreciated that their thickness tends to remain at the upper limit of the optimization, thus confirming the result of the partial derivatives analysis: if the mechanical characteristics of the mechanism allow it, it would be advisable to extend the upper limit of their thicknesses.

4.3. Implementation

The optimization method and the dimensional analysis conclude with the design of a solution that effectively reduces the dynamic reactions of the six-bar mechanism.
Let us consider the third case where both ShF and ShM are optimized. Figure 8 shows the proposed implementation. As suggested by the analysis, counterweight 4 has been eliminated. Note that counterweight 5 is not visible because it exhibits very small dimensions in relation to the mechanism. Yet, it has been considered for the dynamic balancing of the mechanism.

4.4. Optimization with Four or Less Counterweights

The previous analysis suggested that not all five counterweights are strictly needed to balance the six-bar mechanism: counterweight 4 is meaningless and counterweight 5 is so small that it can be practically eliminated. When seeking a simple solution, i.e., one that does not involve adding too much volume to the mechanism, it may be useful to reduce the number of counterweights as long as they still provide acceptable results.
We performed the same analysis for four, three, two, and one counterweights. Figure 9 shows a comparison between the Pareto fronts of the different optimization results as a function of the number of counterweights. Note that as expected, similar results are obtained when using five, four, and three counterweights. So, a general conclusion for the implementation would be to use three counterweights.
Table 3 summarizes the results obtained. The best results are highlighted in blue. Again, the best choice depends on the desired balancing: only the ShF, only the ShM, or both.

5. Discussion

The implementation of well-designed counterweights allows us to reduce the ShF and ShM by 76.82% and 77.21%, respectively, when importance is given to either of them and by 45.69% and 46.81%, respectively, when equal importance is given to both of them.
Table 4 compares our balancing results with others previously reported in the literature. Note that the comparison is limited to the cases where either the ShF or the ShM are optimized as not all the studies report the joint optimization. Table 4 includes other types of mechanisms such as the crank-slider and the four-bar mechanism, which are indeed simpler structures and thus easier to optimize. Six-bar mechanisms and their balancing are more complex and less frequently found in the literature because, as explained in Section 2, they exhibit a higher number of links with some defined by three basic points.
Note that the use of FFC to define the mass matrix of a mechanism and thus obtain the expressions representing the dynamic reactions in its base, in conjunction with an optimization algorithm, is a suitable methodology for the complete balancing of mechanisms. Our previous work in crank-sliders [51] and four-bar [38] mechanisms confirm the efficiency of the proposed approach. The results obtained surpass those of approaches using Cartesian coordinates (CC).
The DE optimization method was successfully applied to solve the balancing problem of a six-bar mechanism. DE is a simple yet robust approach to address multiobjective problems.
Comparison between Pareto fronts has proven to be a useful tool for better visualizing the impact of each counterweight on the dynamic balancing of the mechanism.
The effectiveness of the analysis of the boundaries by means of box plots of the partial derivatives of the variables to be optimized together with the histograms of volumes and relations between area and thickens were also demonstrated. They ease the visualization of possible improvements on the counterweights and allow us to make useful decisions on their implementation.
Balancing six-bar mechanisms is highly appreciated in areas such as mobile robotics, since this type of linkage is used in humanoid robots [54] and bionic legs [55,56] as well as in rehabilitation engineering [57], in which balancing could minimize the reactions caused by the devices’ motion, thus improving their performance and usability.

6. Conclusions

This paper has presented a novel approach for the complete (or dynamic) balancing of mechanisms: the use of fully Cartesian coordinates (FCC) in conjunction with an optimization method such as Differential Evolution (DE).
Among the main contributions of this paper is the development of the two-dimensional mass matrix for elements defined by three basic points. To our knowledge, this matrix has not been proposed so far in the literature and it can be applied to a vast number of more complex mechanisms that use type of linkages. By using FCC, this work has demonstrated that even for the most complex mechanisms, it is possible to obtain relatively simple non-trigonometric equations that define the ShF and ShM and to further optimize their dynamic balancing with algorithms such as DE with very good results.
As future work, it is expected to continue exploring FCC together with other metaheuristic methods to optimize more complex mechanisms in two and three dimensions. Our approach promises to be highly efficient for optimizing the balancing conditions of even more complex mechanisms once their mass matrices have been defined.

Author Contributions

Conceptualization, M.A. and M.T.O.-G.; methodology, M.T.O.-G. and C.N.S.; simulation, M.T.O.-G.; validation, D.U.C.-D., P.V. and R.V.; formal analysis, M.A., R.V. and A.A.G.; investigation, M.T.O.-G., M.A. and R.V.; writing—original draft preparation, M.T.O.-G.; writing—review and editing, R.V. and P.V.; visualization, D.U.C.-D. and A.A.G.; supervision, M.A. and R.V. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
CCCartesian Coordinates
FCCFully Cartesian Coordinates
ShFShaking Force
ShMShaking Moment
CoMCenter of Mass
DEDifferential Evolution

Appendix A. Mass-Matrix for Individual Linkages

It is necessary to define the mass matrix for each of the linkages in order to assemble the mass matrix of the entire mechanism.
Given that each counterweight is firmly attached to its corresponding link and that their position with respect to the local reference system does not change with the mechanism’s motion, it is possible to consider five linkages to be optimized, each of them encompassing a link and a counterweight.
Linkages 1 and 3 have mass matrices consisting of three basic points, while linkages 2, 4, and 5 have mass matrices involving two basic points.
To define the different mass matrices, it is necessary to substitute the terms m, x ¯ g , y ¯ g , I x , I y , I x y , and I z in the equations that define the mass matrices of two and three points, considering the contribution of both the link and the counterweight. Thus, for each n linkage, Equations (A1)–(A7) can be written.
m n = m b n + m c n = m b n + ρ π t c n ( x c n 2 + y c n 2 )
x g n = x b n m b n + x c n m c n m b n + m c n
y g n = y b n m b n + y c n m c n m b n + m c n
I x n = I x b n + I x c n = I x b n + 1 4 ρ π t c n ( x c n 2 + y c n 2 ) ( x c n 2 + 5 y c n 2 )
I y n = I y b n + I y c n = I y b n + 1 4 ρ π t c n ( x c n 2 + y c n 2 ) ( 5 x c n 2 + y c n 2 )
I x y n = I x y b n + I x y c n = I x y b n + ρ π t c n ( x c n 2 + y c n 2 ) x c n y c n
I z n = I z b n + I z c n = I x b n + I y b n + I x c n + I y c n

Appendix A.1. Mass Matrix for Linkages 1 and 3

To define the mass matrix of linkage 1, let us consider point C as i, point E as j, and point D as k. Similarly, for linkage 3, point B is considered as i, point F as j, and point E as k.
Figure A1 shows the distances K x 1 , K y 1 , K x 3 , and K y 3 . Note that for linkage 1, l i j = l 1 corresponds to the distance C E ¯ while for linkage 2, l i j = l 2 corresponds to the distance B F ¯ .
Figure A1. Linkages defined by three basic points. (a) Linkage 1. (b) Linkage 3.
Figure A1. Linkages defined by three basic points. (a) Linkage 1. (b) Linkage 3.
Mathematics 10 01830 g0a1
By using the mass matrix M 3 P (Equation (24)), the terms of the mass matrix for linkages n = 1 and n = 3 can be defined according to Equations (A8)–(A13).
e n = I x b n K x n 2 K y n 2 l n 2 2 I x b n K x n K y n 2 l n + I x b n K y n 2 2 I x y b n K x n K y n l n 2 + 2 I x y b n K y n l n + I y b n l n 2 + π K x n 2 ρ c n t c n x c n 4 4 K y n 2 l n 2 + 3 π K x n 2 ρ c n t c n x c n 2 2 K y n 2 l n 2 y c n 2 + 5 π K x n 2 ρ c n t c n y c n 4 4 K y n 2 l n 2 + 2 K x n m b n y b n K y n l n + 2 π K x n ρ c n K y n l n t c n x c n 2 y c n + 2 π K x n ρ c n K y n l n t c n y c n 3 2 π K x n ρ c n K y n l n 2 t c n x c n 3 y c n 2 π K x n ρ c n K y n l n 2 t c n x c n y c n 3 π K x n ρ c n t c n x c n 4 2 K y n 2 l n 3 π K x n ρ c n K y n 2 l n t c n x c n 2 y c n 2 5 π K x n ρ c n t c n y c n 4 2 K y n 2 l n 2 m b n 2 x b n l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 m b n 2 y b n K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x b n x c n 2 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x b n y c n 2 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x c n 3 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x c n 2 y b n K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x c n 2 y c n K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π m b n ρ c n t c n x c n y c n 2 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π m b n ρ c n t c n y b n y c n 2 K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π m b n ρ c n t c n y c n 3 K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π 2 ρ c n 2 t c n 2 x c n 5 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π 2 ρ c n 2 t c n 2 x c n 4 y c n K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 4 π 2 ρ c n 2 t c n 2 x c n 3 y c n 2 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 4 π 2 ρ c n 2 t c n 2 x c n 2 y c n 3 K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 2 π 2 ρ c n 2 t c n 2 x c n y c n 4 l n m b n + π l n ρ c n t c n x c n 2 + π l n ρ c n t c n y c n 2 2 π 2 ρ c n 2 t c n 2 y c n 5 K y n m b n + π K y n ρ c n t c n x c n 2 + π K y n ρ c n t c n y c n 2 + 1 + 5 π ρ c n t c n 4 l n 2 x c n 4 + 3 π ρ c n t c n 2 l n 2 x c n 2 y c n 2 + π ρ c n t c n y c n 4 4 l n 2 + 2 π ρ c n t c n K y n l n x c n 3 y c n + 2 π ρ c n t c n K y n l n x c n y c n 3 + π ρ c n t c n x c n 4 4 K y n 2 + 3 π ρ c n t c n 2 K y n 2 x c n 2 y c n 2 + 5 π ρ c n t c n 4 K y n 2 y c n 4
f n = I x b n K x n 2 K y n 2 l n 2 + I x b n K x n K y n 2 l n + 2 I x y b n K x n K y n l n 2 I x y b n K y n l n I y b n l n 2 π K x n 2 ρ c n t c n x c n 4 4 K y n 2 l n 2 3 π K x n 2 ρ c n t c n x c n 2 2 K y n 2 l n 2 y c n 2 5 π K x n 2 ρ c n t c n y c n 4 4 K y n 2 l n 2 K x n m b n y b n K y n l n π K x n ρ c n t c n K y n l n x c n 2 y c n π K x n ρ c n t c n K y n l n y c n 3 + 2 π K x n ρ c n K y n l n 2 t c n x c n 3 y c n + 2 π K x n ρ c n K y n l n 2 t c n x c n y c n 3 + π K x n ρ c n t c n x c n 4 4 K y n 2 l n + 3 π K x n ρ c n t c n x c n 2 2 K y n 2 l n y c n 2 + 5 π K x n ρ c n t c n y c n 4 4 K y n 2 l n + m b n x b n l n + π ρ c n l n t c n x c n 3 + π ρ c n l n t c n x c n y c n 2 5 π ρ c n t c n 4 l n 2 x c n 4 3 π ρ c n t c n 2 l n 2 x c n 2 y c n 2 π ρ c n t c n y c n 4 4 l n 2 π ρ c n t c n y c n K y n l n x c n 3 π ρ c n t c n x c n K y n l n y c n 3
g n = I x b n K x n K y n 2 l n I x b n K y n 2 I x y b n K y n l n + π K x n ρ c n t c n x c n 4 4 K y n 2 l n + 3 π K x n ρ c n t c n x c n 2 2 K y n 2 l n y c n 2 + 5 π K x n ρ c n t c n y c n 4 4 K y n 2 l n + m b n y b n K y n + π ρ c n K y n t c n x c n 2 y c n + π ρ c n K y n t c n y c n 3 π ρ c n t c n y c n K y n l n x c n 3 π ρ c n t c n x c n K y n l n y c n 3 π ρ c n t c n x c n 4 4 K y n 2 3 π ρ c n t c n 2 K y n 2 x c n 2 y c n 2 5 π ρ c n t c n 4 K y n 2 y c n 4
h n = I x b n K x n 2 K y n 2 l n 2 2 I x y b n K x n K y n l n 2 + I y b n l n 2 + π K x n 2 ρ c n t c n x c n 4 4 K y n 2 l n 2 + 3 π K x n 2 ρ c n t c n x c n 2 2 K y n 2 l n 2 y c n 2 + 5 π K x n 2 ρ c n t c n y c n 4 4 K y n 2 l n 2 2 π K x n ρ c n K y n l n 2 t c n x c n 3 y c n 2 π K x n ρ c n K y n l n 2 t c n x c n y c n 3 + 5 π ρ c n t c n 4 l n 2 x c n 4 + 3 π ρ c n t c n 2 l n 2 x c n 2 y c n 2 + π ρ c n t c n y c n 4 4 l n 2
i n = I x b n K x n K y n 2 l n + I x y b n K y n l n π K x n ρ c n t c n x c n 4 4 K y n 2 l n 3 π K x n ρ c n t c n x c n 2 2 K y n 2 l n y c n 2 5 π K x n ρ c n t c n y c n 4 4 K y n 2 l n + π ρ c n t c n y c n K y n l n x c n 3 + π ρ c n t c n x c n K y n l n y c n 3
j n = I x b n K y n 2 + π ρ c n t c n x c n 4 4 K y n 2 + 3 π ρ c n t c n 2 K y n 2 x c n 2 y c n 2 + 5 π ρ c n t c n 4 K y n 2 y c n 4

Appendix A.2. Mass Matrix for Linkages 2, 4, and 5

Linkages 2, 4, and 5 are defined by two basic points. For linkage 2, point A is considered as i while point C is considered as j; for linkage 4, point D is considered as i while point G is considered as j; for linkage 5, point F is considered as i while point G is considered as j. Each of them have their origin at point i and the x axis directed toward point j. For each linkage, l n is the distance between points i and j.
By substituting the corresponding terms in the mass matrix of the elements defined by two basic points M 2 P (equation can be found in [38]), it is possible to obtain the terms of the mass matrix of each of these elements consisting of a counterweight and a linkage (Equations (A14)–(A17)).
a n = m b n + π ρ c n t c n x c n 2 + y c n 2 1 l n m b n + π ρ c n t c n x c n 2 + y c n 2 2.0 m b n + 2.0 π ρ c n t c n x c n 2 + y c n 2 m b n x b n + π ρ c n t c n x c n x c n 2 + y c n 2 + 1 l n 2 I b n + π ρ c n t c n x c n 2 x c n 2 + y c n 2 + π ρ c n t c n y c n 2 x c n 2 + y c n 2 + 0.5 π ρ c n t c n x c n 2 + y c n 2 2
b n = 1 l n m b n x b n + π ρ c n t c n x c n x c n 2 + y c n 2 1 l n 2 I b n + π ρ c n t c n x c n 2 x c n 2 + y c n 2 + π ρ c n t c n y c n 2 x c n 2 + y c n 2 + 0.5 π ρ c n t c n x c n 2 + y c n 2 2
c n = 1 l n m b n + π ρ c n t c n x c n 2 + y c n 2 m b n π ρ c n t c n x c n 2 + y c n 2 m b n y b n + π ρ c n t c n y c n x c n 2 + y c n 2
d n = 1 l n 2 I b n + π ρ c n t c n x c n 2 x c n 2 + y c n 2 + π ρ c n t c n y c n 2 x c n 2 + y c n 2 + 0.5 π ρ c n t c n x c n 2 + y c n 2 2

References

  1. Arakelian, V.; Briot, S. Balancing of Linkages and Robot Manipulators. Mechanisms and Machine Science; Springer International Publishing: Cham, Switzerland, 2015; Volume 27. [Google Scholar]
  2. Uicker, J.J.; Pennock, G.R.; Shigley, J.E. Theory of Machines and Mechanisms, 5th ed.; Oxford University Press: New York, NY, USA, 2016. [Google Scholar]
  3. Waldron, K.J.; Kinzel, G.L. Kinematics, Dynamics, and Design of Machinery, 2nd ed.; John Wiley: Hoboken, NJ, USA, 2004. [Google Scholar]
  4. Arakelian, V.; Dahan, M.; Smith, M.A. Historical review of the evolution of the theory on balancing of mechanisms. In Symposium on History of Machines and Mechanisms Proceedings HMM 2000; Ceccarelli, M., Ed.; Springer: Dordrecht, The Netherlands, 2000; pp. 291–300. [Google Scholar]
  5. Arakelian, V. Inertia forces and moments balancing in robot manipulators: A review. Adv. Robot. 2017, 31, 717–726. [Google Scholar] [CrossRef]
  6. Wei, B.; Zhang, D. A review of dynamic balancing for robotic mechanisms. Robotica 2021, 39, 55–71. [Google Scholar] [CrossRef]
  7. Fisher, O. Über die reduzierten Systeme und die Hauptpunkte der Glieder eines Gelenkmechanismus und ihre Bedeutung für die technische Mechanik. Z. Für Angew. Math. Und Phys. 1902, 47, 429–466. [Google Scholar]
  8. Goryachkin, V.P. The forces of inertia and their balancing. In Collection of Scientific Works; Kolos: Moscow, Russia, 1914; pp. 283–418. [Google Scholar]
  9. Yudin, V. The Balancing of Machines and Their Stability; Edition of Academy of Red Army: Moscow, Russia, 1941; 124p. [Google Scholar]
  10. Kreutzinger, R. Über die bewegung des Schwerpunktes beim Kurbelgetriebe. Getriebetechnik 1942, 10, 397–398. [Google Scholar]
  11. Maxwell, R.L. Kinematics and Dynamics of Machinery, 1st ed.; Prentice Hall: Englewood Cliff, NJ, USA, 1960. [Google Scholar]
  12. Smith, M.R.; Maundert, L. Inertia forces in a four-bar linkage. J. Mech. Eng. Sci. 1967, 9, 218–225. [Google Scholar] [CrossRef]
  13. Talbourdet, G.L.; Shepler, P.R. Mathematical solution of 4-bar linkages-IV. Balancing of linkages. Mach. Des. 1941, 13, 73–77. [Google Scholar]
  14. Lanchester, F.W. Engine Balancing. Inst. Automob. Eng. 1914, 8, 195–271. [Google Scholar] [CrossRef]
  15. Root, R.E. Dynamics of Engine and Shaft; John Wiley: New York, NY, USA, 1932. [Google Scholar]
  16. Artobolevsky, I.I.; Edelshtein, B.V. Methods of Inertia Calculation for Mechanisms of Agricultural Machines; Selkhozizdate: Moscow, Russia, 1935. [Google Scholar]
  17. Gheronimus, Y.L. An approximate method of calculating a counterweight for the balancing of vertical inertia forces. Mechanisms 1968, 3, 283–288. [Google Scholar] [CrossRef]
  18. Doucet, E. Équilibrage dynamique des moteurs en ligne. Tech. Automob. Arienne 1946, 37, 30–31. [Google Scholar]
  19. Emod, I.; Jurek, A. Massenausgleich am Kurbelgetriebe von Sechszylinder-viertakt-V-motoren mit 6 Kurbeln und 60 Zylinderwinkeln. Period. Polytech. Mech. Eng. 1967, 3–4, 205–211. [Google Scholar]
  20. Semenov, M.V. The synthesis of partly balanced plane mechanisms. Mechanisms 1968, 3, 339–353. [Google Scholar] [CrossRef]
  21. Berkof, R.S.; Lowen, G.G. A new method for complete force balancing simple linkages. J. Eng. Ind. 1969, 91B, 21–26. [Google Scholar] [CrossRef]
  22. Smith, M.R. Dynamic analysis and balancing of linkages with interactive computer graphics. Comput. Aided Des. 1975, 7, 15–19. [Google Scholar] [CrossRef]
  23. Tepper, F.R.; Lowen, G.G. General theorems concerning full force balancing of planar linkages by internal mass redistribution. J. Eng. Ind. 1972, 94, 789–796. [Google Scholar] [CrossRef]
  24. Berkof, R.S. Complete force and moment balancing of inline four-bar linkages. Mech. Mach. Theory 1973, 8, 397–410. [Google Scholar] [CrossRef]
  25. Wiederrich, J.L.; Roth, B. Momentum balancing of four-bar linkages. J. Manuf. Sci. Eng. 1976, 4, 1289–1295. [Google Scholar] [CrossRef]
  26. Dresig, H.; Jacobi, P. Vollständiger trägheitskraftausgleich von ebenen koppelgetrieben durch anbringen eines zweischlages. Maschinenbautechnik 1974, 23, 5–8. [Google Scholar]
  27. Feng, G. Complete Shaking Force and Shaking Moment balancing of four types of six-bar linkages. Mech. Mach. Theory 1989, 24, 275–287. [Google Scholar] [CrossRef]
  28. Kochev, I.S. Active balancing of the frame Shaking Moment in high speed planar machines. Mech. Mach. Theory 1992, 27, 53–58. [Google Scholar] [CrossRef]
  29. de Jong, J.J.; van Dijk, J.; Herder, J.L. A screw based methodology for instantaneous dynamic balance. Mech. Mach. Theory 2019, 141, 267–282. [Google Scholar] [CrossRef]
  30. Acevedo, M.; Orvañanos-Guerrero, M.T.; Velázquez, R.; Arakelian, V. An alternative method for Shaking Force balancing of the 3RRR PPM through acceleration control of the center of mass. Appl. Sci. 2020, 10, 1351. [Google Scholar] [CrossRef] [Green Version]
  31. Meijaard, J.P.; van der Wijk, V. Dynamic balancing of mechanisms with flexible links. Mech. Mach. Theory 2022, 172, 104784. [Google Scholar] [CrossRef]
  32. Segla, S.; Kalker-Kalman, C.M.; Schwab, A.L. Statical balancing of a robot mechanism with the aid of a genetic algorithm. Mech. Mach. Theory 1998, 33, 163–174. [Google Scholar] [CrossRef]
  33. Farmani, M.; Jaamialahmadi, A.; Babaie, M. Multiobjective optimization for force and moment balance of a four-bar linkage using evolutionary algorithms. J. Mech. Sci. Technol. 2011, 25, 2971–2977. [Google Scholar] [CrossRef]
  34. Zamuda, A.; Brest, J.; Boskovic, B.; Zumer, V. Differential evolution for multiobjective optimization with self adaptation. In Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore, 25–28 September 2007. [Google Scholar]
  35. Erkaya, S. Investigation of balancing problem for a planar mechanism using genetic algorithm. J. Mech. Sci. Technol. 2013, 27, 2153–2160. [Google Scholar] [CrossRef]
  36. Bošković, M.; Šalinić, S.; Bulatović, R.; Miodragović, G. Multiobjective optimization for dynamic balancing of four-bar mechanism. In Proceedings of the 6th International Congress of Serbian Society of Mechanics, Mountain Tara, Serbia, 19–21 June 2017. [Google Scholar]
  37. García de Jalón, J. Twenty-five years of natural coordinates. Multibody Syst. Dyn. 2007, 18, 15–33. [Google Scholar] [CrossRef]
  38. Orvañanos-Guerrero, M.T.; Sánchez, C.N.; Rivera, M.; Acevedo, M.; Velázquez, R. Gradient descent-based optimization method of a four-bar mechanism using Fully Cartesian coordinates. Appl. Sci. 2019, 9, 4115. [Google Scholar] [CrossRef] [Green Version]
  39. Acevedo, M.; Orvañanos-Guerrero, M.T.; Velázquez, R.; Haro, E. Optimum balancing of the four-bar linkage using Fully Cartesian coordinates. IEEE Lat. Am. Trans. 2019, 17, 983–990. [Google Scholar] [CrossRef]
  40. Bourbonnais, F.; Bigras, P.; Bonev, I.A. Minimum-time trajectory planning and control of a pick-and-place five-bar parallel robot. IEEE/ASME Trans. Mechatron. 2015, 20, 740–749. [Google Scholar] [CrossRef]
  41. Wang, D.; Wang, L.; Wu, J.; Ye, H. An experimental study on the dynamics calibration of a 3-DOF parallel tool head. IEEE/ASME Trans. Mechatron. 2019, 24, 2931–2941. [Google Scholar]
  42. Pennock, G.R.; Israr, A. Kinematic analysis and synthesis of an adjustable six-bar linkage. Mech. Mach. Theory 2009, 44, 306–323. [Google Scholar] [CrossRef]
  43. García de Jalón, J.; Bayo, E. Kinematic and Dynamic Simulation of Multibody Systems: The Real-Time Challenge; Springer: New York, NY, USA, 1994. [Google Scholar]
  44. Storn, R.; Price, K. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  45. Das, A.K.; Mishra, D.; Das, K.; Mallick, P.K.; Kumar, S.; Zymbler, M.; El-Sayed, H. Prophesying the short-term dynamics of the crude oil future price by adopting the survival of the fittest principle of improved grey optimization and extreme learning machine. Mathematics 2022, 10, 1121. [Google Scholar] [CrossRef]
  46. Álvarez Gutiérrez, D.; Sánchez Lasheras, F.; Martín Sánchez, V.; Suárez Gómez, S.L.; Moreno, V.; Moratalla-Navarro, F.; Molina de la Torre, A.J. A new algorithm for multivariate genome wide association studies based on differential evolution and extreme learning machines. Mathematics 2022, 10, 1024. [Google Scholar] [CrossRef]
  47. Bergstra, J.; Bengio, Y. Random search for hyper-parameter optimization. J. Mach. Learn. Res. 2012, 13, 281–305. [Google Scholar]
  48. Etesami, G.; Felezi, M.E.; Nariman-Zadeh, N. Pareto optimal multi-objective dynamical balancing of a slider-crank mechanism using differential evolution algorithm. Int. J. Automot. Eng. 2019, 9, 3021–3032. [Google Scholar]
  49. Chaudhary, K.; Chaudhary, H. Optimal design of planar slider-crank mechanism using teaching-learning-based optimization algorithm. J. Mech. Sci. Technol. 2015, 29, 5189–5198. [Google Scholar] [CrossRef]
  50. Chaudhary, K.; Chaudhary, H. Optimum balancing of slider-crank mechanism using equimomental system of point-masses. Procedia Technol. 2014, 14, 35–42. [Google Scholar] [CrossRef] [Green Version]
  51. Orvañanos-Guerrero, M.T.; Acevedo, M.; Sánchez, C.N.; Giannoccaro, N.I.; Visconti, P.; Velázquez, R. Efficient balancing optimization of a simplified slider-crank mechanism. In Proceedings of the 2020 IEEE ANDESCON, Quito, Ecuador, 13–16 October 2020. [Google Scholar]
  52. Chaudhary, K.; Chaudhary, H. Shape optimization of dynamically balanced planar four-bar mechanism. Procedia Comput. Sci. 2015, 57, 519–526. [Google Scholar] [CrossRef] [Green Version]
  53. Belleri, B.K.; Kerur, S.B. Balancing of planar six-bar mechanism with genetic algorithm. J. Mech. Energy Eng. 2020, 4, 303–308. [Google Scholar] [CrossRef]
  54. Hernández, E.; Velázquez, R.; Macías-Quijas, R.; Pissaloux, E.; Giannoccaro, N.I.; Lay-Ekuakille, A. Kinematic computations for small-size humanoid robot KUBO. ARPN J. Eng. Appl. Sci. 2017, 12, 7311–7320. [Google Scholar]
  55. Xu, K.; Liu, H.; Zhu, X.; Song, Y. Kinematic analysis of a novel planar six-bar bionic leg. Mech. Mach. Sci. 2019, 73, 13–21. [Google Scholar]
  56. Velázquez, R.; Garzón-Castro, C.L.; Acevedo, M.; Orvañanos-Guerrero, M.T.; Ghavifekr, A.A. Design and characterization of a miniature bio-inspired mobile robot. In Proceedings of the 2021 12th International Symposium on Advanced Topics in Electrical Engineering, Bucharest, Romania, 25–27 March 2021. [Google Scholar]
  57. Shao, Y.; Xiang, Z.; Liu, H.; Li, L. Conceptual design and dimensional synthesis of cam-linkage mechanisms for gait rehabilitation. Mech. Mach. Theory 2016, 104, 31–42. [Google Scholar] [CrossRef]
Figure 1. A 2D element with three basic points (i, j, and k).
Figure 1. A 2D element with three basic points (i, j, and k).
Mathematics 10 01830 g001
Figure 2. The six-bar mechanism.
Figure 2. The six-bar mechanism.
Mathematics 10 01830 g002
Figure 3. Six-bar mechanism with cylindrical counterweights.
Figure 3. Six-bar mechanism with cylindrical counterweights.
Mathematics 10 01830 g003
Figure 4. Pareto analysis of the optimization objectives: β S h M and β S h F . (a) Optimized β S h M and β S h F according to γ . (b) Pareto Front of the optimized objectives.
Figure 4. Pareto analysis of the optimization objectives: β S h M and β S h F . (a) Optimized β S h M and β S h F according to γ . (b) Pareto Front of the optimized objectives.
Mathematics 10 01830 g004
Figure 5. The convergence of the objective function f ( X ) with the DE method.
Figure 5. The convergence of the objective function f ( X ) with the DE method.
Mathematics 10 01830 g005
Figure 6. Box plots of partial derivatives of the objective function with respect to each optimization variable when using five counterweights.
Figure 6. Box plots of partial derivatives of the objective function with respect to each optimization variable when using five counterweights.
Mathematics 10 01830 g006
Figure 7. Dimensional analysis for the five counterweights balancing the six-bar mechanism. (a) Volumes of the five counterweights. (b) Relationship between the area and the thickness for the five counterweights.
Figure 7. Dimensional analysis for the five counterweights balancing the six-bar mechanism. (a) Volumes of the five counterweights. (b) Relationship between the area and the thickness for the five counterweights.
Mathematics 10 01830 g007
Figure 8. Conceptual implementation of the third solution from the Pareto front for the six-bar mechanism using five counterweights C i .
Figure 8. Conceptual implementation of the third solution from the Pareto front for the six-bar mechanism using five counterweights C i .
Mathematics 10 01830 g008
Figure 9. Pareto front comparison of the optimization objectives β S h M and β S h F according to the number of counterweights.
Figure 9. Pareto front comparison of the optimization objectives β S h M and β S h F according to the number of counterweights.
Mathematics 10 01830 g009
Table 1. Point distribution for the six-bar mechanism.
Table 1. Point distribution for the six-bar mechanism.
ElementPoint iPoint jPoint k
1CED
2AC
3BFE
4DG
5FG
Table 2. Parameters of the six-bar mechanism used in the example. Those indicated with a ‘-’ are not necessary for the numerical analysis.
Table 2. Parameters of the six-bar mechanism used in the example. Those indicated with a ‘-’ are not necessary for the numerical analysis.
Link
n
12345
Mass
m b n
[kg]
0.69350.10220.96360.18250.1679
Length
l n
[m]
0.190.140.134164080.250.23
Inertia
I x b n
[ kg m / s 2 ]
0.00116161-0.00622646--
Inertia
I y b n
[ kg m / s 2 ]
0.00556534-0.00657336--
Inertia
I z b n
[ kg m / s 2 ]
-0.00066856-0.003803600.00296204
Inertia
I x y b n
[ kg m / s 2 ]
0.00167596-0.00522914--
CoM
x b n [m]
0.080.070.077517020.1250.115
CoM
y b n [m]
0.033333330.00.065591330.00.0
K x [m]0.05-0.09838699--
K y [m]0.1-0.196677398--
Table 3. Summary of the optimization results for the six-bar mechanism balancing.
Table 3. Summary of the optimization results for the six-bar mechanism balancing.
CounterweightsShF OptimizationShM OptimizationShF and ShM Optimization
Cn% ShF, % ShM% ShF, % ShM% ShF, % ShM
All 572.91, 7.596.72, 76.4144.2, 41.99
C1, C2, C3, C476.82, 3.593.21, 76.9744.31, 40.73
C1, C2, C375.95, 0.53.53, 77.2145.69, 46.81
C2, C356.98, 6.520.17, 6741.66, 34.18
C344.97, 2.261.03, 6128.69, 30.23
Table 4. Comparison of balancing results for several types of mechanisms and optimization methods.
Table 4. Comparison of balancing results for several types of mechanisms and optimization methods.
Reference,MechanismOptimization% of ShF% of ShM
CC or FCC AlgorithmOptimizationOptimization
[48], CCcrank-sliderDifferential Evolution61.4265.96
[49], CCcrank-sliderTeaching–Learning4844
[50], CCcrank-sliderGenetic4699
[51], FCCcrank-sliderDifferential Evolution97.7694.58
[52], CCfour-barGenetic5068
[36], CCfour-barFirefly86.383.39
[38], FCCfour-barGradient Descent99.7083.99
[53], CCsix-barGenetic48.532.35
This work, FCCsix-barDifferential Evolution76.8277.21
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Orvañanos-Guerrero, M.T.; Acevedo, M.; Sánchez, C.N.; Campos-Delgado, D.U.; Ghavifekr, A.A.; Visconti, P.; Velázquez, R. Complete Balancing of the Six-Bar Mechanism Using Fully Cartesian Coordinates and Multiobjective Differential Evolution Optimization. Mathematics 2022, 10, 1830. https://doi.org/10.3390/math10111830

AMA Style

Orvañanos-Guerrero MT, Acevedo M, Sánchez CN, Campos-Delgado DU, Ghavifekr AA, Visconti P, Velázquez R. Complete Balancing of the Six-Bar Mechanism Using Fully Cartesian Coordinates and Multiobjective Differential Evolution Optimization. Mathematics. 2022; 10(11):1830. https://doi.org/10.3390/math10111830

Chicago/Turabian Style

Orvañanos-Guerrero, María T., Mario Acevedo, Claudia N. Sánchez, Daniel U. Campos-Delgado, Amir Aminzadeh Ghavifekr, Paolo Visconti, and Ramiro Velázquez. 2022. "Complete Balancing of the Six-Bar Mechanism Using Fully Cartesian Coordinates and Multiobjective Differential Evolution Optimization" Mathematics 10, no. 11: 1830. https://doi.org/10.3390/math10111830

APA Style

Orvañanos-Guerrero, M. T., Acevedo, M., Sánchez, C. N., Campos-Delgado, D. U., Ghavifekr, A. A., Visconti, P., & Velázquez, R. (2022). Complete Balancing of the Six-Bar Mechanism Using Fully Cartesian Coordinates and Multiobjective Differential Evolution Optimization. Mathematics, 10(11), 1830. https://doi.org/10.3390/math10111830

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop