Computational Algorithm for Determining the Generic Mobility of Floating Planar and

1 / 27

# Computational Algorithm for Determining the Generic Mobility of Floating Planar and - PowerPoint PPT Presentation

Computational Algorithm for Determining the Generic Mobility of Floating Planar and Spherical Linkages. Offer Shai Mechanical Engineering School, Tel-Aviv University Tel-Aviv, Israel. Andreas Müller Institute of Mechatronics, Chemnitz, Germany, andreas.mueller@ifm.chemnitz.de.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Computational Algorithm for Determining the Generic Mobility of Floating Planar and' - ozzy

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

Computational Algorithm for Determining the Generic Mobility of Floating Planar and

Offer Shai

Mechanical Engineering School,

Tel-Aviv University

Tel-Aviv, Israel

Andreas Müller

Institute of Mechatronics, Chemnitz, Germany, andreas.mueller@ifm.chemnitz.de

Outline of the talk
• Constraint Graphs: Bar-joint, Body-bar and Mixed graphs.
• The main idea underlying pebble game.
• Pebble game decomposes any mechanisms into Assur graphs.
• Choosing different drivers/input when using pebble game results in different decompositions.
• Pebble game reveals redundancy
• Pebble game identifies BJ-BB Assur Graphs.
• How Pebble game works.

Body-Bar Constraint Graph

G=(V,E) is a body-bar graph iff:

• A vertex stands for a rigid body. Thus, a vertex possesses
• three DOFs (in 2D) or six DOFs in (3D).

- Edges stand for kinematic pairs (higher or lower pairs).

- An edge is between exactly two bodies.

- Between two vertices there can be several edges.

Body-bar constraint graph

Bar- Joint Constraint Graph

G=(V,E) is a bar-joint graph iff:

- A vertex represents a point where binary links interconnect

through only lower kinematic pairs (two constraints).

• Since the vertex stands for a point it possesses two DOFs
• (in 2D) or three DOFs (in 3D)

- Between two vertices there can be at most one edge.

Bar-Joint constraint graph

(b)

(a)

The main problem: in mechanisms several

rigid bodies can be connected through

one joint (called “multiple joint”).

For mechanisms with multiple joints there is no

unique body-bar graph causing difficulties.

The problem of Multiple Joints and Body-Bar Graphs

A

C

2

4

B

5

1

3

B2

B2

Different Body-Bar Graphs for the same mechanism

B4

B4

B3

B5

B1

B3

B5

B1

0

0

Kinematic pairs: (B2,B4), (B3,B4)

Kinematic pairs: (B2,B3), (B3,B4)

Different structural representations

2

3

4

4

2

5

3

1

5

0

1

0

5

5

8

7

8

7

4

6

4

6

2

2

1

1

3

3

(B1,B2), (B1,B7), (B1, B4)

(B1,B2), (B2,B7), (B7, B4)

5

6

8

5

7

4

6

5

4

7

8

8

7

1

6

2

4

3

2

3

1

2

1

Mechanism – 1 DOf

3

Structure – 0 DOF

Different Body-Bar graphs might result with even wrong conclusions

Mixed Constraint Graph (new)

G=(VB  VJ, E) is a mixed graph iff:

- Every vertex can stand for a body or a point.

• If the vertex corresponds to a body, v  VB, it possesses three
• DOFs (in 2D) or six DOFs (in 3D).

- If the vertex corresponds to a point (i.e. the location of a joint as

in the bar-joint), v  VJ, it possesses two DOFs (in 2D) or three

DOFs (in 3D).

(a)

C

7

D

9

6

8

10

4

A

2

5

B

1

3

(b)

7

9

10

D

C

8

6

4

A

2

5

B

1

3

Easy to represent multiple revolute joint (in 2d):

A multiple joint connecting m bodies stands for m-1 revolute joints

with collinear axis.

Pebble Game – Combinatorial Algorithm for Generic (topological) Mobility Determination

The algorithm determines the correct generic, i.e., topological, mobility of the mechanisms.

It is applied upon the constraint graph of the mechanism.

The constraint graphs possess only topological properties thus redundancies due to special geometries are excluded.

The main idea underlying Pebble Game

Pebbles are assigned to each vertex, equal to the DOF of the physical object represented by that vertex when considered unconstraint.

Activating the constraints, represented by edges, by coordinated relocation of pebbles.

5

5

5

5

B

B

B

B

C

C

C

C

Choosing different inputs/drivers

when applying Pebble game

2

2

2

2

3

3

3

3

6

6

6

6

4

4

4

4

A

A

A

A

D

D

D

D

1

1

1

1

B

B

7

7

7

7

Next to each input/driver we locate a free pebble.

2

2

A

A

3

3

C

C

Theorem: After locating the free pebbles next to the drivers

there is a unique decomposition into Assur Graphs, and

pebble game finds this decomposition.

4

4

1

1

For different inputs/drivers there exist different decompositions

into Assur Graphs.

C

C

B

B

C

C

A

A

D

D

B

A

A

B

C

B

B

C

A

A

D

D

B

2

A

3

C

1

4

8. Order of the Assur Decomposition – the order

of the directed cutsets.

4. The DOF of the mechanism – total number of free pebbles.

5. The DOF of an object – maximum free pebbles can

be move to the corresponding vertex.

6. Input links/drivers - free pebbles are located at

the corresponding vertices.

2. Initialization – two pebbles to each vertex.

1. Bar-joint Constraint Graph

3. Output of the Pebble Game Alg. – all the admissible

edges are directed and free pebbles.

7. Assur decomposition – each directed cutset

defines an Assur Graph

C

C

C

B

B

B

B

A

A

A

causes pebble game to decompose mechanisms into different Assur Graphs.

This theorem was proved to be valid also in 3d.

B

C

5

2

3

6

4

D

A

7

1

B

C

2. Initialization – two pebbles to each vertex.

1. Bar-joint Constraint Graph

4. The DOF of the mechanism – total number of free pebbles.

6. Input links/drivers - free pebbles are located at

the corresponding vertices.

5. The DOF of an object – maximum free pebbles can

be move to the corresponding vertex.

3. Output of the Pebble Game Alg. – all the admissible

edges are directed and free pebbles.

7. Assur decomposition – each directed cutset

defines an Assur Graph

8. Order of the Assur Decomposition – the order

of the directed cutsets.

A

B

B

C

C

B

C

A

A

A

D

D

B

C

D

A

D

D

Pebble Game Reveals Redundancy

An edge is admissible (not redundant) IFF we can bring 4 free

pebbles next to its two end vertices.

Edge e=(x,y) can be oriented if p(x) + p(y) >= 4

Where p(z) is the number of free pebbles next to vertex z.

Pebble game reveals redundancy in mechanisms.

An edge/constraint is redundant IFF it is impossible to bring

four free pebbles next to its end vertices.

This property assures that pebble game determines the correct

generic/topological mobility of the mechanism.

F

A

A

F

B

E

B

E

D

C

D

C

C

C

F

A

F

F

A

F

A

A

B

D

E

B

B

C

D

E

C

B

D

E

D

E

No free pebble was found – region {B,E,C,D} is over constrained.

Edge (E,C) is inadmissible since there are only 3 free

pebbles next to its end vertices.

Every vertex that is visited during the search belongs

to the over constrained region.

Initialization – two pebbles to each vertex.

One pebble is missing to vertex E.

Bar-joint Constraint Graph

The algorithm searches for a free pebble.

Output of the Pebble Game Alg. – all the admissible

edges are directed and free pebbles.

Pebble game Identifies Assur Graphs

Main theorem: G is an Assur Graph IFF after applying pebble game the constraint graph is strongly connected (there exists a directed path from each vertex to any other vertex) IFF there is no directed cut-set (set of edges that disconnetcs the graph).

This theorem is valid for Bar-joint and Body-bar (Baranov Trusses) Assur Graphs and proved to be correct both in 2D and 3D.

Which one is an Assur Graph?

The output of the pebble game

B

B

A

A

B

B

D

D

A

A

J

J

H

H

C

C

G

G

F

F

I

E

E

I

C

C

J

J

D

D

E

E

I

I

F

F

G

G

H

H

(B)

(B)

(A)

(A)

The directed constraint graph is an Assur Graph it is strongly connected

there is no directed cut-set.

Body – bar Assur Graph (Baranov Truss)

After applying pebble game on the BB constraint

graph we move 3 free pebbles to any vertex

(grounding it).

The remaining graph should be strongly connected

(does not contain a directed cut-set).

2

A structural representation of

a Body-bar Assur Graph

7

3

5

8

9

1

6

4

Constraint graph is a Body-bar Assur Graph after grounding any vertex

(moving 3 free pebbles next to it) the remaing graph is strongly connected.

Initialization – 3 pebbles to each vertex.

Grounding body 2 instead of body 1.

Different bodies can be grounded by moving the 3 free pebbles.

Output of the pebble, body 1 is grounded.

1

1

1

1

3

3

3

3

6

4

5

6

4

6

6

5

5

4

5

4

2

2

2

2

Constraint graph

Synthesis

Understanding properties of the Body-Bar Assur Graphs enables to create them in 2D and 3D.

planar Assur groups, Journal of Machinery Manufacture and Reliability,

2007 , vol. 36, No. 6, 505-514

The Pebble Game Algorithm:

• Edgeis admissible if the total of free pebbles next to its end vertices is at least four.
• Initialization –
• The graph is undirected, i.e., initially all constraints are inactive and all
• objects/vertices are unconstrained.
• Assign k(v) pebbles to each vertex v, k=2 for joints and k=3 for bodies.
• While there exist admissible edges DO:
• Orientation move – if edge (u,v) admissible then remove a pebble from one of
• the end vertices, let it be u, the edge is directed <u,v> and u the tail vertex.

u

u

v

v

u

v

u

v

3. While there are free pebbles left Do:

Reorientation move – let (u,v) an undirected edge and make it admissible by bringing free pebbles to its end vertices.

If peb(v)<2 (v stands for a joint) or peb(v) < 3 (v stands for a body) then

search for a vertex ‘z’, s.t., peb(z)>0 and there is a directed path from v

to z. Then, move one pebble from vertex z to v by reversing the direction of all the edges, and

peb(z) := peb(z)-1, peb(u):=peb(u) + 1.

z

z

peb(v)- number of pebbles at vertex v.