Levelsets in Workspace Analysis
This presentation is the property of its rightful owner.
Sponsored Links
1 / 31

Levelsets in Workspace Analysis PowerPoint PPT Presentation

  • Uploaded on
  • Presentation posted in: General

Levelsets in Workspace Analysis. Levelsets in Workspace Analysis. F(X,Y,Z) = S1(Z) . S2(X,Y,Z) = 0. S2: algebraic surface of degree 12. Posture change without passing through a singularity. Singularities of parallel manipulators. rational parametrization. M. Noether.

Download Presentation

Levelsets in Workspace Analysis

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript

Levelsets in workspace analysis

Levelsets in Workspace Analysis

Levelsets in workspace analysis

Levelsets in Workspace Analysis

F(X,Y,Z) = S1(Z) . S2(X,Y,Z) = 0

S2: algebraic surface of degree 12

Posture change without passing through a singularity

Posture change without passing through a singularity

Singularities of parallel manipulators

Singularities of parallel manipulators

Rational parametrization

rational parametrization

M. Noether

Architecture singularity selfmotion

Architecture SingularitySelfmotion

Definition: a parallel manipulator is called architecture singular if it is singular in every position and orientation.

Det(J)≡ 0

H. and Karger, A., 2001

Karger, A., 1998

Architecture singularity selfmotion1

Architecture SingularitySelfmotion

Parallel Manipulator performs a self motion when it moves with locked actuators

System of equations describing the kinematical constraints has to be redundantaffine variety is no longer zero dimensional

Planar case: only one possibility parallel bar mechanism

Architecture singularity selfmotion2

Architecture SingularitySelfmotion

H. , Zsombor-Murray, P., 1994, ''A Special Type of Singular Stewart

Gough Platform''

Blaschke‘s movable octahedron

Topic is closely related to an old theorem of Cauchy (1813):

„Every convex polyhedron is rigid“

Architecture singularity selfmotion3

Architecture SingularitySelfmotion

  • Self motions of 3-3-platforms are well known since more than 100 years (Bricard 1897)

  • Self motions of platform mani-pulators are closely related to motions with spherical paths

  • Motions with spherical paths were the topic of the 1904 Prix Vaillant of the French Academy of Science

  • E. Borel and R. Bricard won the prestigeous competition and gave many examples

  • All architecture singular manipulators have self motion

  • Still many open questions

Architecture singularity selfmotion4

Architecture SingularitySelfmotion

  • Bricard‘s octahedron

  • Griffis-Duffy platform

    Griffis, M., Duffy, J., 1993, "Method and Apparatus for Controlling Geometrically Simple Parallel Mechanisms with Distinctive Connections", US Patent # 5,179, 525, 1993.

Gd platforms


6 as mechanisms


Inverse kinematics of concatenations of AS-joints

4 AS-mechanism: dimension of the problem 48

6 AS-mechanism: dimension of the problem ?????

Levelsets in workspace analysis

Analysis and Synthesis of Serial Chains

Inverse Kinematics of general 6R-chains

Synthesis of Bennett mechanism

Lee and Liang (1988)

Raghavan and Roth(1990)

Wampler ,………….

Veldkamp, Roth, Tsai,

McCarthy, Perez,…..

Levelsets in workspace analysis

Discussion of the Inverse Kinematics of General 6R-Manipulators

Constraint manifolds of 3r chains

Constraint manifolds of 3R-chains

Constraint manifolds of 3r chains1

Constraint manifolds of 3R-chains

Constraint manifolds of 3r chains2

Constraint manifolds of 3R-chains

Constraint manifolds of 3r chains3

Constraint manifolds of 3R-chains

Constraint manifolds of 3r chains4

Constraint manifolds of 3R-chains

H. et. al. (2007), Pfurner (2006)

Example puma

Example Puma

Example puma1

Example Puma

Example puma2

Example Puma

Exceptional 6r chains overconstrained chains

Exceptional 6R-chains (overconstrained chains)

Exceptional 6r chains overconstrained chains1

Exceptional 6R-chains (overconstrained chains)

Exceptional 6r chains overconstrained chains2

Exceptional 6R-chains (overconstrained chains)

Synthesis of bennett mechanims

Synthesis of Bennett mechanims

Previous work:

Veldkamp (1967) instantaneous case: 10 quadratic equations elimination yields univariate cubic polynomial with one real solution

Suh and Radcliffe (1978) same result for finite case

Tsai and Roth (1973) cubic polynomial

McCarthy and Perez (2000) finite displacement screws

Synthesis of bennett mechanims1

Synthesis of Bennett mechanims

Linear 3-space

  • intersection of two three-spaces L13, L23 in a seven dimensional space P7 can be:

  • dim(L13Å L23)= -1, ) intersection is empty,

  • dim(L13Å L23)= 0, ) intersection is one point,

  • dim(L13Å L23)= 1, ) intersection is a line,

  • dim(L13Å L23)= 2, ) intersection is a two-plane

  • dim(L13Å L23)= 3 ) L13 and L23 coincide.

Synthesis of bennett mechanims2

Synthesis of Bennett mechanims

3 Conclusions:

  • The kinematic image of the Bennett motion is the intersection of a two-plane with the Study-quadric S62.

  • Bennett motions are represented by planar sections of the Study-quadric and vice versa.

  • Bennett linkages are the only movable 4R-chains.

Synthesis algorithm

Synthesis Algorithm

  • Given three poses of a frame 1, 2, 3 compute the Study parameters ! A,B,C (three points on S62)

  • Compute the conic f(s) passing through A,B,C

  • Apply inverse kinematic mapping (-1): Substitute the parametric representation of f into transformation matrix ! parametric representation M(s) of Bennett motion.

  • Compute the axes of the motion

    • Following Bottema-Roth (1990)

    • Computing planar paths

    • Using the fact that the points of four planes have rational represenations with elevated degree

Synthesis algorithm example

Synthesis Algorithm (example)

Computing the torsionfree paths to obtain the

axes leads to four cubic surfaces having six

lines in common.



  • Mechanisms can be represented with sets of algebraic equations.

  • Constraints map to algebraic varieties in the image space.

  • Geometric preprocessing and symbolic computation allow to solve kinematic problems

  • The algebraic constraint equations are highly sparse.

  • Login