×

Algebraic \(\mathbb C^*\)-actions and the inverse kinematics of a general 6R manipulator. (English) Zbl 1208.65028

A numerical scheme is presented for computing the intersection of two \(m\)-dimensional algebraic subsets \(Y,Z\) of a \(2m\)-dimensional quadric hypersurface \(X\) in a complex projective space. The scheme is obtained by defining an appropriate action of the nonzero complex numbers \({\mathbb C}^\ast\) on \(X\), which then leads to two Bialynicki-Birula style cell decompositions: the positive cells, which consist of points \(x\in X\) that share the same limit point \(\lim_{t\to 0}tx\), and the negative cells, which consist of points that share the same limit \(\lim_{t\to\infty}tx\). The authors then use the \({\mathbb C}^\ast\) action to construct a homotopy \(H(t)\) on \(Y\times Z\) whose zero set \(S_0\) at \(t=0\) consists of the intersection of the positive \(m\)-dimensional cells with \(Y\), as well as the negative \(m\)-dimensional cells with \(Z\); and at \(t=1\) consists of points in \(Y\cap Z\). It is shown that, under an assumption of general position, homotopy continuation methods can be used to obtain all points in \(Y\cap Z\) by tracking points from \(S_0\) via \(H\). Versions of this result are provided in the cases when the sets \(Y,Z\) are defined implicitly, and when they are defined parametrically.
The authors then apply the above scheme to the inverse kinematical problem of determining the possible rotation angles of a robot arm, formed from six revolute joints connected by rigid links (6R chain), that will result in a desired arm configuration. In this case, the hypersurface \(X\) corresponds to the configuration space of rigid Euclidean motions in three-dimensions, which can be identified with the Study quadric – a six-dimensional hypersurface in seven-dimensional projective space. The three-dimensional subsets \(Y,Z\) are obtained by considering the first three joints and the last three joints of the arm separately; i.e., breaking the arm into two 3R chains.
Readers are assumed to be familiar with concepts from algebraic geometry; a knowledge of numerical homotopy continuation methods and robotics is useful. The article is organized and readable.

MSC:

65D18 Numerical aspects of computer graphics, image analysis, and computational geometry
Full Text: DOI

References:

[1] Angeles, J., Fundamentals of Robotic Mechanical Systems (2003), Springer-Verlag
[3] Bialynicki-Birula, A., Some theorems on actions of algebraic groups, Ann. Math., 98, 480-497 (1973) · Zbl 0275.14007
[4] Garcia, C. B.; Zangwill, W. I., Finding all solutions to polynomial systems and other systems of equations, Math. Prog., 16, 2, 159-176 (1979) · Zbl 0409.65026
[6] Huber, B.; Sturmfels, B., A polyhedral method for solving sparse polynomial systems, Math. Comp., 64, 212, 1541-1555 (1995) · Zbl 0849.65030
[8] Kleiman, S. L., The transversality of a general translate, Composit. Math., 38, 287-297 (1974) · Zbl 0288.14014
[11] Morgan, A. P.; Sommese, A. J., A homotopy for solving general polynomial systems that respects \(m\)-homogeneous structures, Appl. Math. Comput., 24, 2, 101-113 (1987) · Zbl 0635.65057
[12] Morgan, A. P.; Sommese, A. J., Coefficient-parameter polynomial continuation, Appl. Math. Comput., 29, 2 (1989), (Errata: Appl. Math. Comput. 51 (1992) 207) · Zbl 0664.65049
[13] Primrose, E. J.F., On the input-output equation of the general 7R-mechanism, Mech. Machine Theory, 21, 6, 509-510 (1986)
[14] Selig, J. M., Geometric Fundamentals of Robotics. Geometric Fundamentals of Robotics, Monographs in Computer Science (2005), Springer-Verlag · Zbl 1062.93002
[15] Sommese, A. J.; Verschelde, J.; Wampler, C. W., A method for tracking singular paths with application to the numerical irreducible decomposition, (Beltrametti, M. C.; etal., Algebraic Geometry, A Volume in Memory of Paolo Francia (2002), W. de Gruyter), 329-345 · Zbl 1014.65035
[16] Sommese, A. J.; Wampler, C. W., The Numerical Solution of Systems of Polynomials Arising in Engineering and Science (2005), World Scientific · Zbl 1091.65049
[17] Su, H.-J.; McCarthy, J. M.; Sosonkina, M.; Watson, L. T., Algorithm 857: POLSYS_GLP - a parallel general linear product homotopy code for solving polynomial systems of equations, ACM Trans. Math. Software, 32, 561-579 (2006) · Zbl 1230.65058
[18] Verschelde, J., Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation, ACM Trans. Math. Software, 25, 2, 251-276 (1999), (Software Available at <www.math.uic.edu/∼jan>) · Zbl 0961.65047
[19] Verschelde, J.; Cools, R., Symbolic homotopy construction, Appl. Algebra Eng. Commun. Comput., 4, 169-183 (1993) · Zbl 0804.65058
[20] Verschelde, J.; Verlinden, P.; Cools, R., Homotopies exploiting Newton polytopes for solving sparse polynomial systems, SIAM J. Numer. Anal., 31, 3, 915-930 (1994) · Zbl 0809.65048
[21] Watson, L. T.; Sosonkina, M.; Melville, R. C.; Morgan, A. P.; Walker, H. F., Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms, ACM Trans. Math. Software, 23, 514-549 (1997) · Zbl 0913.65042
[22] Wise, S. M.; Sommese, A. J.; Watson, L. T., Algorithm 801: POLSYS_PLP: a partitioned linear product homotopy code for solving polynomial systems of equations, ACM Trans. Math. Software, 26, 176-200 (2000) · Zbl 1137.65353
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.