Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call