Answers are grounded in this paper and cite their sources.
A geometric application of screw theory is used to develop a recursive algorithm for computing all singular configurations of revolute-jointed manipulators with arbitrary link geometries and an arbitrary number of joints. The depth of the recursion is linear in the number of joints, n, while the computational burden is proportional to 2n−2. This method does not require explicit construction of the Jacobian matrix elements or a determinant operation. The method is also robust with respect to the bifurcations that occur for industrial robot geometries. Further, the screw axis of the singular motion is determined at no additional cost.
No takes yet. Share an insight, caveat, or question.
Joel W. Burdick (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: