mechanical invention through computation mechanism basics

70
MIT Class 6.S080 (AUS) Mechanical Invention through Computation Mechanism Basics

Upload: vohanh

Post on 10-Feb-2017

233 views

Category:

Documents


4 download

TRANSCRIPT

Page 1: Mechanical Invention through Computation Mechanism Basics

MIT Class 6.S080 (AUS) Mechanical Invention through Computation Mechanism Basics

Page 2: Mechanical Invention through Computation Mechanism Basics

Design Principles Structure and Mechanism

Structure: Force is resisted

Mechanism:

Force flows into movement

Page 3: Mechanical Invention through Computation Mechanism Basics

Design Principles Structure and Mechanism

Structural

Resistance

Kinematic deflection Structural Deflection

(elastic or Inelastic)

Possible Responses to Applied Force

Page 4: Mechanical Invention through Computation Mechanism Basics

Mechanism paradigms

Synthesize a motion path

Synthesize a form change

Page 5: Mechanical Invention through Computation Mechanism Basics

Definitions

• Kinematics: the study of the motion of bodies without reference to mass or force

• Links: considered as rigid bodies • Kinematic pair: a connection between two bodies that imposes

constraints on their relative movement. (also referred to as a mechanical joint)

• Ground: static point of reference • Degree of freedom (DOF): of a mechanical system is the

number of independent parameters that define its configuration.

Page 6: Mechanical Invention through Computation Mechanism Basics

Links types

Page 7: Mechanical Invention through Computation Mechanism Basics

Kinematic pairs

Page 8: Mechanical Invention through Computation Mechanism Basics

Historic Mechanisms

Page 9: Mechanical Invention through Computation Mechanism Basics

Straight- line linkages (James Watt)

Page 10: Mechanical Invention through Computation Mechanism Basics

Straight- line linkages (Richard Roberts)

Page 11: Mechanical Invention through Computation Mechanism Basics

Straight- line linkages (Tchebicheff)

Page 12: Mechanical Invention through Computation Mechanism Basics

Peaucellier Linkage

Page 13: Mechanical Invention through Computation Mechanism Basics

Straight- line linkages (Peaucellier)

Page 14: Mechanical Invention through Computation Mechanism Basics

Straight- line linkages (Kempe)

Page 15: Mechanical Invention through Computation Mechanism Basics

4-bar linkage types

Page 16: Mechanical Invention through Computation Mechanism Basics

Kinematic inversions

Page 17: Mechanical Invention through Computation Mechanism Basics

Four-bar linkage examples

Parallel 4-bar

Anti-parallel 4-bar

Page 18: Mechanical Invention through Computation Mechanism Basics

Gruebler’s equation N = Number of Links (including

ground link) P = Number of Joints (pivot connections between links) • Each link has 3

degrees of freedom • Each pivot subtracts 2

degree of freedom DOF = 3 (N-1) - 2P

dof = 3 X 4 = 12

dof = 3 X (4-1) – (2 X 4) = 1

Page 19: Mechanical Invention through Computation Mechanism Basics

Examples

N = 4 P = 4 DOF = 3X(4-1)-(2X4)=1

N = 3 P = 3 DOF = 3X(3-1)-(2X3)=0

Page 20: Mechanical Invention through Computation Mechanism Basics

Examples

N = 5 P = 5 DOF = 2

Geared connection removes one degree of freedom DOF = 1

Page 21: Mechanical Invention through Computation Mechanism Basics

Examples

N = 6 P = 7 DOF = 3X(6-1)-(2X7)=1

N = 8 P = 10 DOF = 3X(8-1)-(2X10)=1

Page 22: Mechanical Invention through Computation Mechanism Basics

Relation of DOF to special geometries

N = 5 P = 6 DOF = 3X(5-1)-(2X6) = 0

Agrees with Gruebler’s equation (doesn’t move)

Doesn’t agree with Gruebler’s equation (moves)

Page 23: Mechanical Invention through Computation Mechanism Basics

Graph of linkages DOF=3(N-1)-2P

Page 24: Mechanical Invention through Computation Mechanism Basics

Scissor Linkages

Page 25: Mechanical Invention through Computation Mechanism Basics

Scissor mechanisms

Page 26: Mechanical Invention through Computation Mechanism Basics

Historic examples of scissor mechanisms

Emilio Pinero

Page 27: Mechanical Invention through Computation Mechanism Basics

Historic examples of scissor mechanisms

Emilio Pinero

Page 28: Mechanical Invention through Computation Mechanism Basics

Examples of scissor mechanisms

Sergio Pellegrino

Felix Escrig

Page 29: Mechanical Invention through Computation Mechanism Basics

Curvature of scissor mechanisms Off-center connection point => structures of variable curvature

Page 30: Mechanical Invention through Computation Mechanism Basics

Scissor Types

Parallel / symmetric

Angulated

Parallel / asymmetric

No curvature

Constant curvature

Variable curvature

Page 31: Mechanical Invention through Computation Mechanism Basics

Angulated scissors Provides invariant angle during deployment

Page 32: Mechanical Invention through Computation Mechanism Basics

Scissor mechanism: demonstration Parallel / Symmetric

Page 33: Mechanical Invention through Computation Mechanism Basics

Scissor mechanism: demonstration Off-center connection

Page 34: Mechanical Invention through Computation Mechanism Basics

Scissor mechanism: demonstration Angulated

Page 35: Mechanical Invention through Computation Mechanism Basics

Angulated link: geometric construction

Redraw links as 2 triangles

Rotate triangles to angle of curvature

Redraw angulated links

2 straight links

Page 36: Mechanical Invention through Computation Mechanism Basics

Angulated link: geometric construction

Parametric

Page 37: Mechanical Invention through Computation Mechanism Basics

Tong linkage

Hinged rhombs

Tong linkage

Page 38: Mechanical Invention through Computation Mechanism Basics

Hinged rhombs – transforming between configurations

straight

arc

circle

ellipse

Page 39: Mechanical Invention through Computation Mechanism Basics

Arc - geometric construction

Page 40: Mechanical Invention through Computation Mechanism Basics

Circle - geometric construction

Page 41: Mechanical Invention through Computation Mechanism Basics

Ring linkages

Page 42: Mechanical Invention through Computation Mechanism Basics

Ring linkages

Page 43: Mechanical Invention through Computation Mechanism Basics

Ellipse - geometric construction

Page 44: Mechanical Invention through Computation Mechanism Basics

Unequal rhombs

Page 45: Mechanical Invention through Computation Mechanism Basics

Unequal rhombs

Page 46: Mechanical Invention through Computation Mechanism Basics

Constructing expanding polygons

Perpendicular bisectors

Page 47: Mechanical Invention through Computation Mechanism Basics

Irregular polygon – geometric construction

All rhombs are similar (same angles, different

sizes)

Page 48: Mechanical Invention through Computation Mechanism Basics

Degrees of freedom of a tong linkage

Number of pivots for a tong linkage: P = 3N/2 -2 DOF = 3 X (N-1) – 2P = 3N – 3 – (3N – 4) = 1

Number of pivots for a closed tong linkage: P = 3N/2 DOF = 3 X (N-1) – 2P = 3N – 3 – 3N = - 3

Page 49: Mechanical Invention through Computation Mechanism Basics

N = 8 P = 12 DOF = - 3

DOF=3(N-1)-2P

Spatial interpretation of Gruebler’s equation

Page 50: Mechanical Invention through Computation Mechanism Basics

Unequal rhombs with crossing connection

Page 51: Mechanical Invention through Computation Mechanism Basics

Unequal rhombs with crossing connection

Page 52: Mechanical Invention through Computation Mechanism Basics

Polygon linkages with fixed centers

Page 53: Mechanical Invention through Computation Mechanism Basics

circular linkage with fixed center (four spokes)

Page 54: Mechanical Invention through Computation Mechanism Basics

Circular linkages with fixed center

Page 55: Mechanical Invention through Computation Mechanism Basics

Polygon linkages with fixed centers Construction for off-center fixed point

Page 56: Mechanical Invention through Computation Mechanism Basics

Polygon linkages with fixed centers Polygon linkages – off-center fixed point

Page 57: Mechanical Invention through Computation Mechanism Basics

Polygon linkages with fixed centers Polygon linkages – off-center fixed point

expanded

folded

Page 58: Mechanical Invention through Computation Mechanism Basics

Polygon linkages with fixed centers Polygon linkages – off-center fixed point

Page 59: Mechanical Invention through Computation Mechanism Basics

Polygon linkages – off-center fixed point

Page 60: Mechanical Invention through Computation Mechanism Basics

Ring linkages

Page 61: Mechanical Invention through Computation Mechanism Basics

Degrees of freedom (Graver formulation) Each point (pivot) has 2 degrees of freedom Each link subtracts 1 degree of freedom J = Number of joints (2D points in the plane) R = Number of links (not including ground link)

DOF = 2J - R

Page 62: Mechanical Invention through Computation Mechanism Basics

Examples

DOF = 2J - R

J = 2 R = 3 DOF = (2X2)-(3X1)=1

J = 3 R = 5 DOF = (2X3)-(5X1)=1

J = 4 R = 7 DOF = (2X4)-(7X1)=1

J = 1 R = 2 DOF = (2X1)-(1X2)=0

Page 63: Mechanical Invention through Computation Mechanism Basics

Book

• www.gfalop.org • Published

August 2007 • Cambridge

University Press

• Coming soon in Japanese

Page 64: Mechanical Invention through Computation Mechanism Basics

Configuration Space configuration point

Figure 2.1

Presenter
Presentation Notes
GFALOP Figure 2.1
Page 65: Mechanical Invention through Computation Mechanism Basics

Rigidity

flexible

rigid rigid

rigid

Figure 4.1

Presenter
Presentation Notes
GFALOP Figure 4.1 (roughly)
Page 66: Mechanical Invention through Computation Mechanism Basics

Rigidity Depends on Configuration

rigid flexible

Figure 4.2

Presenter
Presentation Notes
GFALOP Figure 4.2
Page 67: Mechanical Invention through Computation Mechanism Basics

Generic Rigidity

generically rigid generically flexible

Figure 4.3

Presenter
Presentation Notes
GFALOP Figure 4.3
Page 68: Mechanical Invention through Computation Mechanism Basics

Generic Rigidity

generically rigid generically flexible

rarely flexible

rarely rigid

Figure 4.4

Presenter
Presentation Notes
GFALOP Figure 4.4
Page 69: Mechanical Invention through Computation Mechanism Basics

Laman’s Theorem [1970]

• Generically rigid in 2D if and only if you can remove some extra bars to produce a minimal graph with 2 𝐽 − 3 bars total, and at most 2 𝑘 − 3 bars between

every subset of 𝑘 joints

Page 70: Mechanical Invention through Computation Mechanism Basics

Laman’s Theorem [1970]

• Generically rigid in 2D if and only if you can remove some extra bars to produce a minimal graph with 2 𝐽 − 3 bars total, and at most 2 𝑘 − 3 bars between

every subset of 𝑘 joints