Proceedings of IEEE International Conference on Robotics and Automation
DOI: 10.1109/robot.1996.506928
|View full text |Cite
|
Sign up to set email alerts
|

On time optimal path control of manipulators with bounded joint velocities and torques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
63
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 64 publications
(63 citation statements)
references
References 9 publications
0
63
0
Order By: Relevance
“…Using acceleration instead of torque limits results in a simpler problem and a simpler derivation of the following equations than in [5]. Unlike [5] and like [9], we are also considering velocity limits on the joints. Because the solution is constrained to follow a given path exactly, the problem can be reduced to one dimension: choosing the velocityṡ = ds dt for every position s along the path.…”
Section: Path Preprocessingmentioning
confidence: 99%
See 2 more Smart Citations
“…Using acceleration instead of torque limits results in a simpler problem and a simpler derivation of the following equations than in [5]. Unlike [5] and like [9], we are also considering velocity limits on the joints. Because the solution is constrained to follow a given path exactly, the problem can be reduced to one dimension: choosing the velocityṡ = ds dt for every position s along the path.…”
Section: Path Preprocessingmentioning
confidence: 99%
“…We now describe how numerical inaccuracies can make the algorithm described in section Section VI fail and the measures we have taken to avoid that. None of the previous papers on this approach [5][6][7][8][9] have dealt with numerical issues.…”
Section: B Caused By Velocity Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…We can observe that it is very close to the analytical solution found in section III. The very small difference between these two solutions can be identified to be solely due to the discretization process (16)- (18). For the same reason, the approximate computation in (25) of the constraint (24) appears to slightly underestimate the limiting temperature constraint in this specific case, allowing a faster solution here than the truly optimal solution described in section III, with only 1.35s of cycle time rather than 1.38s in section III.…”
Section: A Numerical Resultsmentioning
confidence: 92%
“…The gradients can be calculated numerically with finite differences methods, but that severely impedes the convergence of the SQP. Symbolic or automatic differentiation methods [17] can be used also, but in our problem the geometric path is fixed and the dynamics (14) can be formulated very simply as [4] [3] [18]:…”
Section: B Optimization Algorithmmentioning
confidence: 99%