- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Table of Contents

Advances in Mechanical Engineering

Volume 2013 (2013), Article ID 757935, 13 pages

http://dx.doi.org/10.1155/2013/757935

## Optimum Path Synthesis of a Geared Five-Bar Mechanism

Department of Mechanical Engineering, De Lin Institute of Technology, 1 Lane 380, Qingyan Road, Tucheng 236, New Taipei City 23654, Taiwan

Received 29 October 2012; Revised 2 January 2013; Accepted 3 January 2013

Academic Editor: Marco Ceccarelli

Copyright © 2013 Wen-Yi Lin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Most studies on path synthesis problems are to trace simple or smooth trajectories. In this work, an optimum synthesis for several special trajectories generated by a geared five-bar mechanism is studied using the one-phase synthesis method. The synthesis problem for the special trajectories, which is originally studied using the two-phase synthesis method discussed in the literature, is a real challenge due to very few dimensionally proportioned mechanisms that can generate the special trajectories. The challenging special trajectories with up to 41 discrete points include a self-overlapping curve, nonsmooth curves with straight segments and vertices, and sophisticated shapes. The error function of the square deviation of positions is used as the objective function and the GA-DE evolutionary algorithm is used to solve the optimization problems. Findings show that the proposed method can obtain approximately matched trajectories at the cost of a tremendous number of evaluations of the objective function. Therefore, the challenging problems may serve as the benchmark problems to test the effectiveness and efficiency of synthesis methods and/or optimization algorithms. All the synthesized solutions have been validated using the animation of the SolidWorks assembly so that the obtained mechanisms are sound and usable.

#### 1. Introduction

The problem of path synthesis is to generate a definite mechanism whose coupler point can trace a desired trajectory or target points. The continuous trajectory may be represented by a sequence of discrete points. The path synthesis of four-bar mechanisms has been extensively studied. A geared five-bar mechanism, as shown in Figure 1, can provide more complex motions than a four-bar mechanism, since the former exceeds the latter in the number of design variables by five. In addition to the gearset (with and without idlers), the timing belt and pulleys can also be employed to derive the motions of links 2 and 5. Note that the kinematic effects of the geared five-bar mechanism (DOF is one) and the five-bar mechanism (DOF is two) are the same, if the gear ratio for the former and the ratio of angular velocity of the input link 5 to the input link 2 for the latter are the same and if the initial angular positions of links 2 and 5 for the former and the latter are the same. The only difference is that the latter needs two driver and the former needs one driver and a gearset. Roth and Freudenstein [1] proposed a numerical method for a path synthesis task with nine target points of a geared five-bar mechanism. Zhang et al. [2] produced an atlas containing 732 coupler curves for the symmetric geared five-bar mechanism and then used a nonlinear programming method in conjunction with the atlas as the initial guess for the optimal path synthesis of the mechanism. Starns and Flugrad [3] and Subbian and Flugrad [4] applied the continuation method to a path synthesis task with seven precision points of a geared five-bar mechanism. Nokleby and Podhorodeski [5] used a quasi-Newton optimization routine for the optimum path synthesis of a geared five-bar mechanism. These synthesis methods belong to the one-phase synthesis method, which attempts to simultaneously satisfy the shape, size, location, and orientation information of the desired trajectories. Recently, a two-phase synthesis method has been proposed in [6, 7] for path synthesis problems of four-bar mechanisms, where the first-phase synthesis is shape synthesis and the second-phase synthesis is scale, translation, and rotation synthesis [6]. Buśkiewicz [8] proposed a two-phase synthesis method using the function of the distance of the curve from its centroid (DCC) to describe the curve shape in terms of its normalized Fourier coefficients for the shape synthesis of a geared five-bar mechanism. A construction of a curve description (F-function) without referring to the harmonic analysis was also presented. The affinity of shapes is used as the objective function and an evolutionary algorithm is applied to solve the shape synthesis (shape optimization) problem. Five special trajectories with up to 40 discrete points for the geared five-bar mechanism are studied in [8] using the DCC, F-function, and curvature-based methods [7]. The special closed trajectories include a self-overlapping curve (ArcofEllipse), nonsmooth curves with straight segments and vertices (Triangle and Asteroid), and sophisticated shapes (GLetter and ParamCurve). The theme on such special trajectories is the first time to be studied in the literature. They claimed that the curves ParamCurve and GLetter are best synthesized by the DCC method, while the others by the curvature-based method; moreover, the DCC method approximates quite well the curve Gletter and Asteroid, for which the curvature-based method fails to achieve satisfactory results. The conclusion is that the DCC method gives satisfactory approximations. In [8], only the shape synthesis results are obtained. Furthermore, the degree of shape similarity redrawn according to their obtained synthesis parameters for several curves should be unsuccessful. Therefore, the synthesis problem for the special trajectories is a real challenge due to very few dimensionally proportioned mechanisms that can generate the special trajectories.

Regarding the synthesis methods discussed in the literature, they may be divided into two categories. The first category is the direct synthesis method without utilizing atlas database [1, 3–29]; the second category may be regarded as the indirect synthesis method using (computerized) atlas database [2, 30–34]. The direct synthesis method may be further divided into two subcategories. The first subcategory is one-phase synthesis [1, 3–5, 9–11, 14–29] and the second subcategory is two-phase synthesis [6–8, 12, 13] for the direct synthesis method. The two-phase synthesis method first handles the shape synthesis and then handles the scale-rotation-translation synthesis. Note that the two-phase synthesis method discussed in the literature cannot handle path synthesis problems with prescribed timing. Several optimization algorithms, including exact gradient [9], simulated annealing [13], genetic algorithm (GA) and modified GA [7, 8, 10, 11, 19, 23, 25], ant-gradient [6, 17, 26], genetic algorithm-fuzzy logic [24], differential evolution (DE) and modified DE [14–16, 18, 19, 21, 22, 27], particle swarm optimization [19], GA-DE [20, 28], and hybrid optimizer [29], are used to solve the optimization problems of path synthesis. In the one-phase synthesis method, the error function in [9–11, 14–22] is based on the sum of the square of Euclidean distance error (termed the square deviation in this study) between the target points and the corresponding coupler points. The error function in [23, 24] is based on the orientation structural error of the fixed link. References [25, 26] use other error functions as the objective function. Recently, Matekar and Gogate [27] proposed a modified distance error function for path synthesis problems with prescribed timing and obtained the lower transverse errors at the cost of the higher longitudinal errors because they thought the former is an indication of closeness between the generated and prescribed paths and the latter is an indication of the error in the timing. Sedano et al. [29] proposed a new error estimator defined by means of the precision points. Their error estimator enables the evaluation of the fitness of the function without influence of translation, rotation, and scaling effect.

In this work, the challenging path synthesis problems for the special trajectories generating by the geared five-bar mechanism is studied using the one-phase synthesis method, where the error function of the square deviation of positions is used as the objective function and the GA-DE evolutionary algorithm [20, 28] is used to solve the optimization problem.

#### 2. Kinematic Synthesis Formulation

Figure 1 depicts a stick diagram and all the geometric parameters of a geared five-bar mechanism with circular gears. Angle is the input angle in this work. In the previous studies, only Nokleby and Podhorodeski [5] considered the initial angular positions and of links 2 and 5, respectively, as design variables. The relation between angular positions and of links 2 and 5, respectively, can be expressed as where is the gear ratio. Because link 2 always can arrive at the orientation of , most researchers only utilize the initial angle of link 5 or so-called phase angle as a design variable. From (1), one may see that combined with the gear ratio has an influence on the angular position of link 5. It is worth noting that the same geared five-bar mechanism or the five-bar mechanism with different initial angular positions of link 2 may cause different kinematic effects.

##### 2.1. Design Variables

There are at least 14 design variables for path generation with prescribed timing, , , , , , , , , , , , and the number of revolutions of gears 2 and 5, denoted by and , respectively, to be optimized. The value of and should be specified in advance [5], because the variation of the value of , involved with the range of the rotation of link 2, may influence search quality (solution quality). In addition to 12 design variables, there are input angles () corresponding to discrete points or target points that need to be optimized for path generation without prescribed timing. Design variable vector is given as follows: where is the number of target points or discrete points to be optimized.

##### 2.2. Position Equations

The vector loop in the coordinate system is shown in Figure 1, and the corresponding vector loop equation in terms of the complex polar notation is expressed by Equation (3) can be transformed into two scalar equations as follows: Angles and can be solved from (4). The derivation of the expressions of and in terms of and is straightforward but tedious [35]. Angle is expressed as follows: where Only one configuration solution represented by the plus sign on the radical is considered in this study.

Coupler point in the coordinate system is shown in Figure 1, and the position of the coupler point in terms of the polar form is expressed by . Thus, the coordinates of coupler point in the coordinate system are expressed by The coordinates of the coupler point in the world coordinate system can be expressed by

##### 2.3. Design Objective and Constraints

In this work, the goal for the geared five-bar mechanism optimum synthesis problem is to minimize the error function of the square deviation of positions considered as the first part of the objective function, which may be expressed by where () and () denote the coordinates of the th desired point and the corresponding coupler point, respectively.

The full-rotatability condition for the geared five-bar mechanism may be expressed by where is the lengths of the longest link; and are the lengths of the two shortest links; and and are the lengths of the other two links.

The full-rotatability condition is inserted into the objective function as a penalty function as follows.

Minimize where indicates that the full-rotatability condition is true and indicates that the full-rotatability condition is false; is a constant with a large value that penalizes the objective function when the constraint fails.

The mean distance error between the target and coupler points is defined as

#### 3. GA-DE Evolutionary Algorithm

The GA-DE hybrid evolutionary algorithm can be found in [20, 28]. For completeness, it is briefly described in this section. A population with randomly generated chromosomes is initialized. Each chromosome (individual) is a candidate solution. The quality of the individual is estimated by the fitness value. Roulette-wheel selection is employed to allow those individuals with higher fitness to have a higher chance of being selected. Thereafter, two individuals are paired randomly to be parents. Offspring are generated using genetic operators, differential vector perturbation and mutation, from either one or two individuals. The technique of elitism [36] is employed in this work as follows: the best-so-far individual is always retained, replacing the current worst one, carrying on into the succeeding generation.

Here, genes represent variables encoded in terms of real numbers that fall between their bounds. All genes are grouped in a vector that represents a chromosome. That is,

##### 3.1. Initialization

An initial population with chromosomes is randomly generated. The gene in each chromosome is given by where is a random real number between 0 and 1.

##### 3.2. Differential Vector Perturbations

The differential vector perturbation of DE, with the best individual or some excellent individuals as the disturbed vectors, is employed to replace the crossover operation in RGA. Therefore, parents are used as differential vectors, not as crossover. All parents are randomly divided into groups corresponding to the top individuals, denoted by . These form the disturbed vectors. The value of is a user-defined integer. In the th group, the offspring may be generated by where and are the parents; and are random real numbers between 0 and 1 for each design variable.

A main perturbation rate is defined as the ratio of the expected number of offspring generated by differential vector perturbations to the total population size, while replacing crossover rate in RGA.

##### 3.3. Mutation

Here, mutation is performed to replace an entire, randomly selected chromosome with random real numbers (that are within the limits of variables). The minor perturbation rate , that is, mutation rate, is defined as the ratio of the expected number of offspring introduced by mutation to the total population size.

##### 3.4. Schemes

In order to obtain satisfactory evolution, several schemes are used [20]. First, the schemes of reassigning link lengths in a random way to satisfy the full-rotatability condition and rearranging input angles to satisfy CCW rotation for an initial population are used. Secondly, the constraint regarding design variables within the specified ranges may be achieved by assigning the values of design variables within their prescribed ranges during initialization and mutation operations. Furthermore, if the value obtained by the operation of differential vector perturbations is not within the prescribed range, one may repeat this operation (changing only random real numbers of and in (16)) until the value falls within the prescribed range. Lastly, the input angles are assigned values within the prescribed range only during initialization and mutation operations. It is allowable for the value of the input angle to exceed its limit during the course of evolution. Because of rearranging the input angles to satisfy CCW rotation during initialization and mutation operations, the constraint regarding the sequence of input angles satisfying the rotation order may be ignored until the end of the evolution, so long as the order of rotation of the input angles is satisfied in the final evolution. By the schemes and the mechanism of evolution, sound chromosomes may be obtained. The GA-DE algorithm generally has very good search ability. However, the GA-DE algorithm sometimes suffers the premature convergence especially for a difficult problem. In the GA-DE algorithm, a large population size and more excellent individuals as the disturbed vectors can be utilized to alleviate the premature convergence problem, together with more repeated runs [27, 28] to find satisfactory results.

#### 4. Results

Five path synthesis problems for the special trajectories, including Triangle, Asteroid, ParamCurve, ArcofEllipse, and GLetter curves, are studied. For all problems discussed here, let and . Thus, there are six cases that need to be performed to find the best values of and for one problem. The limits of the design variables are ; ; . The user-supplied parameters for the GA-DE evolutionary algorithm are described below. A population size of 800 is used for problem 1 with 22 discrete points and a population size of 1600 is used for other problems (GLetter curve with 40 target points and the other curves with 41 discrete points) for more accurate solutions. The top four individuals for Asteroid and ArcofEllipse curves and the top two individuals for other problems are used as the disturbed vectors. The number of generations is for all problems. The major perturbation rate is and the minor perturbation rate is . Fifty repeated runs in all problems are executed to find satisfactory results.

Since the kinematic effects of the geared five-bar mechanism and the five-bar mechanism can be the same, all the synthesis solutions in this work have been validated using the SolidWorks animators for the equivalent five-bar mechanisms so that the obtained mechanisms are sound and usable, which are shown in Appendices – (see Supplementary Material available online at http://dx.doi.org/10.1155/2013/757935) and [37].

##### 4.1. Problem 1: Triangle Curve with 22 Discrete Points

The discrete points for the Triangle curve are shown in Table 1. The synthesis design variables, the number () of evaluations of the objective function, the value of objective function, and the mean distance error are shown in Table 2, together with the synthesis solutions obtained by Buśkiewicz [8]. The input angles of the obtained optimum mechanism are shown in Table 3. Figure 2 shows the desired trajectory and the coupler curve obtained using the proposed method, together with the coupler curves obtained by Buśkiewicz [8]. The present coupler curve approximates fairly well the desired trajectory. The agreement in shape similarity between the desired trajectory and the coupler curves obtained using Buśkiewicz’s curvature-based and DCC methods [8] should be good. The SolidWorks animator for the equivalent optimum five-bar mechanism is shown in Appendix .

##### 4.2. Problem 2: Asteroid Curve with 41 Discrete Points

The Asteroid curve is defined by the parametric equation , , . There are 41 discrete points for the curve, where the value of for th point is . The synthesis design variables, the number of evaluations of the objective function, the value of objective function, and the mean distance error are shown in Table 4, together with the synthesis solutions obtained by Buśkiewicz [8]. The input angles of the obtained optimum mechanism are shown in Table 5. Figure 3 shows the desired trajectory and the coupler curve obtained using the proposed method, together with the coupler curves obtained by Buśkiewicz [8]. It can be seen that the present coupler curve approximates fairly well the desired trajectory. The SolidWorks animator for the equivalent optimum five-bar mechanism is shown in Appendix .

##### 4.3. Problem 3: ParamCurve Curve with 41 Discrete Points

The ParamCurve curve is defined by the parametric equation , , . There are 41 discrete points for the curve, where the value of for th point is . The synthesis design variables, the number of evaluations of the objective function, the value of objective function, and the mean distance error are shown in Table 6, together with the synthesis solutions obtained by Buśkiewicz [8]. The input angles of the obtained optimum mechanism are shown in Table 7. Figure 4 shows the desired trajectory and the coupler curve obtained using the proposed method, together with the coupler curves obtained by Buśkiewicz [8]. It can be seen that the present coupler curve approximates fairly well the desired trajectory. The SolidWorks animator for the equivalent optimum five-bar mechanism is shown in Appendix .

##### 4.4. Problem 4: ArcofEllipse Curve with 41 Discrete Points

The ArcofEllipse curve is defined by the parametric equation , , . The arc is traced for and then back to the starting point along the same path. There are 21 and 20 sampling points with the same spacing for the forward and backward paths, respectively. The synthesis design variables, the number of evaluations of the objective function, the value of objective function, and the mean distance error are shown in Table 8, together with the synthesis solutions obtained by Buśkiewicz [8]. The input angles of the obtained optimum mechanism are shown in Table 9. Figure 5 shows the desired trajectory and the coupler curve obtained using the proposed method, together with the coupler curves obtained by Buśkiewicz [8]. It can be seen again that the present coupler curve approximates fairly well the desired trajectory. The SolidWorks animator for the equivalent optimum five-bar mechanism is shown in Appendix .

##### 4.5. Problem 5: GLetter Curve with 40 Target Points

The target points for the GLetter curve are shown in Table 10. The synthesis design variables, the number of evaluations of the objective function, the value of objective function and the mean distance error are given in Table 11, together with the synthesis solutions obtained by Buśkiewicz [8]. The input angles of the obtained optimum mechanism are shown in Table 12. Figure 6 shows the desired trajectory and the coupler curve obtained using the proposed method, together with the coupler curves obtained by Buśkiewicz [8]. It can be seen that the present coupler curve approximates quite well the desired trajectory. The SolidWorks animator for the equivalent optimum five-bar mechanism is shown in Appendix .

#### 5. Conclusions

The challenging path synthesis problems for the special trajectories generating by the geared five-bar mechanism is studied using the one-phase synthesis method, where the error function of the square deviation of positions is used as the objective function and the GA-DE evolutionary algorithm is used to solve the optimization problem. The proposed method can obtain approximately matched trajectories at the cost of a tremendous number of evaluations of the objective function. Therefore, the challenging problems may serve as the benchmark problems to test the effectiveness and efficiency of synthesis methods and/or optimization algorithms. Using other synthesis methods (such as the two-phase synthesis method based on the state-of-the-art composite Fourier shape descriptor combining the center distance with the perimeter area function [38] or case-based approach using a neural network [33, 34]), the novel error estimator [29], other potential evolutionary algorithms [39, 40], or some techniques for enhancement of an initial elitist population might be the directions for future works to improve the accuracy or efficiency.

#### Acknowledgment

This work was supported by the National Science Council of the Republic of China under the Contract NSC 100-2221-E-237-004.

#### References

- B. Roth and F. Freudenstein, “Synthesis of path-generating mechanisms by numerical methods,”
*ASME Journal of Engineering For Industry*, vol. 30, pp. 298–305, 1963. - C. Zhang, R. L. Norton, and T. Hammonds, “Optimization of parameters for specified path generation using an atlas of coupler curves of geared five-bar linkages,”
*Mechanism and Machine Theory*, vol. 19, no. 6, pp. 459–466, 1984. View at Scopus - G. Starns and D. R. Flugrad, “Five-bar path generation synthesis by continuation methods,”
*Journal of Mechanical Design*, vol. 115, no. 4, pp. 988–994, 1993. View at Scopus - T. Subbian and D. R. Flugrad, “Six and seven position triad synthesis using continuation methods,”
*Journal of Mechanical Design*, vol. 116, no. 2, pp. 660–665, 1994. View at Scopus - S. B. Nokleby and R. P. Podhorodeski, “Optimization-based synthesis of Grashof geared five-bar mechanisms,”
*Journal of Mechanical Design*, vol. 123, no. 4, pp. 529–534, 2001. View at Scopus - A. Smaili and N. Diab, “A new approach to shape optimization for closed path synthesis of planar mechanisms,”
*Journal of Mechanical Design*, vol. 129, no. 9, pp. 941–948, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. Buśkiewicz, R. Starosta, and T. Walczak, “On the application of the curve curvature in path synthesis,”
*Mechanism and Machine Theory*, vol. 44, no. 6, pp. 1223–1239, 2009. View at Publisher · View at Google Scholar · View at Scopus - J. Buśkiewicz, “Use of shape invariants in optimal synthesis of geared five-bar linkage,”
*Mechanism and Machine Theory*, vol. 45, no. 2, pp. 273–290, 2010. View at Publisher · View at Google Scholar · View at Scopus - J. Mariappan and S. Krishnamurty, “A generalized exact gradient method for mechanism synthesis,”
*Mechanism and Machine Theory*, vol. 31, no. 4, pp. 413–421, 1996. View at Publisher · View at Google Scholar · View at Scopus - G. P. Roston and R. H. Sturges, “Genetic algorithm synthesis of four-bar mechanisms,”
*Artificial Intelligence for Engineering Design, Analysis and Manufacturing*, vol. 10, no. 5, pp. 371–390, 1996. View at Scopus - A. Kunjur and S. Krishnamurty, “Genetic algorithms in mechanical synthesis,”
*Journal of Applied Mechanisms and Robotics*, vol. 4, pp. 18–24, 1997. - I. Ullah and S. Kota, “Optimal synthesis of mechanisms for path generation using fourier descriptors and global search methods,”
*Journal of Mechanical Design*, vol. 119, no. 4, pp. 504–510, 1997. View at Scopus - S. Dibakar and T. S. Mruthyunjaya, “Synthesis of workspaces of planar manipulators with arbitrary topology using shape representation and simulated annealing,”
*Mechanism and Machine Theory*, vol. 34, no. 3, pp. 391–420, 1999. View at Scopus - J. A. Cabrera, A. Simon, and M. Prado, “Optimal synthesis of mechanisms with genetic algorithms,”
*Mechanism and Machine Theory*, vol. 37, no. 10, pp. 1165–1177, 2002. View at Scopus - P. S. Shiakolas, D. Koladiya, and J. Kebrle, “On the optimum synthesis of four-bar linkages using differential evolution and the geometric centroid of precision positions,”
*Inverse Problems in Engineering*, vol. 10, no. 6, pp. 485–502, 2002. View at Publisher · View at Google Scholar · View at Scopus - P. S. Shiakolas, D. Koladiya, and J. Kebrle, “On the optimum synthesis of six-bar linkages using differential evolution and the geometric centroid of precision positions technique,”
*Mechanism and Machine Theory*, vol. 40, no. 3, pp. 319–335, 2005. View at Publisher · View at Google Scholar · View at Scopus - A. Smaili and N. Diab, “Optimum synthesis of hybrid-task mechanisms using ant-gradient search method,”
*Mechanism and Machine Theory*, vol. 42, no. 1, pp. 115–130, 2007. View at Publisher · View at Google Scholar · View at Scopus - R. R. Bulatović and S. R. Dordević, “On the optimum synthesis of a four-bar linkage using differential evolution and method of variable controlled deviations,”
*Mechanism and Machine Theory*, vol. 44, no. 1, pp. 235–246, 2009. View at Publisher · View at Google Scholar · View at Scopus - S. K. Acharyya and M. Mandal, “Performance of EAs for four-bar linkage synthesis,”
*Mechanism and Machine Theory*, vol. 44, no. 9, pp. 1784–1794, 2009. View at Publisher · View at Google Scholar · View at Scopus - W. Y. Lin, “A GA-DE hybrid evolutionary algorithm for path synthesis of four-bar linkage,”
*Mechanism and Machine Theory*, vol. 45, no. 8, pp. 1096–1107, 2010. View at Publisher · View at Google Scholar · View at Scopus - J. A. Cabrera, A. Ortiz, F. Nadal, and J. J. Castillo, “An evolutionary algorithm for path synthesis of mechanisms,”
*Mechanism and Machine Theory*, vol. 46, no. 2, pp. 127–141, 2011. View at Publisher · View at Google Scholar · View at Scopus - F. Peñuñuri, R. Peón-Escalante, C. Villanueva, and D. Pech-Oy, “Synthesis of mechanisms for single and hybrid tasks using differential evolution,”
*Mechanism and Machine Theory*, vol. 46, no. 10, pp. 1335–1349, 2011. View at Publisher · View at Google Scholar · View at Scopus - H. Zhou and E. H. M. Cheung, “Optimal synthesis of crank-rocker linkages for path generation using the orientation structural error of the fixed link,”
*Mechanism and Machine Theory*, vol. 36, no. 8, pp. 973–982, 2001. View at Publisher · View at Google Scholar · View at Scopus - M. A. Laribi, A. Mlika, L. Romdhane, and S. Zeghloul, “A combined genetic algorithm-fuzzy logic method (GA-FL) in mechanisms synthesis,”
*Mechanism and Machine Theory*, vol. 39, no. 7, pp. 717–735, 2004. View at Publisher · View at Google Scholar · View at Scopus - I. Fernández-Bustos, J. Aguirrebeitia, R. Avilés, and C. Angulo, “Kinematical synthesis of 1-dof mechanisms using finite elements and genetic algorithms,”
*Finite Elements in Analysis and Design*, vol. 41, no. 15, pp. 1441–1463, 2005. View at Publisher · View at Google Scholar · View at Scopus - N. Diab and A. Smaili, “Optimum exact/approximate point synthesis of planar mechanisms,”
*Mechanism and Machine Theory*, vol. 43, no. 12, pp. 1610–1624, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. B. Matekar and G. R. Gogate, “Optimum synthesis of path generation four-bar mechanism mechanisms using differential evolution and a modified error function,”
*Mechanism and Machine Theory*, vol. 52, pp. 158–179, 2012. View at Publisher · View at Google Scholar - W. Y. Lin, “Optimum path synthesis of a four-link mechanism with rolling contacts,”
*Proceedings of the Institution of Mechanical Engineers C*, vol. 226, pp. 544–551, 2012. - A. Sedano, R. Sancibrian, A. de Juan, F. Viadero, and F. Egaña, “Hybrid optimization approach for the design of mechanisms using a new error estimator,”
*Mathematical Problems in Engineering*, vol. 2012, Article ID 151590, 20 pages, 2012. View at Publisher · View at Google Scholar - J. R. McGarva, “Rapid search and selection of path generating mechanisms from a library,”
*Mechanism and Machine Theory*, vol. 29, no. 2, pp. 223–235, 1994. View at Scopus - Y. Hongying, T. Dewei, and W. Zhixing, “Study on a new computer path synthesis method of a four-bar linkage,”
*Mechanism and Machine Theory*, vol. 42, no. 4, pp. 383–392, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. W. Sun and J. K. Chu, “Fourier method to function synthesis of an RCCC mechanism,”
*Proceedings of the Institution of Mechanical Engineers C*, vol. 223, no. 2, pp. 503–513, 2009. View at Publisher · View at Google Scholar · View at Scopus - A. Vasiliu and B. Yannou, “Dimensional synthesis of planar mechanisms using neural networks: application to path generator linkages,”
*Mechanism and Machine Theory*, vol. 36, no. 2, pp. 299–310, 2001. View at Scopus - G. Galán-Marín, F. J. Alonso, and J. M. del Castillo, “Shape optimization for path synthesis of crank-rocker mechanisms using a wavelet-based neural network,”
*Mechanism and Machine Theory*, vol. 44, no. 6, pp. 1132–1143, 2009. View at Publisher · View at Google Scholar · View at Scopus - R. L. Norton,
*Design of Machinery*, McGraw-Hill, New York, NY, USA, 3rd edition, 2004. - D. E. Goldberg,
*Genetic Algorithms in Search, Optimization and Machine Learning*, Addison-Wesley, Reading, Mass, USA, 1989. - http://www.dlit.edu.tw/dep/academics/Me/wylin/rm3.htm.
- B. Wang, “Shape retrieval using combined Fourier features,”
*Optics Communications*, vol. 284, no. 14, pp. 3504–3508, 2011. View at Publisher · View at Google Scholar · View at Scopus - D. T. Pham and M. Castellani, “The bees algorithm: modelling foraging behaviour to solve continuous optimization problems,”
*Proceedings of the Institution of Mechanical Engineers C*, vol. 223, no. 12, pp. 2919–2938, 2009. View at Publisher · View at Google Scholar · View at Scopus - R. V. Rao, V. J. Savsani, and D. P. Vakharia, “Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems,”
*Computer Aided Design*, vol. 43, no. 3, pp. 303–315, 2011. View at Publisher · View at Google Scholar · View at Scopus