This paper provides a method for computing force-feasible paths on the Stewart platform. Given two configurations of the platform, the method attempts to connect them through a path that, at any point, allows the platform to counteract any external wrench lying inside a predefined six-dimensional region. In particular, the Jacobian matrix of the manipulator will be full rank along such path, so that the path will not traverse the forward singularity locus at any point. The path is computed by first characterizing the force-feasible C-space of the manipulator as the solution set of a system of equations, and then using a higher-dimensional continuation technique to explore this set systematically from one configuration, until the second configuration is found. Examples are included that demonstrate the performance of the method on illustrative situations. ; Preprint
Planning singularity-free force-feasible paths on the Stewart platform
2012-01-01
Sonstige
Elektronische Ressource
Englisch
DDC: | 629 |
Singularity-free path planning for the Stewart platform manipulator
Online Contents | 1998
|Determination of the maximal singularity-free orientation workspace for the Gough–Stewart platform
Online Contents | 2009
|