scholarly journals Application of GWO algorithm for closed path generation in optimal synthesis of planar mechanisms

2019 ◽  
Vol 25 (4) ◽  
pp. 61-68
Author(s):  
Marina Bošković ◽  
Radovan Bulatović ◽  
Slaviša Šalinić ◽  
Bratislav Sredojević
Keyword(s):  
Optimal Synthesis ◽  
Path Generation ◽  
Closed Path ◽  
Planar Mechanisms

Optimal Synthesis of Mechanisms for Path Generation Using Refined Numerical Representation Based Model and AIS Based Searching Method

2004 ◽  
Vol 127 (4) ◽  
pp. 688-691 ◽  
Author(s):  
Yong Liu ◽  
Renbin Xiao
Keyword(s):  
Synthesis Method ◽  
Optimal Synthesis ◽  
Numerical Representation ◽  
Path Generation ◽  
Artificial Immune ◽  
Planar Mechanisms ◽  
Artificial Immune Network ◽  
Synthesis Of Mechanisms ◽  
Initial Sampling ◽  
Searching Method

This paper presents an optimal synthesis method for path generation of planar mechanisms, in which a new path-description method named refined numerical representation is proposed to define the object function of the optimization model for path generation, and then the artificial immune network searching method is introduced to search candidate solutions. As a result, desired mechanisms can be generated independent of the scale, rotation, and translation transformation as well as sampling uniformity of initial sampling points. Experiment results demonstrate the effectiveness of the approach.

Optimum Synthesis of Rigid Mechanisms Using a Dynamic Ant-Search Method With Sensitivity Analysis

2019 ◽  
Author(s):  
Nadim Diab ◽  
Omar Itani ◽  
Ahmad Smaili
Keyword(s):  
Sensitivity Analysis ◽  
Optimization Technique ◽  
Design Parameters ◽  
Neighborhood Search ◽  
Intensity Level ◽  
Path Generation ◽  
Exploration And Exploitation ◽  
Planar Mechanisms ◽  
Optimum Synthesis ◽  
Synthesis Of Mechanisms

Abstract Four-bar linkages are commonly used mechanisms in various mechanical systems and components. Several techniques for optimum synthesis of planar mechanisms have been suggested in literature such as the Genetic, Tabu, Simulated Annealing, Swarm-Based and many other algorithms. This paper covers optimization of four-bar mechanisms with path generation tasks using a Dynamic Ant Search (DAS) algorithm. Unlike the Modified Ant Search (MAS) technique where ants unanimously moved between the exploration and exploitation phases, in the proposed algorithm, each ant is free to travel between the two aforementioned phases independent of other ants and as governed by its own pheromone intensity level. Moreover, sensitivity analysis is conducted on the design parameters to determine their corresponding neighborhood search boundaries and thus improve the search while in the exploitation mode. These implemented changes demonstrated a remarkable impact on the optimum synthesis of mechanisms for path generation tasks. A briefing of the MAS based algorithm is first presented after which the proposed modified optimization technique and its implementation on four-bar mechanisms are furnished. Finally, three case studies are conducted to evaluate the efficiency and robustness of the proposed methodology where the performances of the obtained optimum designs are benchmarked with those previously reported in literature.

Optimum Synthesis of Planar Mechanisms for Path Generation Based on a Combined Discrete Fourier Descriptor

2015 ◽  
Vol 7 (4) ◽  
Author(s):  
Wen-Yi Lin
Keyword(s):  
Synthesis Method ◽  
Optimization Method ◽  
Path Generation ◽  
Fourier Descriptor ◽  
Planar Mechanisms ◽  
Two Phase ◽  
Phase Synthesis ◽  
Optimum Synthesis ◽  
Centroid Distance ◽  
The One

A two-phase synthesis method is described, which is capable of solving quite challenging path generation problems. A combined discrete Fourier descriptor (FD) is proposed for shape optimization, and a geometric-based approach is used for the scale–rotation–translation synthesis. The combined discrete FD comprises three shape signatures, i.e., complex coordinates (CCs), centroid distance (CD), and triangular centroid area (TCA), which can capture greater similarity of shape. The genetic algorithm–differential evolution (GA–DE) optimization method is used to solve the optimization problem. The proposed two-phase synthesis method, based on the combined discrete FD, successfully solves the challenging path generation problems with a relatively small number of function evaluations. A more accurate path shape can be obtained using the combined FD than the one-phase synthesis method. The obtained coupler curves approximate the desired paths quite well.

Pareto optimal synthesis of four-bar mechanisms for path generation

2009 ◽  
Vol 44 (1) ◽  
pp. 180-191 ◽  
Author(s):  
N. Nariman-Zadeh ◽  
M. Felezi ◽  
A. Jamali ◽  
M. Ganji
Keyword(s):  
Optimal Synthesis ◽  
Pareto Optimal ◽  
Path Generation

An algorithm for optimal closed-path generation over arbitrary surfaces using uncalibrated vision

2007 ◽  
Author(s):  
Emilio J. Gonzalez-Galvan ◽  
Ambrocio Loredo-Flores ◽  
Erika D. Laborico-Aviles ◽  
Felipe Pazos-Flores ◽  
J. Jesus Cervantes-Sanchez
Keyword(s):  
Path Generation ◽  
Closed Path

A New Approach to Shape Optimization for Closed Path Synthesis of Planar Mechanisms

2005 ◽  
Vol 129 (9) ◽  
pp. 941-948 ◽  
Author(s):  
Ahmad Smaili ◽  
Nadim Diab
Keyword(s):  
Shape Optimization ◽  
Fourier Descriptors ◽  
Angular Deviation ◽  
Mathematical Approach ◽  
Closed Path ◽  
Planar Mechanisms ◽  
Simple Method ◽  
New Approach ◽  
Starting Point ◽  
Path Synthesis

A method for the synthesis of four-bar mechanisms to generate closed paths through shape optimization is herein introduced. The objective function is not based on Fourier descriptors, but rather on the cyclic angular deviation (CAD) vector associated with a set of desired points on the curve. A simple method is introduced to account for the starting point shift between the desired CAD and the generated one. Following shape optimization, a simple mathematical approach is devised to properly scale, rotate, and translate the mechanism to the desired configuration. Two case studies are presented to demonstrate the effectiveness and robustness of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document