A cutting-plane algorithm for minimum-time trajectory planning of industrial robots

The optimal minimum-time trajectory planning of an m-joint industrial robot is proposed by means of a newly devised outer cutting-plane algorithm. By using piecewise cubic polynomials in the joint space, this algorithm provides a global solution to the minimum total time planning problem by adopting an interval subroutine, i.e. a procedure which uses concepts of interval analysis. An example for the 2-joint case with computational results is included.

[1]  Aurelio Piazzi,et al.  A global optimization approach to trajectory planning for industrial robots , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[2]  Jon G. Rokne,et al.  New computer methods for global optimization , 1988 .

[3]  C. Lin,et al.  Formulation and optimization of cubic polynomial joint trajectories for industrial robots , 1983 .

[4]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[5]  Ronald R. Willis,et al.  New Computer Methods for Global Optimization , 1990 .

[6]  Dan Simon.  The application of neural networks to optimal robot trajectory planning , 1993, Robotics Auton. Syst..