“…In order to obtain the appropriate values of the angles θ 3 and θ 4 , the sign of the radicals in (13) and (14) are (+ √ ) and (− √ ), respectively; this is due to the open configuration in the FBM considered.…”
Section: Kinematic Analysis Of the Fbmmentioning
confidence: 99%
“…In that work, the DE shows faster convergence to the optimal result and a smaller error of adjustment to target points, than the genetic algorithm (GA) and the particle swarm optimization (PSO). The work presented in [13] proposed an evolutionary algorithm to solve the path synthesis problem of a four-bar linkage. In [10], another design approach of a four-bar mechanism for path generation purposes is formulated as a constrained multi-objective optimization problem.…”
“…In order to obtain the appropriate values of the angles θ 3 and θ 4 , the sign of the radicals in (13) and (14) are (+ √ ) and (− √ ), respectively; this is due to the open configuration in the FBM considered.…”
Section: Kinematic Analysis Of the Fbmmentioning
confidence: 99%
“…In that work, the DE shows faster convergence to the optimal result and a smaller error of adjustment to target points, than the genetic algorithm (GA) and the particle swarm optimization (PSO). The work presented in [13] proposed an evolutionary algorithm to solve the path synthesis problem of a four-bar linkage. In [10], another design approach of a four-bar mechanism for path generation purposes is formulated as a constrained multi-objective optimization problem.…”
“…An exact solution for this problem is not possible because of the limited number of dimensions available, but various techniques have been used for approximate solutions. The most common techniques used include conventional optimization methods (Tomas, 1968;Sancibrian et al, 2004;Diab and Smaili, 2008), using atlases of mechanisms (Zhang et al, 1984), simulated annealing (Ullah and Kota, 1996), and genetic algorithms or evolutionary algorithms (Cabrera et al, 2002;Laribi et al, 2004;Starosta, 2008;Lin, 2010).…”
Abstract. Dimensional synthesis of mechanisms to trace given paths is an important problem with no exact solution. In this paper, the problem is divided into representation of curve shape and learning the relation between curve shape and mechanism dimensions. Curve shape is represented by Fourier descriptors of cumulative angular deviation of the curve, which do not depend on the position or scale of the curve. An artificial neural network (ANN) is trained to learn the (unknown) relation between the Fourier descriptors of a planar curve and the dimensions of the mechanism tracing that curve. Presented with any simple, closed, planar curve, the ANN suggests the dimensions of a four-bar whose coupler curve is similar in shape. A local optimization procedure further refines the results. Examples presented indicate the method is successful as long as the curve shape is such that the mechanism is able to trace it.
“…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 algorithmfuzzy 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][10][11][14][15][16][17][18][19][20][21][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.…”
Section: Introductionmentioning
confidence: 99%
“…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. Figure 1 depicts a stick diagram and all the geometric parameters of a geared five-bar mechanism with circular gears.…”
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.