2014
DOI: 10.1017/s0263574714000393
|View full text |Cite
|
Sign up to set email alerts
|

A direct approach to solving trajectory planning problems using genetic algorithms with dynamics considerations in complex environments

Abstract: SUMMARYThis paper presents a new genetic algorithm methodology to solve the trajectory planning problem. This methodology can obtain smooth trajectories for industrial robots in complex environments using a direct method. The algorithm simultaneously creates a collision-free trajectory between initial and final configurations as the robot moves. The presented method deals with the uncertainties associated with the unknown kinematic properties of intermediate via points since they are generated as the algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0
2

Year Published

2016
2016
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(17 citation statements)
references
References 29 publications
0
13
0
2
Order By: Relevance
“…In addition, some other scholars have also adopted genetic algorithm to optimize the manipulator trajectory planning. 31,32 It is worth noting that the intermediate point solved by genetic algorithm is not necessarily the optimal solution. But it is one of many solutions to the domain near the optimal solution under the condition of constraints.…”
Section: Gene Optimization Schemementioning
confidence: 99%
“…In addition, some other scholars have also adopted genetic algorithm to optimize the manipulator trajectory planning. 31,32 It is worth noting that the intermediate point solved by genetic algorithm is not necessarily the optimal solution. But it is one of many solutions to the domain near the optimal solution under the condition of constraints.…”
Section: Gene Optimization Schemementioning
confidence: 99%
“…The vector r (shown in Figure 2(b)) is the location of the center of mass of a link relative to the frame representing the link. The rotation angle of 1 , 2 , 3 , 4 , and 5 is represented by 1 Figure 2: The assigned reference frame: (a) D-H reference frame and (b) the location of the center of mass.…”
Section: Forward Kinematicsmentioning
confidence: 99%
“…There are a number of popular methods for transcribing the trajectory planning problem into an optimization problem. Essentially, these transcriptions fall into two categories: direct (global) methods (such as [1][2][3][4]) and indirect (decoupled) methods (e.g., [5][6][7][8]).…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the trajectory optimization of the plasma robot is mainly the trajectory control of the joint space of the redundant robot, so that the trajectory of the end of the lance and the desired trajectory of the working base are Match. Due to the redundant nature of the plasma robot, there are numerous optimization inverse solutions in the joint space, which makes the movement characteristics of the plasma robot in the joint space very complicated, which makes the end of the gun movement path difficult to describe [13][14][15][16]. In this paper, some reference points are selected based on the desired trajectory, and the inverse kinematics is solved to obtain the inverse solution of joint space optimization.…”
Section: Introductionmentioning
confidence: 99%