2016
DOI: 10.1007/s00170-016-9050-1
|View full text |Cite
|
Sign up to set email alerts
|

Statistical evaluation of an evolutionary algorithm for minimum time trajectory planning problem for industrial robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
20
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 44 publications
(20 citation statements)
references
References 49 publications
0
20
0
Order By: Relevance
“…According to [11], time-optimal trajectory planning can be considered as a nonconvex problem. Previous robot trajectory planning mainly focused on time optimization [12,13]. In the recent years, multiobjective optimization under kinematic constraint has been under attention so as to improve the efficiency and quality and save energy.…”
Section: Introductionmentioning
confidence: 99%
“…According to [11], time-optimal trajectory planning can be considered as a nonconvex problem. Previous robot trajectory planning mainly focused on time optimization [12,13]. In the recent years, multiobjective optimization under kinematic constraint has been under attention so as to improve the efficiency and quality and save energy.…”
Section: Introductionmentioning
confidence: 99%
“…GA can also adaptively control the relevant parameters in the search process to obtain the best search scheme. In each iteration GA selects and evolves individuals according to the fitness of different individuals and the transformation scheme inherited from genetics (Abu-Dakka et al, 2017). In this way a series of new individuals can be produced.…”
Section: Global Search Based On Genetic Algorithmmentioning
confidence: 99%
“…J. Kim, S. R. Kim, S. J. Kim and D. H. Kim [29] recommend an approach for online implementation by using the dynamic model of the robot to find the maximum kinematic constraints that are used with the conventional trajectory models. F. Abu-Dakka, I. Assad, R. Alkhdour and M. Abderahim [30], after an exhaustive analysis of the optimization methods presented in the literature, prefer the optimization by minimizing the time, using a parallel populations genetic algorithm and three different types of constraints: kinematics, dynamics and payload constraint, instead of minimizing the jerk, the latter being placed constraints within the meaning of imposing limits given in the literature.…”
Section: Minimum Time Trajectory Planningmentioning
confidence: 99%