Home /Research /Improving the efficiency of time-optimal path-following algorithms
MANIPULATION

Improving the efficiency of time-optimal path-following algorithms

J.-J.E. Slotine, Hyun Seok Yang

Year
1989
Citations
215

Abstract

A method is presented which significantly improves the computational efficiency of time-optimal path-following planning algorithms for robot manipulators with limited actuator torques. Characteristics switching points are identified and characterized analytically as functions of the single parameter defining the position along the path. Limit curves are then constructed from the characteristic switching points, in contrast with the so-called maximum velocity curve approach of existing methods. An efficient algorithm is proposed which utilizes the characteristics of the defined concepts. The algorithm can also account for viscous friction effects and smooth state-dependent actuator bounds. A numerical example, while showing the consistency of the algorithm with the existing techniques, demonstrates its potential for increasing computational efficiency by several orders of magnitude.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

AlgorithmPath (computing)Consistency (knowledge bases)Position (finance)Limit (mathematics)Computer scienceComputational complexity theoryMotion planningEfficient algorithmMathematics

Related papers

Browse all MANIPULATION papers