Time-optimal trajectories for a robot manipulator: a provably good approximation algorithm

An algorithm is presented for generating near-time-optimal trajectories for an open-kinematic-chain manipulator moving in a cluttered workspace. This is the first algorithm to guarantee bounds on the closeness of an approximation to a time-optimal trajectory. The running time and space required are polynomial in the desired accuracy of the approximation. The user may also specify tolerances by which the trajectories must clear obstacles in the workspace to allow modeling of control errors.<<ETX>>

[1]  Eduardo Sontag,et al.  Remarks on the time-optimal control of two-link manipulators , 1985, 1985 24th IEEE Conference on Decision and Control.

[2]  S. Dubowsky,et al.  On the Optimal Control of Robotic Manipulators with Actuator Constraints , 1983, 1983 American Control Conference.

[3]  Bruce Randall Donald,et al.  A provably good approximation algorithm for optimal-time trajectory planning , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[4]  Kang G. Shin,et al.  Minimum-time control of robotic manipulators with geometric path constraints , 1985 .

[5]  Brad E. Paden,et al.  Bounds on robot dynamics , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[6]  Bruce Randall Donald,et al.  On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  Richard Paul,et al.  Manipulator Cartesian Path Control , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  J. Hollerbach.  Dynamic Scaling of Manipulator Trajectories , 1983, 1983 American Control Conference.

[9]  Bernard Roth,et al.  The Near-Minimum-Time Control Of Open-Loop Articulated Kinematic Chains , 1971 .

[10]  Brad E. Paden,et al.  Path planning using a Jacobian-based freespace generation algorithm , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[11]  James E. Bobrow,et al.  Optimal Robot Path Planning Using the Minimum-Time Criterion , 2022 .