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

Comparative study of SQP and metaheuristics for robotic manipulator design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
25
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(25 citation statements)
references
References 12 publications
0
25
0
Order By: Relevance
“…Fig. 11.1 The workspace for 3R manipulators and design parameters (Bergamaschi et al 2008; Reprinted with permission from Elsevier)…”
mentioning
confidence: 99%
“…Fig. 11.1 The workspace for 3R manipulators and design parameters (Bergamaschi et al 2008; Reprinted with permission from Elsevier)…”
mentioning
confidence: 99%
“…1 [28]. The study of this type of manipulator is done according to the Denavit-Hartenberg parameters: 4 , r 2 , and r 3 . To reduce the number of parameters and simplify the problem, will be considered d 2 =1 and r 3 =0.…”
Section: Mathematical Modeling Of the Robotic Manipulatormentioning
confidence: 99%
“…Ceccarelli and Lanni [8] presented a suitable formulation for the workspace that can be used in the design of manipulators, which was formulated as a multi-objective optimization problem using the workspace volume and robot dimensions as objective functions. Bergamaschi et al [3,4] studied the design of manipulators with three-revolute joints (3R) using an optimization problem that takes into account the characteristics of the workspace. The optimization problem is formulated considering the workspace volume as the objective function.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Hence, the manipulator design have been stated as an optimization problem where optimization techniques such as, heuristic algorithms [15], [16], [17], [18], [19], [20] and gradient based algorithms [21], have been used. Nevertheless, if the optimization problem is nonlinear or discontinuous one, gradient based algorithms are not suitable to solve the problem because they converge to local minima near the initial condition (sensitive to initial condition) [22], [23], then the design solution will perform poorly. So, it is important to have an algorithm that efficiently search in the design space to obtain a feasible solution, i.e., to obtain a set of parameters that describe the system and meet the design requirements.…”
Section: Introductionmentioning
confidence: 99%