Direct Position Analysis of a Large Family of Spherical and Planar Parallel Manipulators with Four Loops

Similar documents
Closed-Form Solution to the Position Analysis of Watt-Baranov Trusses Using the Bilateration Method

Closed-Form Solution to the Position Analysis of Watt-Baranov Trusses Using the Bilateration Method

DYNAMICS OF PARALLEL MANIPULATOR

Kinematic Analysis of the 6R Manipulator of General Geometry

DYNAMICS OF PARALLEL MANIPULATOR

MECH 576 Geometry in Mechanics November 30, 2009 Kinematics of Clavel s Delta Robot

Displacement Analysis of Spherical Mechanisms Having Three or Fewer Loops

Distance Formula in 3-D Given any two points P 1 (x 1, y 1, z 1 ) and P 2 (x 2, y 2, z 2 ) the distance between them is ( ) ( ) ( )

ROBOTICS: ADVANCED CONCEPTS & ANALYSIS

MATHEMATICS. Units Topics Marks I Relations and Functions 10

MECH 576 Geometry in Mechanics September 16, 2009 Using Line Geometry

Vectors and Geometry

A Robust Forward Kinematics Analysis of 3-RPR Planar Platforms

OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1

Math 302 Outcome Statements Winter 2013

Multi-body Singularity Equations IRI Technical Report

Kinematic Analysis of a Pentapod Robot

13 Path Planning Cubic Path P 2 P 1. θ 2

Chapter 8. Rigid transformations

2. TRIGONOMETRY 3. COORDINATEGEOMETRY: TWO DIMENSIONS

1. Vectors and Matrices

THE ENVELOPE OF LINES MEETING A FIXED LINE AND TANGENT TO TWO SPHERES

Algebraic. techniques1

Tennessee s State Mathematics Standards - Algebra II

TECHNICAL RESEARCH REPORT

A Correlation of. Pearson Integrated CME Project. to the. Common Core State Standards for Mathematics - High School PARRC Model Content Frameworks

Differential Kinematics

MATH Final Review

Matrices and Vectors

Truss Structures: The Direct Stiffness Method

Generalized Forces. Hamilton Principle. Lagrange s Equations

Robotics I. Classroom Test November 21, 2014

Chapter 7. Linear Algebra: Matrices, Vectors,

Rigid Geometric Transformations

Rigid Geometric Transformations

A Robust Forward-Displacement Analysis of Spherical Parallel Robots

Results on Planar Parallel Manipulators with Cylindrical Singularity Surface

Screw Theory and its Applications in Robotics

Extra Problems for Math 2050 Linear Algebra I

NOTES ON LINEAR ALGEBRA CLASS HANDOUT

, respectively to the inverse and the inverse differential problem. Check the correctness of the obtained results. Exercise 2 y P 2 P 1.

Kinematic Isotropy of the H4 Class of Parallel Manipulators

Appendix C Vector and matrix algebra

Math 3108: Linear Algebra

DIFFERENTIAL KINEMATICS. Geometric Jacobian. Analytical Jacobian. Kinematic singularities. Kinematic redundancy. Inverse differential kinematics

Trajectory-tracking control of a planar 3-RRR parallel manipulator

Singular Foci of Planar Linkages

Core A-level mathematics reproduced from the QCA s Subject criteria for Mathematics document

MATH2210 Notebook 2 Spring 2018

Planar Stewart Gough platforms with quadratic singularity surface

13 Spherical geometry

WA State Common Core Standards - Mathematics

Information About Ellipses

Evaluation of a 4-Degree of Freedom Parallel Manipulator Stiffness

Mathematics Syllabus UNIT I ALGEBRA : 1. SETS, RELATIONS AND FUNCTIONS

ME Machine Design I. EXAM 1. OPEN BOOK AND CLOSED NOTES. Wednesday, September 30th, 2009

LINEAR SYSTEMS, MATRICES, AND VECTORS

Tin Ka Ping Secondary School F.5 Mathematics Module 2 Teaching Syllabus

Introduction. Chapter Points, Vectors and Coordinate Systems

Integrated CME Project Mathematics I-III 2013

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

Catchup Math and the Common Core Standards. Spring 2011

Linear Algebra: Matrix Eigenvalue Problems

vand v 3. Find the area of a parallelogram that has the given vectors as adjacent sides.

Linear Algebra V = T = ( 4 3 ).

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

Notes on multivariable calculus

Elementary maths for GMT

STATE COUNCIL OF EDUCATIONAL RESEARCH AND TRAINING TNCF DRAFT SYLLABUS.

Contents. D. R. Wilkins. Copyright c David R. Wilkins

5. Vector Algebra and Spherical Trigonometry (continued)

Congruent Stewart Gough platforms with non-translational self-motions

Robotics & Automation. Lecture 17. Manipulability Ellipsoid, Singularities of Serial Arm. John T. Wen. October 14, 2008

Elementary maths for GMT

Largest Area Ellipse Inscribing an Arbitrary Convex Quadrangle

Robotics I. February 6, 2014

CP3 REVISION LECTURES VECTORS AND MATRICES Lecture 1. Prof. N. Harnew University of Oxford TT 2013

ON THE INVERSE KINEMATICS OF A FRAGMENT OF PROTEIN BACKBONE

Crash Course in Trigonometry

DIHEDRAL GROUPS II KEITH CONRAD

Pearson Mathematics Algebra 2 Common Core 2015

Common Tangents to Spheres in R 3

Mathematics Trigonometry: Unit Circle

Maths for Map Makers

TRIPLE-SYSTEMS AS TRANSFORMATIONS, AND THEIR PATHS

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Linear Algebra and Eigenproblems

Decentralized Stabilization of Heterogeneous Linear Multi-Agent Systems

(b) If a multiple of one row of A is added to another row to produce B then det(b) =det(a).

An algebraic formulation of static isotropy and design of statically isotropic 6-6 Stewart platform manipulators

Chapter 1. Preliminaries

MAT1035 Analytic Geometry

Math Requirements for applicants by Innopolis University

Chapter 2 Notes, Linear Algebra 5e Lay

TS EAMCET 2016 SYLLABUS ENGINEERING STREAM

Algebra II Vocabulary Alphabetical Listing. Absolute Maximum: The highest point over the entire domain of a function or relation.

Reconfiguration analysis of a 4-RUU parallel manipulator

CSL361 Problem set 4: Basic linear algebra

Vectors. The standard geometric definition of vector is as something which has direction and magnitude but not position.

Assuming the Earth is a sphere with radius miles, answer the following questions. Round all answers to the nearest whole number.

Transcription:

Proceedings of the Second International Workshop on Fundamental Issues and Future Research Directions for Parallel Mechanisms and Manipulators September 1, 8, Montpellier, France N. Andreff, O. Company, M. Gouttefarde, S. Krut and F. Pierrot, editors Direct Position Analysis of a Large Family of Spherical and Planar Parallel Manipulators with Four Loops JÚLIA BORRÀS Institut de Robòtica i Informàtica Industrial (UPC-CSIC) Barcelona, Spain jborras@iri.upc.edu RAFFAELE DI GREGORIO(*) Department of Engineering (EnDiF) - University of Ferrara Ferrara, Italy rdigregorio@ing.unife.it (*) Corresponding author. Abstract: The direct position analysis (DPA) of a manipulator is the computation of the end-effector poses (positions and orientations) compatible with assigned values of the actuated-joint variables. Assigning the actuated-joint variables corresponds to considering the actuated joints locked, which makes the manipulator a structure. The solutions of the DPA of a manipulator one-to-one correspond to the assembly modes of the structure that is generated by locking the actuated-joint variables of that manipulator. Determining the assembly modes of a structure means solving the DPA of a large family of manipulators since the same structure can be generated from different manipulators. This paper provides an algorithm that determines all the assembly modes of two structures with the same topology which are generated from two families of mechanisms: one planar and the other spherical. The topology of these structures is constituted of nine links (one quaternary link, four ternary links and four binary links) connected through twelve revolute pairs to form four closed loops. 1 Introduction The direct position analysis (DPA) of a manipulator is the computation of the end-effector poses (positions and orientations) compatible with assigned values of the actuated-joint variables. Assigning the actuated-joint variables corresponds to considering the actuated joints locked, which makes the manipulator a structure. The solutions of the DPA of a manipulator one-to-one correspond to the assembly modes of the structure generated by locking the actuated-joint variables of that manipulator. Determining the assembly modes of a structure means solving the DPA of a large family of manipulators since the same structure can be generated from different manipulators. The solution of the DPA of parallel manipulators (PMs) is a difficult and challenging task since, in general, it involves the solution of a system of non-linear equations. Spherical parallel manipulators (SPMs) are PMs where the end-effector performs only spherical motions with a center fixed to the frame. SPMs can be collected into two subsets: (i) the set of the SPMs where only the end-effector and few (or no) other links perform spherical motions with the same center, and (ii) the set of the SPMs where all the links perform spherical motions with the same center. When the actuated joints are locked, both these two types of SPMs become structures whose assembly modes can be identified by considering equivalent structures where the links are connected only through revolute pairs with axes that converge toward the spherical motion center. Such structures will be called spherical structures (SSs). Structures composed of links connected only through revolute pairs are also generated from a large family of planar parallel manipulators (PPMs) by locking the actuated joints. In this case, all the revolute pair axes are parallel to one another, and perpendicular to the plane of motion. Such structures will be called planar structures (PSs). When the topology of a structure is analyzed, only the number and the type (binary, ternary, etc.) of links, and the type of kinematic pairs that connect the links to one another are considered. Therefore, the SSs and the PSs share the same set of topologies. Moreover, by using the Grübler-Kutzbach equation, it is easy to demonstrate that, in the SSs and the PSs, the number of loops, l, the number of links, m, and the number of revolute pairs, r, are related by the following two relationships: m = l + 1; r = 3l. Sometimes structures contain substructures (i.e. an subset of links that form a structure by themselves). A substructure can be substituted into the original structure by a unique link whose shape depend on the assembly modes of the substructure. This substitution process ends when no other substructure can be identified in the last obtained structure. In the literature, structures that do not contain substructure have been called Assur kinematic chains (AKCs). The determination of all the assembly modes of 1

$! % # " & any structure can be implemented by exploiting a set of algorithms that solve all the AKCs (Innocenti (199)). The solution of the DPA of all the SPMs can be implemented by classifying all the SS topologies which refer to AKCs, and, then, by providing, for each identified topology, an algorithm that computes the assembly modes of the AKC with that topology. The fact that the set of SS topologies coincides with the one of PSs allows the wide literature on planar mechanisms to be exploited (Wampler ()). In particular (see Innocenti (199)), there are one single-loop AKC topology (the triad), one double-loop AKC topology (the pentad), and three triple-loop AKC topologies. Moreover, Manolescu (1973) gave a complete classification of triple-loop topologies and how they are built. Eventually, Shen et al. () identified all the AKC topologies with up to four loops. So doing, they showed that there are 8 quadruple-loop AKC topology. The algorithms that analytically calculate all the assembly modes of the AKCs up to three loops have been already presented both for the planar case (see Innocenti (199) for the Refs.), and for the spherical case (see Wampler () for the Refs.). This paper addresses the determination of the assembly modes of the structures, either planar or spherical, with one out of the 8 quadruple-loop AKC topologies. And it provides one algorithm, which is applicable to the planar and the spherical cases and solves the closure-equation systems of these structures in analytical form. In particular, the topology of these structures is the one reported in Fig. 1, and it is constituted of nine links (one quaternary link, four ternary links and four binary links) connected through twelve revolute pairs to form four closed loops. F F F " F! Figure 1: Topology of the studied structures: graph vertices represent links, graph edges represent joints (R stands for revolute pair). Basic concepts The closure equations of a structure (or a mechanism) can be written in many ways. The most common techniques are based on the use of the loop equations which are a fixed number, say n, of independent scalar equations that can be written for each independent loop appearing in the structure. When the structure contains a number of particular binary links at least equal to the number of independent loops, and the choice of the independent loops can be operated so that each loop contains at least one binary link not included in the other loops, the number n can be reduced to one, and the closure-equation system can be reduced to a number of scalar equations equal to the number of loops. The analysis of Fig. 1 reveals that, in the structures under study, four independent loops with one binary link can be easily individuated: (1) loop -1-- (link is binary), () loop --6-3 (link 6 is binary), (3) loop -3-7- (link 7 is binary), and () loop --8-1 (link 8 is binary). All these loops are four-bar loops with only revolute pairs. Both in the planar case and in the spherical case, the revolute pair axes are located by points lying on the motion plane 1 (planar case) or on the unit sphere (spherical case). In our case, this technique simply consist in writing, for each loop, that the distance (either on the motion plane or on the unit sphere 3 ) between the two points locating the revolute-pair axes at the endings of the binary link is constant. In the next sections this technique will be used to write a minimal set of closure equations both for the planar case and for the spherical case. 3 Closure equations By using the above-mentioned technique to write the closure equations, the resulting closure equations are very similar in the two cases under study, and the same elimination technique can be adopted for determining a univariate polynomial equation to solve. In the following subsections, the closure-equation system will be deduced for both the cases. 3.1 Planar structure Figure shows the planar structure with the topology of Fig.1. With reference to Fig., Q i for i = 1,...,, are the points which locate the axes of the revolute pairs that join the quaternary link (link ) to the i-th ternary link (i = 1,...,). P ji for j = 1,, and i = 1,...,, are the points that locate the axes of the revolute pairs that join the i-th ternary link to the two adjacent binary links. Figure 3 shows the i-th loop (i = 1,...,) of the PS, and the notation that will be used to deduce its loop equation. With reference to Fig. 3, the link-index k is equal to (i + 1) modulo. r i is the length of the segment Q i Q k. r ji (r jk ), j = 1,, is the length of the segment Q i P ji (Q k P jk ). And r 3(i+) is the length of the segment P i P 1k. The angles β i, and γ i (β k, and γ k ) 1 The motion plane is a plane surface perpendicular to all the revolute pair axes. The unit sphere is a sphere surface with unit radius, and center coincident with the center of the spherical motion. It is worth noting that the unit sphere is perpendicular to all the revolute-pair axes since all the revolute-pair axes converge toward the center of the spherical motion. 3 The distance between two points on a sphere surface is the length of the shortest great-circle arc joining the two points. On the unit sphere, this distance coincides with the convex central angle delimited by the two radii passing through the two points, if the angle is measured in radians.

E P 6 P 1 Q loop loop 1 P 1 Q 1 1 loop P 11 8 H > O E E " H! E " H G 3 H E C N E E H E 3 E C E > E G E H E E Q P 13 3 P 3 Q 3 loop 3 7 P 1 Figure : Four-loop PS with the topology of Fig. 1. P are the interior angles at Q i (Q k ) of link i (link k) and link, respectively. The angle θ i (θ k ) is the joint variable of the revolute pair located by Q i (Q k ). Eventually, the reference system Q i x i y i is a Cartesian reference system, fixed to link, that will be used to write the loop equation of the i-th loop. It is worth noting that the eight geometric constants of the quaternary link (i.e., γ i and r i for i = 1,...,) are related by the following three scalar equations (see Figs. and 3): γ i = π i=1 r 1 r cos γ = r cos γ 1 r 3 cos(γ 1 + γ ) r sin γ = r sinγ 1 r 3 sin(γ 1 + γ ) (1a) (1b) (1c) With these notations, the position vectors of the points P i and P 1k, in the reference system Q i x i y i, have the following explicit expressions (i = 1,...,;k = (i + 1) modulo ): i P i = ( ai c i b i s i a i s i + b i c i ) ; i P 1k = ( r 1k s k r i r 1k c k ) ; () where the left superscript i indicates that the vectors are measured in Q i x i y i. c i (c k ), and s i (s k ) stand for cos θ i (cos θ k ), and sinθ i (sinθ k ), respectively. Eventually, a i and b i are geometric constants with the following explicit expressions: a i = r i cos (γ i + β i 3 ) π (3a) b i = r i sin (γ i + β i 3 ) π (3b) By reminding that the distance r 3(i+) between the points P i and P 1k (see Fig. 3) can be expressed through the coordinates of the two points, measured in any Cartesian reference system, the following set of closure equations can be written for the PS under study: Figure 3: i-th loop of the PS: notation (i = 1,...,; k = (i + 1) modulo ). ( i P i i P 1k ) = r 3(i+), i = 1,...,;k = (i + 1) modulo. The introduction of the explicit expressions () into Eqs. () yields the following system of closure equations in explicit form: (a i c i b i s i r 1k s k ) + (a i s i + b i c i r i + r 1k c k ) r 3(i+) =, i = 1,...,;k = (i + 1) modulo. Closure equations () constitute a system of four scalar equations in four unknowns: the four joint variables θ i, i = 1,...,. By expanding (), system () becomes: g i + g i1 s i + g i c i + g i3 c k + g i (s i c k c i s k ) + g i (c i c k + s i s k ) =, i = 1,...,;k = (i + 1) modulo. where the constant coefficients g in, n =,1,...,, have the following explicit expressions: g i = r i + r 1k + r i r 3(i+) ; g i1 = r i a i ; g i = r i b i ; g i3 = r i r 1k ; g i = r 1k a i ; g i = r 1k b i. () () (6) (7a) (7b) (7c) Each equation of system (6) is linear both in c i and s i, and in c k and s k. 3. Spherical structure Figure shows the spherical structure with the topology of Fig.1. With reference to Fig., O is the center of the unit sphere; Q i for i = 1,...,, are the points which locate, on the unit sphere, the axes of the revolute pairs that join the quaternary link (link ) to the i-th ternary link (i = 1,...,). P ji for j = 1,, and i = 1,...,, are the points that locate, on the unit sphere, the axes of the revolute pairs that join the i-th ternary link to the two adjacent binary links. 3

$! 3 # % " & E! F 3!! F F! 3 " 3 F " " " O E H > H 3 E " H! E " G H E C N E E H E 3 E C E > E G E E H E E Figure : Four-loop SS with the topology of Fig. 1. Figure shows the i-th loop (i = 1,...,) of the SS, and the notation that will be used to deduce its loop equation. With reference to Fig., the link-index k is equal to (i + 1) modulo. ρ i is the convex central angle Q i OQ k. ρ ji (ρ jk ), j = 1,, is the convex central angle Q i OP ji ( Q k OP jk ). And ρ 3(i+) is the convex central angle P i OP 1k. The angles β i, and γ i (β k, and γ k ) are the dihedral angles at the edge OQ i (OQ k ) of link i (link k) and link, respectively. The angle θ i (θ k ) is the joint variable of the revolute pair located by Q i (Q k ). Eventually, the reference system Ox i y i z i is a Cartesian reference system, fixed to link, that will be used to write the loop equation of the i-th loop. It is worth noting that the eight geometric constants of the quaternary link (i.e., γ i and ρ i for i = 1,...,) are related by any tern of independent scalar equations deducible from the following matrix equation (see Figs. and ): 1 R R 3 3 R R 1 = I (8) where I is the 3 3 identity matrix; whereas k R i, k = (i + 1) modulo, is the rotation matrix that transforms vector components measured in Ox i y i z i into vector components measured in Ox k y k z k. k R i has the following explicit expression: k R i = R x ( ρ i )R z (π γ k ) (9) where the following elementary rotation matrices have been introduced 1 R x (α) = cos α sin α ; (1a) sin α cos α cos α sin α R z (α) = sinα cos α. (1b) 1 The measure of the convex central angle between two radius vectors gives the distance, on the unit sphere, between the two points located on the sphere by the two radius vectors. Figure : i-th loop of the SS: notation (i = 1,...,; k = (i + 1) modulo ). With these notations, the position vectors of the points P i and P 1k, in the reference system Ox i y i z i, have the following explicit expressions (i = 1,...,;k = (i + 1) modulo ): i P i = u i c i v i s i u i s i + v i c i w i ; i P 1k = s 1k s k c 1k s i s 1k c i c k c 1k c i + s 1k s i c k (11) where the left superscript i indicates that the vectors are measured in Ox i y i z i. c i (c k ), and s i (s k ) stand for cos θ i (cos θ k ), and sin θ i (sinθ k ), respectively; whereas c i (c 1k ), and s i (s 1k ) stand for cos ρ i (cos ρ 1k ), and sinρ i (sin ρ 1k ), respectively. Eventually, u i, v i and w i are geometric constants with the following explicit expressions: u i = sinρ i cos (γ i + β i 3 ) π v i = sinρ i sin (γ i + β i 3 ) π w i = cos ρ i ; (1a) (1b) (1c) Since cos ρ 3(i+) is equal to the dot product of the position vectors of the two unit-sphere points P i and P 1k (see Fig. ) in any Cartesian reference system with origin at O, the following set of closure equations can be written for the SS under study: i P T i i P 1k = c 3(i+), i = 1,...,;k = (i+1) modulo. (13) where c 3(i+) stands for cos ρ 3(i+), and the right superscript ( ) T denotes the transpose of ( ). The i-th equation (13) analytically expresses the fact that the distance, on the unit sphere, between the two unit-sphere points P i and P 1k is constant; hence, it is the spherical counterpart of the the i-th equation (). Remind that radius vectors of the unit sphere coincide with position vectors of the unit-sphere points, located by the radius vectors, in Cartesian reference systems with origin at the unit-sphere center O.

The introduction of the explicit expressions (11) into Eqs. (13) yields the following system of closure equations in explicit form: (u i c i v i s i )s 1k s k + (u i s i + v i c i )(c 1k s i s 1k c i c k )+ w i (c 1k c i + s 1k s i c k ) c 3(i+) =, i = 1,...,;k = (i + 1) modulo. (1) Closure equations (1) constitute a system of four scalar equations in four unknowns: the four joint variables θ i, i = 1,...,. By expanding (1), system (1) becomes: h i + h i1 s i + h i c i + h i3 c k + h i s i c k + h i c i s k + h i6 c i c k + h i7 s i s k =, i = 1,...,;k = (i + 1) modulo. (1) where the constant coefficients h in, n =,1,...,7, have the following explicit expressions: h i = w i c 1k c i c 3(i+) ; h i1 = u i c 1k s i ; h i = v i c 1k s i ; h i3 = w i s 1k s i ; h i = u i s 1k c i ; h i = u i s 1k ; h i6 = v i s 1k c i ; h i7 = v i s 1k. (16a) (16b) (16c) Each equation of system (1) is linear both in c i and s i, and in c k and s k. Solution technique The closure-equation systems (6) and (1) can be transformed into algebraic-equation systems by using the following trigonometric identities: c i = 1 t i 1 + t ; s i = t i i 1 + t ; i = 1,..., (17) i where t i, i = 1,...,, is equal to tan(θ i /). So doing, both system (6), and system (1) are put in the following form: n= m= d inm t n i t m k = ; i = 1,...,; k = (i + 1) modulo (18) where the explicit expressions of the constant coefficients d inm, n,m =,1,, are reported in the appendices A and B for the PS and the SS, respectively. The first (i = 1) and the fourth (i = ) equations of system (18) can be rewritten in the following form: A t 1 + A 1 t 1 + A = B t 1 + B 1 t 1 + B = (19a) (19b) where A j = d 1j t + d 1j1 t + d 1j and B j = d j t + d 1j t + d j, for j =,1,. Moreover, the second (i = ) and the third (i = 3) equations of system (18) can be rewritten in the following form: E t 3 + E 1 t 3 + E = F t 3 + F 1 t 3 + F = (a) (b) where E j = d j t + d 1j t + d j and F j = d 3j t + d 3j1 t + d 3j, for j =,1,. The product of both the Eqs. (19) by t 1 yields two more equations that, when added to (19), give the following homogeneous system: M 1 f 1 = (1) where f 1 is equal to (t 3 1,t 1,t 1,1) T, whereas M 1 is a matrix defined as follows A A 1 A M 1 = B B 1 B A A 1 A () B B 1 B On the other side, the product of both the Eqs. () by t 3 yields two more equations that, when added to (), give the following homogeneous system: M f = (3) where f is equal to (t 3 3,t 3,t 3,1) T, whereas M is a matrix defined as follows E E 1 E M = F F 1 F E E 1 E () F F 1 F The two homogeneous systems (1) and (3) admit nontrivial solutions, for f 1 and f respectively, if and only if the two determinants det(m 1 ) and det(m ) are equal to zero (i.e., their coefficient matrices are singular). Since the entries of the first and the third rows of both the matrices are quadrics in t, whereas their second and forth rows are quadrics in t, the vanishing condition of det(m 1 ) and det(m ) yields the following two algebraic equations that are quartics both in t and in t : n= m= n= m= p nm t n t m = q nm t n t m = (a) (b) where the explicit expressions of the constant coefficients p nm and q nm, for n,m =,...,, as functions of the constant coefficients reported in the appendices A and B, can be easily determined with the help of an algebraic manipulator. Such expressions are not reported here since they are cumbersome. Equations () constitute a non-linear system of two equations in two unknowns: t, and t. System () can be rewritten as follows: L j t j = j= N j t j = j= (6a) (6b)

Table 1: Planar Structure: solutions of the numerical example t 1 t t 3 t 1.19767987979398.69663997181966337 -.339916837783769.819791167936768693 -.77771791137177.7683798131768173 -.37839873917697779633.99183691696618398 3.3173179686169 -.7877181368978937768.1886983963113719.38898836861787877.66996736739797 -.6979361366178381996 -.977698797366691.3378899769369631139 1.693638919699633.9163311717338367 1.9138169713986936.8399963117781176317981 6 -.666963673369317.389613369713 -.71967986371381889 1.9988813318169 7 1.6691673389398317919 1.11613881817837737 1.3713769173671377666 1.836673996137 8 13.16818697168863.6888869863811161 -.3789668868976817 1.89893761911638977399 9 8.3877133619861387 -.1167168199166619113 -.78667663877118 1.8997813799839937311 1-6.811667669813716186-3.7769998913.937331176131691638 1.9397197911698389 11.3986876731378188166-1.1831919366317.713836336331369 -.838387913186633 1 -.1677197999378963-1.69889716966891991.7861617113799198 -.16763331616181813191 13.7797118873719799.679183386993888197.81797963816687117 -.1769761816398786937 1 -.381178838396887 -.3379987696888 1.338687678379 -.36966733699393881 1 -.3987361361189161 1.9936787371891716 1.3767669931819 -.31691611996668 16.17677981166.6377368367673811676 -.33797813818891919 -.36377378776671786 17 -.316878683179199 1.36686711761166137 1.678836116331613631639 -.798786938866717677 18.6837319118773 -.667391638797978 -.936397733196173787-1.69878666619338 19-3.391613786167766 -.87983763888737799-3.73119189777738868 -.898773161137867 11.39977789976716-1.7768671191999 -.3168939783931168 -.79778983917918 1 1.878671918388737767 3.83793166661 -.3397163968777631 -.3313189688993 1.913861136673393 3.79917916719389-1.61766661681396 -.3931139677993 3 -.691396718-.3176787 j.979878+.679367 j -.3993891-.3983778 j -.33117-.696 j -.6398+.3368 j -1.631933+.9169686 j -1.31998381+1.36 j.9961693-.6737793 j -.779193+.79788 j -1.13169+.969776 j.63761-.9383 j.9183-.18333 j 6 -.9787199+.33963897 j.861181-.631661 j.93369-.6899111 j.76616313-.6381 j 7 -.9787199-.33963897 j.861181+.631661 j.93369+.6899111 j.76616313+.6381 j 8 -.779193-.79788 j -1.13169-.969776 j.63761+.9383 j.9183+.18333 j 9 -.6398-.3368 j -1.631933-.9169686 j -1.31998381-1.36 j.9961693+.6737793 j 3 -.691396718+.3176787 j.979878-.679367 j -.3993891+.3983778 j -.33117+.696 j where L j = p jm t m ; N j = m= q jm t m ; j =,..., (7) m= The product of both the Eqs. (6) by t,t, and t 3 yields six more equations that, when added to (6), give the following homogeneous system: H e = (8) where e is equal to (t 7,t 6,t,t,t 3,t,t,1) T, whereas H is an 8 8 matrix defined as follows L L 3 L L 1 L N N 3 N N 1 N L L 3 L L 1 L H = N N 3 N N 1 N L L 3 L L 1 L (9) N N 3 N N 1 N L L 3 L L 1 L N N 3 N N 1 N The homogeneous system (8) admits non-trivial solutions for e, if and only if the following equation is satisfied: det(h) = (3) Since the non-null entries of matrix H are univariate quartics in t, and det(h) is a sum of terms that are products of eight entries of matrix H (see Appendix C), Eq. (3) is a univariate polynomial equation in t which has at most degree 3. This result meets the upper bound to the number of complex solutions of system (18) that the authors found by calculating the optimal multi-homogeneous Bézout number (see Malajovich et al. (); Wampler (199) for details) of system (18). Once the values of t that solve Eq. (3) have been computed, by back substituting them into matrix H, and, then, solving the resulting systems (8), the corresponding values of t can be computed. Eventually, the computed values of the couple {t,t } must be back substituted into (1) and (3) to compute the corresponding values of t 1 and t 3. The adopted elimination procedure could have introduced extraneous solutions of type ±j with j = 1 since the only factors, that could generate extraneous roots and have been multiplied by the original system of equations, are the factors (1 + t i )(1 + t k ), with i = 1,..., and k = (i + 1) modulo. Such factors have been used to obtain system (18) from the original ones (i.e., either (6) or (1)) passing through the trigonometric identities (17). So far, the evaluation of the actual degree of (3) can be done either through extended numerical tests, provided that they identify at least one set of data which makes (3) a 3-degree polynomial equation, or by analytically determining the coefficients of the polynomial equation (3). Extended numerical tests, carried out by the authors, with randomly generated data brought to find many data sets, both for the planar geometry and for the spherical geometry, which make (3) a 3-degree polynomial equation. Moreover, the same numerical tests demonstrated that the elimination procedure used to obtain (3) introduces one couple of extraneous roots of type ±j 6

Solution 1. Solution. Solution 3. Solution. 1 Solution. - - 1 - - 1 - - 1 - - 1 - - 1 Solution 6. 1 Solution 7. 1 Solution 8. 1 Solution 9. 1 Solution 1. - - 1 - - 1 - - 1 - - 1 - - 1 Solution 11. Solution 1. Solution 13. Solution 1. Solution 1. - - 1 - - 1 - - 1 - - 1 - - Solution 16. Solution 17. 6 Solution 18. 1 Solution 19. 1 Solution. - - 1 - - - 1 - - 1 - - 1 1 Solution 1. 1 Solution. - - 1 - - 1 Figure 6: Assembly modes corresponding at the real solutions of the planar structure example,, numbered as in Table 1. in the planar case, whereas does not introduce extraneous roots in the spherical case. These results bring to the conclusion that, in general, Eq. (3) is a 3-degree polynomial equation both for the planar geometry and for the spherical geometry, but, in the planar case, one common factor of type (1 + t ) can always be collected and simplified. Thus, in general, the complex solutions of our problems are 3 for the planar case and 3 for the spherical case. Among the complex solutions of (18), only the real solutions correspond to actual assembly modes of the structure under study. The above-mentioned numerical tests brought to identify a PS geometry with assembly modes and an SS geometry with assembly modes. The maximum number of real solutions of Eq. (3) still is an open problem. Regarding the analytic determination of the coefficients of the polynomial equation (3), it can be implemented with the help of an algebraic manipulator by, first, determining the explicit expression of det(h) as a function of the non-null entries of matrix H (see Appendix C), and, then, elaborating the obtained expression, either as a whole or by grouping terms according to the size of the computer memory. Numerical examples Two numerical examples, one for the planar case and the other for the spherical case, are reported in this section in order to show the effectiveness of the proposed algorithm. The algorithm has been implemented in Maple. The numerical computations have been executed by setting the machine precision equal to 3 decimal digits in Maple. All the computed solutions, when substituted into the closure equations, satisfy those equations with residuals whose absolute values range from less than 1 to 1 16 which is coherent with the chosen machine precision..1 Planar structure With reference to Fig. 3, the geometric data of the planar structure are (the angles are measured in radians; the lengths are mea- 7

Table : Spherical Structure: solutions of the numerical example t 1 t t 3 t 1.7116183668668-1.79773611689161 -.83991188938363.888873996799861 -.779318189689 -.7373373819666 -.79913868173111878.18166998183938711 3.731891131767381777883.361131338191669 -.376731681761.1911339398 -.797769869699138.7937698711311339119.3639717996737376.16837318737919 -.636398678633186 -.66163987871398681-1.97881886338967.71917887868989 6 1.737136933718 -.99118867918191-1.3716669897979698.6877911199789681176 7.176961798976839.99991861169168833979 1.719133989831689.9993931389936177 8.9978737731691 1.181816787191718 1.683871989711817397 1.181816787191718 9 -.379677673696989976.19663388787671167889 3.9878199361783889.38888687799 1 -.31631773889 -.891677878669638 -.96368383889 3.639191719783761991 11-1.69781763918 -.69319366891161 9.793331811818179.36779688996769639 1-1.38917373198878667337-1.8896986388611 -.861988337966189.617899771811169339 13.781981368138799-1.38678711998177 -.61166178886669973 -.888319783879797 1-1.186739696661-1.17783916733697166-3.69698887886983 -.1181138167816 1-1.6163716973896913.678383869698766877.9769331131168 -.3699196991981363868 16.336997183138378318.17988989166693.1816316913163 -.39963177781619 17 -.68878199967386181-9.9718137778981691 -.791666817676169181 -.6186963811117731133 18.67177668863.7381118133678919 -.38187697876783199899 -.1676676136977 19.983913717963888-1.69937739139773913 -.33333896873967389 -.993333867169871769.9116886761368897 -.86888978966186863 -.333891369863861 -.31799366968869381761 1.319-1.8836916 j -.79971 -.3679833 j -.67968 -.6171 j -.77679733 -.18366681 j.319 +1.8836916 j -.79971 +.3679833 j -.67968 +.6171 j -.77679733 +.18366681 j 3.7997783 -.119197 j -3.111186-3.6339179861 j -1.81717839-1.933 j -.7861-1.131911 j.7997783 +.119197 j -3.111186 +3.6339179861 j -1.81717839 +1.933 j -.7861 +1.131911 j -.33817863-1.176116 j.963693-1.1798711 j.718663 -.73688998 j -.1193868 -.96973 j 6 -.33817863 +1.176116 j.963693 +1.1798711 j.718663 +.73688998 j -.1193868 +.96973 j 7 -.3736 -.668138 j.11 -.6663116661 j.383369 -.67863 j -.39887 -.68993866 j 8 -.3736 +.668138 j.11 +.6663116661 j.383369 +.67863 j -.39887 +.68993866 j 9.911189-1.1691 j.18931 -.976737 j.11798611 -.991796677 j.776118-1.136138 j 3.911189 +1.1691 j.18931 +.976737 j.11798611 +.991796677 j.776118 +1.136138 j 31 -.1333793183 -.3998131779 j.738193-1.7917917 j.33983689 -.86163896 j.13866678 -.8119193 j 3 -.1333793183 +.3998131779 j.738193 +1.7917917 j.33983689 +.86163896 j.13866678 +.8119193 j sured in a generic unit of length): γ 1 = π/3 γ = 1π/1 γ 3 = π/3 γ = 11π/1 β 1 = π/3 β = π/ β 3 = π/18 β = π/ r 11 = 1. r 1 =.3 r 13 = 1 r 1 = r 1 = r = 1 r 3 = r = r 1 =.968 r = r 3 = r =.369 r 3 = 7.893 r 36 =.8 r 37 = 3.87 r 38 =.817 Among these geometric data, the parameters γ, r 1 and r have been computed by using relationships (1) together with the values of the other geometric data of the quaternary link. Moreover, once the geometry of the quaternary and the ternary links were defined, the lengths of the binary links (i.e., r 3,r 36,r 37, and r 38 ) have been computed through Eqs. () after the following values of the angles θ i, i = 1,...,, were assigned: θ 1 = 7π/8 θ = 17π/36 θ 3 = 19π/36 θ = π/9, which correspond to (t i = tan(θ i /)) t 1 = 1.693 t =.91633117 t 3 = 1.91381 t =.839996311 This reference assembly mode appears in table 1 as solution number. All the computed solutions of system (18) for this planar geometry are reported in table 1. Among the 3 solutions reported in table 1, the first solutions are real. Therefore the studied planar geometry admits assembly modes that are schemed in Fig.6.. Spherical structure With reference to Fig., the geometric data of the spherical structure are (the angles are measured in radians): γ 1 = π/6 γ = π/3 γ 3 = 1.6 γ = π/3 β 1 = π/ β = π/ β 3 = π/6 β = π/ ρ 11 = π/ ρ 1 = π/7 ρ 13 = π/ ρ 1 = π/6 ρ 1 = π/ ρ = π/7 ρ 3 = π/ ρ = π/6 ρ 1 =.18 ρ =.168 ρ 3 = π/7 ρ = π/8 ρ 3 =.799 ρ 36 =.3 ρ 37 =.73 ρ 38 =.8997 Among these geometric data, the angles ρ 1, ρ and γ 3 have been computed by using a tern of independent scalar equations, deduced from the matrix Eq. (8), together with the values of the other geometric data of the quaternary link. Moreover, once the geometry of the quaternary and the ternary links were defined, the central angles of the binary links (i.e., ρ 3,ρ 36,ρ 37, and ρ 38 ) have been computed through Eqs. (13) after the following values of the angles θ i, i = 1,...,, were assigned: θ 1 = 19π/ θ = 13π/ θ 3 = (11π/1) (81/1) θ = 13π/ which correspond to (t i = tan(θ i /)) t 1 =.99 t = 1.1818167 t 3 = 1.6838719897 t = 1.1818167 This reference assembly mode appears in table as solution number 8. 8

Figure 7: Assembly modes corresponding at the real solutions of the spherical structure example, numbered as in Table. all these manipulators. All the computed solutions of system (18) for this spherical geometry are reported in table. Among the 3 solutions reported in table, the first solutions are real. Therefore the studied spherical geometry admits assembly modes schemed in Fig.7. Through the proposed algorithm, it has been demonstrated that the DPA of the planar manipulators with this topology has thirty complex solutions, whereas the DPA of their spherical counterparts has thirty-two complex solutions. Moreover, extended numerical tests, which used the proposed algorithm, brought to find a planar geometry with assembly modes (i.e.,real solutions of the DPA) and a spherical geometry with assembly modes, and demonstrated the robustness of the algorithm. As far as the authors are aware, these results are new. 6 Conclusions and further research An algorithm that determines all the assembly modes of two structures with the same topology has been presented. The topology of the studied structures is constituted of nine links (one quaternary link, four ternary links and four binary links) connected through twelve revolute pairs to form four closed loops. Such structures can be thought as generated from two large families (one planar and the other spherical) of parallel manipulators by locking the actuated joints. Thus, the proposed algorithm can be used to solve the direct position analysis (DPA) of This work is framed into a research activity oriented to provide algorithms that solve the DPA of all the planar and spherical parallel manipulators which become four-loop Assur kinematic chains when their actuators are locked. In the future, the studied architectures will be used to synthesize devices for industrial and/or biomedical applications. 9

Acknowledgment This work has been partially supported by the Spanish Ministry of Education and Science, under the I+D project DPI7-688, by the I3P program with a short stay grant, and by funds of the Italian MIUR. References C. Innocenti, Polynomial solution to the position analysis of the 7-link Assur kinematic chain with one quaternary link, Mechanism and Machine Theory, Vol. 3, pp. 19-133, 199. G. Malajovich, and K. Meer, Computing multihomogeneous Bézout numbers is hard, Preprint, http://www.arxiv.org/abs/cs/1,. N.I. Manolescu, A method based on Baranov trusses, and using graph theory to find the set of planar jointed kinematic chains and mechanisms, Mechanism and Machine Theory, Vol. 8, pp. 3-, 1973. H. Shen, K.-L. Ting, T.-L. Yang, Configuration analysis of complex multiloop linkages and manipulators, Mechanism and Machine Theory, Vol. 3, pp. 33-36,. C.W. Wampler, Bézout number calculations for multihomogeneous Polynomial Systems, Applied mathematics and computation, Vol. 1, pp.13-17, 199. C.W. Wampler, Displacement analysis of spherical mechanisms having three or fewer loops, Journal of Mechanical Design, Vol. 16, pp. 93-1,. Appendix A With reference to (18) and (7), the constant coefficients d inm, n,m =,1,, have the following explicit expressions for the planar structure (Fig. ): d i = g i + g i + g i3 + g i ; d i1 = (g i1 + g i ); d i1 = g i ; d i11 = g i ; d i = g i g i + g i3 g i ; d i = g i + g i g i3 g i ; d i1 = (g i1 g i ); d i1 = g i ; d i = g i g i g i3 + g i. Appendix B With reference to (18) and (16), the constant coefficients d inm, n,m =,1,, have the following explicit expressions for the spherical structure (Fig. ): d i = h i + h i + h i3 + h i6 ; d i1 = (h i1 + h i ); d i1 = h i ; d i11 = h i7 ; d i = h i h i + h i3 h i6 ; d i = h i + h i h i3 h i6 ; d i1 = (h i1 h i ); d i1 = h i ; d i = h i h i h i3 + h i6. Appendix C The explicit expression of det(h) as a function of the non-null entries of matrix H (see definition (9)) is: det(h) = L N L 3 L 3 NN 3 1 + L L 3 NN 1 L 1 L 3 N N1 3 + L L 3 N1 + L 3L NN 3 L L 3 NN 3 L L 3 L NN 1 N + 3L 1 L 3 NN 1 N + L 1 L 3 L N N1N L L 3 N N1N L L 3 L N1N 3 + L L NN L 1 L 3 L NN + L L 3 NN L 1 L L N N 1 N + 3L L 3 L N N 1 N + L L L N1N + L 1L N N 3 L L L N N 3 L L 1 L N 1 N 3 + L L N L 3 3L NN 3 3 + 3L L 3 L NN 3 3 3L 1 L 3 NN 3 3 + L L 3L NN 1 N 3 L L NN 1 N 3 L 1 L 3 L NN 1 N 3 + L L 3 NN 1 N 3 L 1 L 3L N N1N 3 + L 1 L L N N1N 3 + L L 3 L N N1N 3 + L L 3L N1N 3 3 L L L N1N 3 3 L L 3 L NN N 3 + L 1 L 3L NN N 3 +L 1 L L NN N 3 L L 3 L NN N 3 + L 1 L L 3 L N N 1 N N 3 3L L 3L N N 1 N N 3 3L 1L N N 1 N N 3 + L L L N N 1 N N 3 L L L 3 L N1N N 3 + 3L L 1 L N1N N 3 L 1L 3 L N NN 3 +L L L 3 L N NN 3 +L L 1 L N NN 3 + L L 1 L 3 L N 1 NN 3 L L N 1 NN 3 L L 3 L NN 3 3 + L 3 L NN 3 3L 1 L L 3 L NN 3 + 3L L 3L NN 3 + 3L 1L NN 3 3L L L NN 3 L 1 L L N N 1 N3 + L 1L 3 L N N 1 N3 + L L L 3 L N N 1 N3 L L 1 L N N 1 N3 + L L L N1N 3 L L 1 L 3 L N1N 3 + L L N1N 3 + L 1L L N N N3 L L L N N N3 L L 1 L 3 L N N N3 +L L N N N3 L L 1 L L N 1 N N3 + 3L L 3 L N 1 N N3 + L L L NN 3 L 3 1L N N3 3 + 3L L 1 L L N N3 3 3L L 3 L N N3 3 + L L 1L N 1 N3 3 L L L N 1 N3 3 L L 1 L N N3 3 + L 3 L N3 + L 3NN 3 L L 3L NN 3 + L L NN 3 + L 1 L 3 L NN 3 L L 3 NN 3 L L 3 3NN 1 N + 3L L 3 L NN 1 N + L 1 L 3L NN 1 N L 1 L L NN 1 N L L 3 L NN 1 N + L 1 L 3 3N N1N 3L 1 L L 3 L N N1N L L 3L N N1N + 3L 1L N N1N + L L L N N1N L L 3 3N1N 3 + 3L L L 3 L N1N 3 3L L 1 L N1N 3 + L L 3NN N L 1 L 3 3NN N L 3 L NN N + L 1 L L 3 L NN N + L L 3L NN N 3L 1L NN N + L L L NN N L 1 L L 3N N 1 N N + 3L L 3 3N N 1 N N + L 1 L L N N 1 N N + L 1L 3 L N N 1 N N 8L L L 3 L N N 1 N N + L L 1 L N N 1 N N + L L L 3N1N N L L L N1N N L L 1 L 3 L N1N N + L L N1N N + L 1L 3N NN L L L 3N NN L 1L L N NN + L L L N NN L L N NN L L 1 L 3N 1 NN +L L 1 L L N 1 NN +L L 3 L N 1 NN + L L 3NN 3 L L L NN 3 L 3 L 3 NN 3 N + 3L 1 L L 3NN 3 N 3L L 3 3NN 3 N + L 1 L L NN 3 N L 1L 3 L NN 3 N + L L L 3 L NN 3 N + L L 1 L NN 3 N + L 1 L L 3 N N 1 N 3 N L 1L 3N N 1 N 3 N L L L 3N N 1 N 3 N L 1L L N N 1 N 3 N + 1L L 1 L 3 L N N 1 N 3 N 8L L N N 1 N 3 N L L L 3 N1N 3 N +L L 1 L 3N1N 3 N + L L 1 L L N1N 3 N L L 3 L N1N 3 N L 1L L 3 N N N 3 N + L L L 3 N N N 3 N + L L 1 L 3N N N 3 N + 3L 3 1L N N N 3 N 8L L 1 L L N N N 3 N + L L 3 L N N N 3 N + L L 1 L L 3 N 1 N N 3 N 3L L 3N 1 N N 3 N 1

3L L 1L N 1 N N 3 N + L L L N 1 N N 3 N L L L 3 N N 3 N + 3L L 1 L N N 3 N + L 3 1L 3 N N 3N 3L L 1 L L 3 N N 3N +3L L 3N N 3N L L 1L N N 3N + L L L N N 3N L L 1L 3 N 1 N 3N +L L L 3 N 1 N 3N + L L 1 L N 1 N 3N + L L 1 L 3 N N 3N L 3 L N N 3N L 3 L 3 N 3 3N + L N N L 1 L L 3 N N + L 1L 3N N + L L L 3N N + L 1L L N N L L L N N 8L L 1 L 3 L N N + 6L L N N L 1 L 3 N N 1 N + 3L 1L L 3 N N 1 N +L L L 3 N N 1 N L L 1 L 3N N 1 N 3L 3 1L N N 1 N +L L 1 L L N N 1 N +L L 3 L N N 1 N + L L 3 N 1N 3L L 1 L L 3 N 1N + 3L L 3N 1N + 3L L 1L N 1N 3L L L N 1N + L 1L N N N L L 3 N N N L 3 1L 3 N N N + L L 1 L L 3 N N N 3L L 3N N N + L L 1L N N N + L L L N N N L L 1 L N 1 N N + L L 1L 3 N 1 N N + L L L 3 N 1 N N L L 1 L N 1 N N + L L N N L L 1 L 3 N N + L 3 L N N L 3 1L N N 3 N + 3L L 1 L N N 3 N + L L 1L 3 N N 3 N L L L 3 N N 3 N L L 1 L N N 3 N + L L 1L N 1 N 3 N L L N 1 N 3 N L L 1 L 3 N 1 N 3 N + L 3 L N 1 N 3 N L L 1 L N N 3 N + 3L 3 L 3 N N 3 N + L 3 L N 3N + L 1N N 3 L L 1L N N 3 + L L N N 3 + L L 1 L 3 N N 3 L 3 L N N 3 L L 3 1N 1 N 3 + 3L L 1 L N 1 N 3 3L 3 L 3 N 1 N 3 +L L 1N N 3 L 3 L N N 3 L 3 L 1 N 3 N 3 + L N 11