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

Optimum synthesis of hybrid-task mechanisms using ant-gradient search method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
48
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 66 publications
(48 citation statements)
references
References 31 publications
0
48
0
Order By: Relevance
“…The Cuckoo Search algorithm is an example of a direct search strategy that uses a naturebased heuristic to combine design parameter vectors to find new designs. Other examples of these heuristics include simulated annealing used by Dibakar and Mruthyunjaya [13] to design two degree-of-freedom planar linkage systems, the particle swarm method used by McDougall and Nokleby [14] to design four-bar linkages, and the ant search algorithm used by Xiao and Tao [15] and by Smaili and Diab [16] to design four-bar path generators.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The Cuckoo Search algorithm is an example of a direct search strategy that uses a naturebased heuristic to combine design parameter vectors to find new designs. Other examples of these heuristics include simulated annealing used by Dibakar and Mruthyunjaya [13] to design two degree-of-freedom planar linkage systems, the particle swarm method used by McDougall and Nokleby [14] to design four-bar linkages, and the ant search algorithm used by Xiao and Tao [15] and by Smaili and Diab [16] to design four-bar path generators.…”
Section: Literature Reviewmentioning
confidence: 99%
“…One task for designing a four-bar linkage is a path generation problem. This synthesis problem is aimed at finding significant link lengths of the mechanism to achieve a point on a coupler link moving along the desired path [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. The problem is usually converted to be an optimization problem, which is posed to find the dimensions of a mechanism and some other parameters.…”
Section: Introductionmentioning
confidence: 99%
“…The path generation problem is of interest by many researchers due to the advantage of using such a mechanism such as work reported by Sleesongsom and Bureerat [16]. Almost all of the previous work tried to improve the design performance of the path synthesis problem in both the constraint handling [10][11]16] and the performance of an optimizer [1][2][3][4][5][6][7][8][9]16]. The path synthesis optimization problem normally composes of two types of constraints.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…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%