2008
DOI: 10.1016/j.mechmachtheory.2007.12.006
|View full text |Cite
|
Sign up to set email alerts
|

Optimum exact/approximate point synthesis of planar mechanisms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…This algorithm allows AS to be applied to various optimization problems regardless whether a physical path exists or not and this main advantage rendered it feasible in rigid mechanisms design [14][15][16][17][18] where an extensive detailed review can be found.…”
Section: Ant Search Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm allows AS to be applied to various optimization problems regardless whether a physical path exists or not and this main advantage rendered it feasible in rigid mechanisms design [14][15][16][17][18] where an extensive detailed review can be found.…”
Section: Ant Search Algorithmmentioning
confidence: 99%
“…The authors of this paper used Ant Search (AS) to optimize for planar rigid linkages with hybrid function, motion and path synthesis tasks [14], hybrid exact-approximate path synthesis [15],clearances and tolerances effects in four bars [16] and coupler curve shape optimization [17]. Lately, a Modified Ant Search [18] algorithm was proposed to improve the performance of the AS algorithm by using an Elitist ants approach with dynamic enter/exit strategies between the exploration and exploitation phases.…”
Section: Introductionmentioning
confidence: 99%
“…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).…”
Section: Introductionmentioning
confidence: 99%
“…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 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.…”
Section: Introductionmentioning
confidence: 99%
“…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.…”
Section: Introductionmentioning
confidence: 99%