A Constrained Homotopy Technique for Excluding Unwanted Solutions From Polynomial Equations Arising in Kinematics Problems

This paper presents a constrained technique which enables classical homotopy continuation solvers to exclude unwanted solutions from a system of polynomials. It is well known that extraneous and degenerate solutions often appear in polynomial equations derived from kinematics problems. These solutions usually do not have physical meanings and prevent us from understanding the intrinsic feature of the studied problem. Traditionally to exclude these solutions, we have to rely on a tedious post-processing technique which often suffers from numerical instability especially when the number of unwanted solutions is large. In the proposed constrained homotopy technique, the unwanted solutions are mapped to the solutions at infinity of a higher dimensional system. We show that the extra polynomials do not increase the homotopy path count when they are used with a classical homotopy solver. This convenient and user friendly technique does not require any changes to the homotopy codes or extra steps to post-process out unwanted solutions. Compared with the regeneration procedure, our approach offers more freedom in eliminating positive dimensional solutions. In addition, our numerical experiments show that the solutions obtained with the constrained technique seem to have a better accuracy than the post processing approach. Kinematics analysis and synthesis problems are employed to demonstrate that the technique is capable of eliminating unwanted isolated and positive dimensional solutions. In the revisit of the classical nine-point path generation of four-bar, we verify that the maximum number of distinct mechanisms is 1442 triplets.

[1]  Masha Sosonkina,et al.  Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms , 1997, TOMS.

[2]  A. Morgan,et al.  Numerical Continuation Methods for Solving Polynomial Systems Arising in Kinematics , 1990 .

[3]  B. Roth,et al.  Synthesis of Path-Generating Mechanisms by Numerical Methods , 1963 .

[4]  Anton Leykin,et al.  Numerical algebraic geometry , 2020, Applications of Polynomial Systems.

[5]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[6]  Tien-Yien Li,et al.  HOM4PS-2.0para: Parallelization of HOM4PS-2.0 for solving polynomial systems , 2009, Parallel Comput..

[7]  Akiko Takeda,et al.  PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems , 2004, Computing.

[8]  Hong Y. Lee,et al.  Displacement analysis of the general spatial 7-link 7R mechanism , 1988 .

[9]  Lung-Wen Tsai,et al.  Coupler-Point-Curve Synthesis Using Homotopy Methods , 1990 .

[10]  W. I. Zangwill,et al.  Global Continuation Methods for Finding all Solutions to Polynomial Systems of Equations in N Variables , 1980 .

[11]  A. Morgan,et al.  Complete Solution of the Nine-Point Path Synthesis Problem for Four-Bar Linkages , 1992 .

[12]  M. Raghavan The Stewart platform of general geometry has 40 configurations , 1993 .

[13]  Andrew J. Sommese,et al.  Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets , 2000, J. Complex..

[14]  Jonathan D. Hauenstein,et al.  Software for numerical algebraic geometry: a paradigm and progress towards its implementation , 2008 .

[15]  A. Morgan,et al.  Solving the Kinematics of the Most General Six- and Five-Degree-of-Freedom Manipulators by Continuation Methods , 1985 .

[16]  D. N. Bernshtein The number of roots of a system of equations , 1975 .

[17]  Bernd Sturmfels,et al.  A polyhedral method for solving sparse polynomial systems , 1995 .

[18]  B. Roth,et al.  Solving Polynomial Systems for the Kinematic Analysis and Synthesis of Mechanisms and Robot Manipulators , 1995 .

[19]  Jan Verschelde,et al.  Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.

[20]  E. Allgower,et al.  Introduction to Numerical Continuation Methods , 1987 .

[21]  Carlo Innocenti,et al.  Forward Kinematics in Polynomial Form of the General Stewart Platform , 2001 .

[22]  Bernard Roth,et al.  Kinematic analysis of the 6R manipulator of general geometry , 1991 .

[23]  Andrew J. Sommese,et al.  Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components , 2000, SIAM J. Numer. Anal..

[24]  S. Roberts On Three‐bar Motion in Plane Space , 1875 .

[25]  Masha Sosonkina,et al.  Algorithm 857: POLSYS_GLP—a parallel general linear product homotopy code for solving polynomial systems of equations , 2006, TOMS.

[26]  Charles W. Wampler,et al.  Solving a Planar Four-Bar Design Problem Using Continuation , 1990 .

[27]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .

[28]  Jonathan D. Hauenstein,et al.  Regeneration homotopies for solving systems of polynomials , 2010, Math. Comput..

[29]  Tsung-Lin Lee,et al.  HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method , 2008, Computing.

[30]  Tien-Yien Li Numerical Solution of Polynomial Systems by Homotopy Continuation Methods , 2003 .

[31]  M. Husty An algorithm for solving the direct kinematics of general Stewart-Gough platforms , 1996 .

[32]  Jan Verschelde,et al.  Advances in Polynomial Continuation for Solving Problems in Kinematics , 2004 .

[33]  Charles W. Wampler FORWARD DISPLACEMENT ANALYSIS OF GENERAL SIX-IN-PARALLEL SPS (STEWART) PLATFORM MANIPULATORS USING SOMA COORDINATES , 1996 .

[34]  Steven M. Wise,et al.  Algorithm 801: POLSYS_PLP: a partitioned linear product homotopy code for solving polynomial systems of equations , 2000, TOMS.

[35]  Joseph James Duffy,et al.  A displacement analysis of the general spatial 7-link, mechanism , 1980 .