An approach for robot dynamic motion planning with control torques and obstacles constraints

There is no known general solution to the robot dynamic motion problem. The authors present a partial solution by considering the problem of moving the end-effector in minimum time subject to input torque constraints and meanwhile avoiding stationary obstacles. It is assumed that the robots are SCARA-type manipulators. First an ideal geometric path consisting of several line segments in the Cartesian work space is found. Second, a minimum time collision-free dynamic motion neighboring the ideal geometric path is determined. Finally, a numerical example of a two-link manipulator moving in the horizontal plane filled with polyhedral obstacles is presented.<<ETX>>

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

[2]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[4]  William A. Gruver,et al.  Motion planning with time-varying polyhedral obstacles based on graph search and mathematical programming , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[5]  J. Bobrow,et al.  Time-Optimal Control of Robotic Manipulators Along Specified Paths , 1985 .

[6]  Steven Dubowsky,et al.  Global time optimal motions of robotic manipulators in the presence of obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[7]  John M. Hollerbach,et al.  Planning a minimum-time trajectories for robot arms , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[8]  Kang G. Shin,et al.  Selection of Near-Minimum Time Geometric Paths for Robotic Manipulators , 1985, 1985 American Control Conference.

[9]  Leon S. Lasdon,et al.  Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming , 1978, TOMS.

[10]  A WesleyMichael,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .

[11]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..