2007 International Conference on Control, Automation and Systems 2007
DOI: 10.1109/iccas.2007.4406875
|View full text |Cite
|
Sign up to set email alerts
|

On-line minimum-time trajectory planning for industrial manipulators

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
0
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 8 publications
0
0
0
Order By: Relevance
“…The minimum-distance criterion to which the maximum velocity can be applied is obtained through the condition that there is no constant-speed section and only acceleration and deceleration sections exist. Using the given maximum velocity, acceleration, jerk ( j c ), t b and dist min can be obtained, as in Equations ( 10) and (11),…”
Section: Modified Lspb-based Trajectory Planningmentioning
confidence: 99%
See 1 more Smart Citation
“…The minimum-distance criterion to which the maximum velocity can be applied is obtained through the condition that there is no constant-speed section and only acceleration and deceleration sections exist. Using the given maximum velocity, acceleration, jerk ( j c ), t b and dist min can be obtained, as in Equations ( 10) and (11),…”
Section: Modified Lspb-based Trajectory Planningmentioning
confidence: 99%
“…Therefore, the Linear Segment with Parabolic Blends (LSPB) was applied as a method to optimize the robot's movement. The LSPB algorithm was used in path planning for an industrial robot, such as a method of the typical on-line minimum time trajectory planning for robot manipulators [11], through industrial robot manipulators, and applying LSPB can maximize the time trajectory and generation [12].…”
Section: Introductionmentioning
confidence: 99%
“…The work presented in [4] proposed a modified LSPB that is engaged with Particle Swarm Optimization to generate smooth trajectories that pass through specific path points while satisfying velocity and acceleration constraints of physical mechanical robot manipulators. Another approach to address the shortcoming of the LSPB was to take the manipulator dynamics into consideration [5]. In their proposed method, they performed the dynamic calculation only at certain points on the given path, which is effectively utilized to determine the kinematic constraints while minimizing the computational burden by solving only at dynamic edge points on the given path.…”
Section: Introductionmentioning
confidence: 99%