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

Performance of EAs for four-bar linkage synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

4
128
2
4

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 160 publications
(153 citation statements)
references
References 10 publications
4
128
2
4
Order By: Relevance
“…The first case was presented by Acharyya and Mandal (2009). The authors of this paper considered the synthesis with timing defined by data given in tab 1 tab 1 = (0, 0, 0.5236), (1.9098, 5.878, 1.0472), (6.9098, 9.511, 1.5708), (13.09, 9.511, 2.0944), (18.09, 5.878, 2.618), (20, 0, 3.1416) The input geometric constraints were:…”
Section: Casementioning
confidence: 99%
See 1 more Smart Citation
“…The first case was presented by Acharyya and Mandal (2009). The authors of this paper considered the synthesis with timing defined by data given in tab 1 tab 1 = (0, 0, 0.5236), (1.9098, 5.878, 1.0472), (6.9098, 9.511, 1.5708), (13.09, 9.511, 2.0944), (18.09, 5.878, 2.618), (20, 0, 3.1416) The input geometric constraints were:…”
Section: Casementioning
confidence: 99%
“…The method error δ = 2.767, and the absolute Euclidian error E = 2.10037. Three EAs namely Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Differential Evolution (DE) were applied separately in (Acharyya and Mandal, 2009). The best solution obtained using DE is presented in Table 1.…”
Section: Casementioning
confidence: 99%
“…Figure 2 shows four bar mechanism in general coordinate system [16,26]. The design procedure of a four-bar linkage starts with the vector loop equation referring to Figure 2.…”
Section: Kinematics Of Four Bar Mechanismmentioning
confidence: 99%
“…In [1], the path synthesis of a four-bar mechanism (FBM) to track more than five points in the coupler link is solved by using three different evolutionary algorithms DOI: 10.14736/kyb-2014- with a new refinement technique. 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).…”
Section: Introductionmentioning
confidence: 99%