Results 1 
8 of
8
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
, 2001
"... In engineering and applied mathematics, polynomial systems arise whose solution sets contain components of different dimensions and multiplicities. In this article we present algorithms, based on homotopy continuation, that compute much of the geometric information contained in the primary decomposi ..."
Abstract

Cited by 58 (27 self)
 Add to MetaCart
In engineering and applied mathematics, polynomial systems arise whose solution sets contain components of different dimensions and multiplicities. In this article we present algorithms, based on homotopy continuation, that compute much of the geometric information contained in the primary decomposition of the solution set. In particular, ignoring multiplicities, our algorithms lay out the decomposition of the set of solutions into irreducible components, by finding, at each dimension, generic points on each component. As byproducts, the computation also determines the degree of each component and an upper bound on itsmultiplicity. The bound issharp (i.e., equal to one) for reduced components. The algorithms make essential use of generic projection and interpolation, and can, if desired, describe each irreducible component precisely as the common zeroesof a finite number of polynomials.
Advances in Polynomial Continuation for Solving Problems in Kinematics
, 2004
"... For many mechanical systems, including nearly all robotic manipulators, the set of possible configurations that the links may assume can be described by a system of polynomial equations. Thus, solving such systems is central to many problems in analyzing the motion of a mechanism or in designing a m ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
For many mechanical systems, including nearly all robotic manipulators, the set of possible configurations that the links may assume can be described by a system of polynomial equations. Thus, solving such systems is central to many problems in analyzing the motion of a mechanism or in designing a mechanism to achieve a desired motion. This paper describes techniques, based on polynomial continuation, for numerically solving such systems. Whereas in the past, these techniques were focused on finding isolated roots, we now address the treatment of systems having higherdimensional solution sets. Special attention is given to cases of exceptional mechanisms, which have a higher degree of freedom of motion than predicted by their mobility. In fact, such mechanisms often have several disjoint assembly modes, and the degree of freedom of motion is not necessarily the same in each mode. Our algorithms identify all such assembly modes, determine their dimension and degree, and give sample points on each.
Solving the kinematics of planar mechanisms by Dixon determinant and a complexplane formulation
 ASME J. Mech. Design
, 2001
"... This paper presents a general method for the analysis of any planar mechanism consisting of rigid links connected by revolute and slider joints. The method combines the complex plane formulation of Wampler (1999) with the Dixon determinant procedure of Nielsen and Roth (1999). The result is simple t ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
This paper presents a general method for the analysis of any planar mechanism consisting of rigid links connected by revolute and slider joints. The method combines the complex plane formulation of Wampler (1999) with the Dixon determinant procedure of Nielsen and Roth (1999). The result is simple to derive and implement, so in addition to providing numerical solutions, the approach facilitates analytical explorations. The procedure leads to a generalized eigenvalue problem of minimal size. Both input/output problems and the derivation of tracing curve equations are addessed. NOMENCLATURE ℓ Number of kinematic loops. θj eiΘj,whereΘjisan angle, in radians. z ∗ Complex conjugate of z. 1
On closedform solutions to the position analysis of Baranov trusses
 Mechanism and Machine Theory 50 (2012) 179
"... The exact position analysis of a planar mechanism reduces to compute the roots of its characteristic polynomial. Obtaining this polynomial usually involves, as a first step, obtaining a system of equations derived from the independent kinematic loops of the mechanism. Although conceptually simple, t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The exact position analysis of a planar mechanism reduces to compute the roots of its characteristic polynomial. Obtaining this polynomial usually involves, as a first step, obtaining a system of equations derived from the independent kinematic loops of the mechanism. Although conceptually simple, the use of kinematic loops for deriving characteristic polynomials leads to complex variable eliminations and, in most cases, trigonometric substitutions. As an alternative, a method based on bilateration has recently been shown to permit obtaining the characteristic polynomials of the threeloop Baranov trusses without relying on variable eliminations or trigonometric substitutions. This paper shows how this technique can be applied to solve the position analysis of all catalogued Baranov trusses. The characteristic polynomials of them all have been derived and, as a result, the maximum number of their assembly modes has been obtained. A comprehensive literature survey is also included.
Displacement Analysis of Spherical Mechanisms Having Three or Fewer Loops
"... Spherical linkages, having rotational joints whose axes coincide in a common center point, are sometimes used in multidegreeoffreedom robot manipulators and in onedegreeoffreedom mechanisms. The forward kinematics of parallellink robots, the inverse kinematics of seriallink robots and the inp ..."
Abstract
 Add to MetaCart
Spherical linkages, having rotational joints whose axes coincide in a common center point, are sometimes used in multidegreeoffreedom robot manipulators and in onedegreeoffreedom mechanisms. The forward kinematics of parallellink robots, the inverse kinematics of seriallink robots and the input/output motion of singledegreeoffreedom mechanisms are all problems in displacement analysis. In this article, loop equations are formulated and solved for the displacement analysis of all spherical mechanisms up to three loops. We show how to solve each mechanism type using either a formulation in terms of rotation matrices or quaternions. In either formulation, the solution method is a modification of Sylvester’s elimination method, leading directly to numerical calculation via standard eigenvalue routines. �DOI: 10.1115/1.1637653� 1
Formulating Assur Kinematic Chains as Projective Extensions of Baranov Trusses
"... The real roots of the characteristic polynomial of a planar linkage determine its assembly modes. In this work it is shown how the characteristic polynomial of a Baranov truss derived using a distancebase formulation contains all the necessary and sufficient information for solving the position ana ..."
Abstract
 Add to MetaCart
The real roots of the characteristic polynomial of a planar linkage determine its assembly modes. In this work it is shown how the characteristic polynomial of a Baranov truss derived using a distancebase formulation contains all the necessary and sufficient information for solving the position analysis of the Assur kinematic chains resulting from replacing some of its revolute joints by slider joints. This is a relevant result because it avoids the casebycase treatment that requires new sets of variable eliminations to obtain the characteristic polynomial of each Assur kinematic chain.
Contents lists available at ScienceDirect Mechanism and Machine Theory
"... journal homepage: www.elsevier.com/locate/mechmt Distancebased position analysis of the three sevenlink Assur ..."
Abstract
 Add to MetaCart
journal homepage: www.elsevier.com/locate/mechmt Distancebased position analysis of the three sevenlink Assur
Comparison of probabilistic algorithms for analyzing the components of
"... an affine algebraic variety ..."