Trajectory planning in parallel kinematic manipulators using a constrained multi-objective evolutionary algorithm
Generating manipulator trajectories considering multiple objectives with kinematics and dynamics constraints is a non-trivial optimization. In this paper, a constrained multi-objective genetic algorithm (MOGA) based technique is proposed to address this problem for a general motor-driven parallel ki...
Saved in:
| Published in: | Nonlinear dynamics Vol. 67; no. 2; pp. 1669 - 1681 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
01.01.2012
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0924-090X, 1573-269X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Generating manipulator trajectories considering multiple objectives with kinematics and dynamics constraints is a non-trivial optimization. In this paper, a constrained multi-objective genetic algorithm (MOGA) based technique is proposed to address this problem for a general motor-driven parallel kinematic manipulator. The planning process is composed of searching for a motion ensuring the accomplishment of the assigned task, minimizing the traverse time, and expended energy subject to various constraints imposed by the associated kinematics and dynamics of the manipulator. This problem is treated via an adequate parametric path representation in the task space of the moving platform, and then the use of the constrained MOGA for solving the resulted nonlinear multi-objective optimization problem. Simulation results are presented for the trajectories of the parallel kinematic manipulator, and a subsequent comparison with the weighted sum method is also carried out. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0924-090X 1573-269X |
| DOI: | 10.1007/s11071-011-0095-2 |