Multi-loop Position Analysis via Iterated Linear Programming

This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology. It is also complete, meaning that all possible solutions get accurately bounded, irrespectively of whether the analyzed linkage is rigid or mobile. The problem is tackled by formulating a system of linear, parabolic, and hyperbolic equations, which is here solved by a new strategy exploiting its structure. The method is conceptually simple, geometric in nature, and easy to implement, yet it provides solutions at the desired accuracy in short computation times.

[1]  Ferdinand Freudenstein,et al.  Closure to “Discussions of ‘Synthesis of Path-Generating Mechanisms by Numerical Methods’” (1963, ASME J. Eng. Ind., 85, pp. 305–306) , 1963 .

[2]  C. B. García,et al.  On the Number of Solutions to Polynomial Systems of Equations , 1980 .

[3]  J. Yorke,et al.  The cheater's homotopy: an efficient procedure for solving systems of polynomial equations , 1989 .

[4]  Jean-Pierre Merlet,et al.  An improved design algorithm based on interval analysis for spatial parallel manipulator with specified workspace , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[6]  H. Scheraga,et al.  Exact analytical loop closure in proteins using polynomial equations , 1999 .

[7]  Alexander P. Morgan A homotopy for solving polynomial systems , 1986 .

[8]  J. Merlet,et al.  A formal-numerical approach to determine the presence of singularity within the workspace of a parallel robot. , 2001 .

[9]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .

[10]  Christoph M. Hoffmann,et al.  A graph-constructive approach to solving systems of geometric constraints , 1997, TOGS.

[11]  Dinesh Manocha,et al.  Efficient inverse kinematics for general 6R manipulators , 1994, IEEE Trans. Robotics Autom..

[12]  Chandrajit L. Bajaj,et al.  Generation of Configuration Space Obstacles: Moving Algebraic Surfaces , 1990, Int. J. Robotics Res..

[13]  Josep M. Porta,et al.  CuikSLAM: A Kinematics-based Approach to SLAM , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[14]  W. Rheinboldt,et al.  Pathways to Solutions, Fixed Points, and Equilibria. , 1983 .

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

[16]  Ileana Streinu,et al.  The Number of Embeddings of Minimally Rigid Graphs , 2004, Discret. Comput. Geom..

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

[18]  A. Castellet,et al.  An Algorithm for the Solution of Inverse Kinematics Problems Based on an Interval Method , 1998 .

[19]  Jean-Pierre Merlet,et al.  Parallel Robots , 2000 .

[20]  David A. Cox,et al.  Solving Polynomial Equations: Foundations, Algorithms, and Applications (Algorithms and Computation in Mathematics) , 2005 .

[21]  B. Roth,et al.  Inverse Kinematics of the General 6R Manipulator and Related Linkages , 1993 .

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

[23]  K. Sridharan Computing two penetration measures for curved 2D objects , 1999, Inf. Process. Lett..

[24]  S. Agrawal,et al.  Inverse kinematic solution of robot manipulators using interval analysis , 1998 .

[25]  James Nielsen,et al.  On the Kinematic Analysis of Robotic Mechanisms , 1999, Int. J. Robotics Res..

[26]  Eric Walter,et al.  Guaranteed solution of direct kinematic problems for general configurations of parallel manipulators , 1998, IEEE Trans. Robotics Autom..

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

[28]  Bo Yuan,et al.  On Spatial Constraint Solving Approaches , 2000, Automated Deduction in Geometry.

[29]  Lydia E. Kavraki,et al.  Randomized path planning for linkages with closed kinematic chains , 2001, IEEE Trans. Robotics Autom..

[30]  Nicholas M. Patrikalakis,et al.  Computation of the solutions of nonlinear polynomial systems , 1993, Comput. Aided Geom. Des..

[31]  J. Denavit,et al.  A kinematic notation for lower pair mechanisms based on matrices , 1955 .