2020 International Conference on Advanced Mechatronic Systems (ICAMechS) 2020
DOI: 10.1109/icamechs49982.2020.9310157
|View full text |Cite
|
Sign up to set email alerts
|

Comparing the Results of Applying DE, PSO and Proposed Pro DE, Pro PSO Algorithms for Inverse Kinematics Problem of a 5-DOF Scara Robot

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 13 publications
0
1
0
Order By: Relevance
“…Assuming that the space of solutions is an n-dimensional space, then each particle is considered as a candidate solution to this n-dimensional search space, and each particle has memory. During each iteration, the particle updates the optimal position based on the calculated fitness value, and also updates the global optimal position based on the optimal positions of all particles in the particle swarm [41]. Assuming that there are m particles forming a particle swarm in an n-dimensional target search space, the iterative formulation of the algorithm is as follows:…”
Section: Particle Swarm Optimization Algorithmmentioning
confidence: 99%
“…Assuming that the space of solutions is an n-dimensional space, then each particle is considered as a candidate solution to this n-dimensional search space, and each particle has memory. During each iteration, the particle updates the optimal position based on the calculated fitness value, and also updates the global optimal position based on the optimal positions of all particles in the particle swarm [41]. Assuming that there are m particles forming a particle swarm in an n-dimensional target search space, the iterative formulation of the algorithm is as follows:…”
Section: Particle Swarm Optimization Algorithmmentioning
confidence: 99%
“…The lower and upper boundaries also represent constraints that must be considered for real-world implementations. We considered solving the inverse kinematics of mobile dual-arm robots as a global constrained optimization problem, which is expressed as arg min q f (q), subject to q l < q < q u (13) where q defines the optimal configuration of the mobile dual-arm system with q = q T 0 q T 1 q T 2 T . The set of solutions that satisfy F = {q : q l < q < q u } is called the feasible solutions.…”
Section: Inverse Kinematics Based On Metaheuristics Optimization Algo...mentioning
confidence: 99%
“…The relative desired position for end-effector 2 is computed using (8). Then, the inverse kinematics is solved based on the optimization problem expressed in (13) to obtain an optimal configuration q k . The solution q k becomes the previous configuration for the next desired point t * k+1 .…”
Section: Coordinated Trajectory Tracking Algorithmmentioning
confidence: 99%
See 1 more Smart Citation