Machine Kinematics
solved, then drawn
Concept

Inversion — where it appears

Choosing a different link of the same chain to be the frame, which produces a different mechanism from the same set of lengths. A slider-crank inverted gives the quick-return and the Whitworth mechanisms, and every inversion shares the chain's mobility.

Named by 20 essays across 7 fields — each of them below, with the objects they name alongside it.

One, two, sixteen, two hundred and thirty. Every planar chain of mobility one, up to ten links, counted by enumeration rather than quoted. The pins column is forced: a chain of 10 links has one degree of freedom only if it has exactly (3n − 4)/2 pins, which is why no odd link count appears. Pass the count is how many graphs satisfy Grübler's rule, are connected, are simple and give every link at least two pins. Are chains is how many of those survive the fourth condition, that no proper subchain is already a structure — and the gap between the two columns is the whole of this field's first argument: at ten links 1,878 graphs pass a rule that 230 of them deserve. Mechanisms is larger again, because a chain is not a mechanism until a link is held still, and how many different mechanisms that gives is a question about the chain's own symmetry.

The mechanism is the graph

Twenty-one fields of this site have been handed a mechanism and asked what it does. Take the mechanism away and keep only which link is pinned to which, and there is still a finite list of answers: one chain of four links, two of six, sixteen of eight, two hundred and thirty of ten — and 1,878 graphs at ten links that pass every count and are not among them.

topology · Topology Grashof's classification, predicted and then swept. Four sets of link lengths. For each, Grashof's condition predicts from the lengths alone whether the input can rotate a full turn, and the solver then attempts all 180 positions and reports how many assembled. The prediction and the measurement agree in every case, which is what licenses quoting the classification for a mechanism nobody has swept.

Grashof, predicted and then swept

Add the shortest link to the longest. If the total does not exceed the other two, some link can turn a full revolution. It is a sentence about four numbers, it was published in 1883, and it is the kind of claim this site refuses to print without measuring — so every linkage here is also asked for all 360 positions and required to agree.

linkages · Fourbar Same links, same pins, different chains. Watt chain on the left and Stephenson chain on the right. They have the same number of links, the same number of pins and the same assortment — 4×2 + 2×3 — so no count of anything can tell them apart. What differs is where the pins go: on the left the two ternary links share a pin, on the right they do not, and that single fact makes two mechanisms with different coupler curves, different numbers of inversions and different position problems. It is the smallest case in the subject of the thing this field exists to say: the arithmetic is a filter and the graph is the answer.

Same links, same pins, different machines

Watt's six-bar and Stephenson's have six links, seven pins, four binary links and two ternary ones. Every count anybody can make on them agrees. They are different chains, they give two mechanisms and three, and the difference is whether the two ternary links share a pin.

topology · Topology Peaucellier's cell: exact straight-line motion from pin joints. The rhombus and the two long arms hold |OP| · |OQ| constant at 16 = 5² − 3², which is inversion in a circle about O. Inversion carries circles through the centre to straight lines, and the link CQ makes Q run on exactly such a circle — so P travels on a line, with no approximation anywhere. Measured over 160 solved positions the deviation is 6.5e-16 of the span, which is arithmetic noise rather than a small error.

Peaucellier and the exact answer

Eighty years after Watt settled for an approximation, a French army officer found a linkage that draws an exactly straight line from pin joints alone. It works by inversion in a circle, the product it holds constant is measurable, and on this site it comes out straight to 10⁻¹⁶ of its span.

curves · Coupler The Sarrus linkage at 0°. Two three-joint chains in perpendicular planes, joining a fixed plate to a moving one. The left chain's three axes are all parallel, so it allows the plate to move in its plane; the right chain's are parallel to a perpendicular direction and allow the plate to move in that one. What both permit is a straight line, and only a straight line. Six revolute joints in a single loop: Kutzbach says 0 degrees of freedom, the screw system has rank 5 and says 1, and the plate rises. Measured over 24 positions, its tilt never exceeds 2.5e-14 radians and it never leaves the axis by more than 6.8e-14 — exact, from pin joints, with no approximation anywhere in it.

Sarrus, and the straight line that is exact

The planar answer to the straight-line problem took two hundred years and arrived as an inversion cell with eight bars. There is a six-bar answer that is also exact, that was published eleven years before Peaucellier's, and that works for a reason with nothing to do with inversion — it leaves the plane.

spatial · Spatial Different numbers of ternary links, and the same spectrum. Two of the 230 ten-link chains whose adjacency matrices have identical characteristic polynomials — identical in every one of the eleven coefficients — and which are not the same chain. They do not even share their assortment — 6×2 + 2×3 + 2×4 on the left and 4×2 + 6×3 on the right. Counting the ternary links tells them apart and the spectrum does not. That is worth pausing on: the spectrum is the more sophisticated invariant, it is the one that got written into the literature as a test, and here it is beaten by the first thing anybody would try. The polynomial both of them have is λ^10 − 13λ^8 + 52λ^6 − 4λ^5 − 76λ^4 + 8λ^3 + 32λ^2.

Right until the size nobody checked

The characteristic polynomial of a chain's adjacency matrix is a fingerprint that costs nothing and separates every six-link chain and every eight-link one. At ten links it fails on two pairs — and on one of them, counting the ternary links tells the two chains apart while the polynomial does not.

topology · Topology Slider-crank at 50°. Crank 1, connecting rod 3. The slider's travel is 2.0000 — exactly twice the crank throw, which is the one thing about this mechanism that does not depend on the rod length. Everything else does: the rod length decides how far the piston's motion departs from a sine wave, and that departure is the second harmonic every engine balancer has to deal with.

The slider-crank

Replace one pin of a four-bar with a slide and you get the mechanism in every reciprocating engine ever built. Its stroke is exactly twice the crank throw and does not depend on the connecting rod at all. Everything else about the motion depends on the rod, including the part that is always described as a sine wave and is not.

linkages · Fourbar Colour by degree, recolour by neighbours' colours, stop when nothing changes. The cheap half of every isomorphism routine there is, and the half that does most of the work. Start by colouring each link with how many pins it carries. Then repeatedly recolour it with its own colour plus the multiset of its neighbours', until a pass changes nothing. On this chain the process ends with 3 classes of sizes 2, 2, 2, and two links of different colours are certainly different links — no relabelling can carry one to the other. What refinement cannot do is separate links that are alike to every local measurement, and that residue is what the backtracking search is for. It is also, exactly, why a spectral test fails: an eigenvalue is a global average over walks and has no more to say about two locally identical links than the refinement does.

Deciding that two chains are one

Two chains are the same chain when a relabelling of the links carries one to the other. Ten links admit 3,628,800 relabellings, and the census asks the question 26,335 times — so the answer is not a search but a rule that picks one labelling out of the graph itself, and asking whether the two strings match.

topology · Topology One chain, four mechanisms. The same four bars and the same four pins in every panel. What changes is which link is bolted to the bench, and that is not a property of the chain — it is a decision about where the bench is. The four mechanisms are crank rocker, double crank, crank rocker, double rocker: one input turns fully in some and rocks in others, and what each one is for is different. What cannot change is the shape of the closed loop, and the two diagonals measure that without reference to which link is held still: swept independently, all four visit the same locus of diagonal pairs to within 2.9e-3, half the sampling resolution. This is why the Whitworth quick-return and the oscillating-cylinder engine are not merely similar to a slider-crank; they are one.

One chain, four mechanisms

Which link of a four-bar is bolted to the bench is not a property of the chain. It is a decision about where the bench is, and making a different one gives a mechanism that looks and behaves completely differently while being, as a chain, the same object — which is why the Whitworth quick-return and the oscillating-cylinder engine are both a slider-crank.

linkages · Fourbar The five six-bar mechanisms, and there are only two chains. Two chains and five machines. Watt's chain has two orbits of links, so grounding it gives two mechanisms; Stephenson's has three. The frame is drawn dark in each. This is the whole of what "Watt I", "Watt II", "Stephenson I, II and III" name — not five linkages somebody invented, but two graphs and the five genuinely different links there are to bolt down. Anyone who has met the names as a list of five things has met the answer without the question, and the question is a count of orbits.

Which link to bolt down

A chain is not a machine until one of its links is held still, and which one is a decision. Two links give the same machine exactly when a relabelling of the whole chain carries one to the other — so the number of mechanisms a chain gives is a count of orbits, and the classical five six-bars and seventy-one eight-bars are that count.

topology · Topology Four of the sixteen cannot be positioned without a solver. For every chain, every way of choosing a frame and a driven link pinned to it, and for each the decomposition into Assur groups. All dyads counts the choices whose groups are all two links — those are the mechanisms a draughtsman can position with a compass, two circles at a time. The last column is the one that matters: chains for which no choice of frame and input is all dyads, so every way of driving them leaves a group of four or more links that has to be solved as a single system. At eight links there are 4 of them and at ten there are 90. This site has run a Newton solve on every mechanism it has ever drawn, and it has always been possible to read that as convenience. On these it is not.

Eight ways to drive it, and one machine

Bolting a link down is half the decision; the other half is which link carries the input. A four-bar has eight frame-and-input pairs and exactly one of them is a distinct machine — and across the eight-link census 320 listed pairs collapse to 153.

topology · Topology The four eight-link chains a compass cannot position. Every one of the twenty ways of choosing a frame and a driven link, on each of these four chains, leaves a group of four links or more that has to be solved as one system. There is no order in which they come apart two at a time, so there is no ruler-and-compass construction for any of them and no closed form for their positions. They are numbers 1, 3, 4, 10 of the sixteen, and they do not share an assortment: 4×2 + 4×3 and 5×2 + 2×3 + 1×4 both appear. Three of the four are among the most symmetric chains in the census — automorphism groups of 16, 8, 8 against a median of three across the sixteen — which is the direction one would guess, since a symmetric chain has few genuinely different places to attach a driven link. The fourth has an automorphism group of 2, so symmetry is a tendency here and not the reason.

Four that a compass cannot reach

Twelve of the sixteen eight-link chains can be positioned two links at a time, from at least one choice of frame and input. Four cannot be positioned that way from any of their twenty choices — and at ten links ninety of the two hundred and thirty are in the same position.

topology · Topology Two ways to stop an axle moving sideways. A Panhard rod is one link from the body to the axle, so the axle's end follows an arc and the whole car shifts sideways as the suspension moves: 3.56 mm at 80 mm of travel, and always in the same direction, so it happens twice per bounce. A Watt's linkage keeps the same point on a path that is straight to 33.7 µm — 106 times better, and it is drawn on the same axis, which is why it looks like the zero line.

Holding an axle still

A Panhard rod moves the axle 3.56 mm sideways over 80 mm of travel and a Watt's linkage moves it 34 microns — a hundred times better, and by a higher power. The Panhard's error is quadratic in the travel and the Watt's is fifth order, which is a much stronger statement than "the Watt is better" because it says how the comparison changes with the suspension.

applied · Coupler A catalogue is a search space, and a requirement is a filter on it. What a census is for. Four requirements applied in turn to the 230 ten-link chains, each of them a statement about the graph alone: a link carrying four pins, a link none of whose neighbours is binary, and a way of driving it that comes apart into dyads. 26 chains survive all of them. None of this is dimensional synthesis and none of it can be — no requirement here mentions a length, an angle or a position, and every one of them can be checked before a single dimension is chosen. That is the argument for having the census at all: the design problem is a search over shapes within a topology, and knowing which topologies there are turns an open question into 26 closed ones.

Choosing the chain before the lengths

Every synthesis method on this site starts by assuming a topology, and the assumption is usually a habit. What the graph fixes before any dimension is chosen is the number of free parameters — two per pin less four — and therefore how many positions can be prescribed at all.

synthesis · Synthesis 11 assortments are arithmetically possible and 7 contain a mechanism. The 10-link census organised the way every published table organises it: by how many links carry two pins, three, four and more. The assortments themselves are a small piece of arithmetic — the degrees must sum to twice the pin count and none may be below two — and it admits 11 of them. 4 contain no chain at all. Each of those 4 needs a link carrying six, seven or eight pins, and a link with that many pins in a chain this small always drags a structure in with it: the graphs exist, they satisfy Grübler exactly, and every one of them has a rigid subchain. That is a result the arithmetic cannot reach, because the arithmetic never looks at where a pin goes.

Eleven assortments and four that are empty

How many links carry two pins, how many carry three, how many carry four: two lines of arithmetic admit eleven answers at ten links. Seventy-eight graphs have degrees the last four of them describe, every one of those graphs satisfies Grübler's rule exactly, and not one of them is a mechanism.

topology · Topology A catalogue is a search space, and a requirement is a filter on it. What a census is for. Four requirements applied in turn to the 230 ten-link chains, each of them a statement about the graph alone: a link carrying four pins, a link none of whose neighbours is binary, and a way of driving it that comes apart into dyads. 26 chains survive all of them. None of this is dimensional synthesis and none of it can be — no requirement here mentions a length, an angle or a position, and every one of them can be checked before a single dimension is chosen. That is the argument for having the census at all: the design problem is a search over shapes within a topology, and knowing which topologies there are turns an open question into 26 closed ones.

A catalogue is a search space

Dimensional synthesis searches over lengths within a topology, and the topology is chosen first — usually from memory, usually from a list of five. With a census the list is two hundred and thirty, every requirement that reads only the graph is a filter on it, and the choice stops being a habit.

topology · Topology One, two, sixteen, two hundred and thirty. Every planar chain of mobility one, up to ten links, counted by enumeration rather than quoted. The pins column is forced: a chain of 10 links has one degree of freedom only if it has exactly (3n − 4)/2 pins, which is why no odd link count appears. Pass the count is how many graphs satisfy Grübler's rule, are connected, are simple and give every link at least two pins. Are chains is how many of those survive the fourth condition, that no proper subchain is already a structure — and the gap between the two columns is the whole of this field's first argument: at ten links 1,878 graphs pass a rule that 230 of them deserve. Mechanisms is larger again, because a chain is not a mechanism until a link is held still, and how many different mechanisms that gives is a question about the chain's own symmetry.

Six things a chain is not

A count read as a verdict, a rank trusted where it is blind, a fingerprint used as a proof, a list of five taken for a complete one, a solver treated as a convenience, and a census read as a catalogue of machines. Six claims, each with the number that kills it.

wrong · Misconception How far the driven link turns is a fact about the lengths, not the chain. Each of the sixteen eight-link chains, given the arbitrary placement its own layout produces, driven from its first available choice of frame and input, and swept until a frame stops closing. 10 of the sixteen reach every angle and the rest rock through between 107° and 244°. Nothing in this chart is a property of the chains. Change the placement and the bars change; the census above them does not. It is here because it is the sharpest way to say what this field does and does not decide, and because the temptation to read a topology census as a catalogue of machines is exactly the mistake it prevents.

The chain has no lengths

Every number in this field survives multiplying every link by a different scale factor, because there are no lengths to scale. Which is also the statement of what a census cannot decide — and the sixteen eight-link chains, each given one arbitrary set of dimensions and driven, produce a chart in which nothing belongs to the chains.

topology · Topology Watt chain: 7 pins, and nothing else. A kinematic chain drawn as what it is — a graph. Each disc is a link and carries its number; each line is a pin joining two links. There are no lengths here, no angles and no positions, and every quantity this field computes survives moving any disc anywhere: the picture is a way of reading the graph and not a picture of a machine. The fill says how many pins a link carries — 4 binary, 2 ternary — which is the coarsest thing that can tell two chains apart and the first column of every census table. The count reads two numbers off this picture and nothing else: 6 links and 7 pins give 3 × 5 − 2 × 7 = 1.

A graph has no numbers at all

Every other field on this site has parameters a measurement could try to recover. This one has none. A chain is a graph, a graph is a set of links and a set of joints, and there is nothing about it that a scaling touches, a tolerance perturbs or an instrument determines.

topology · Topology Watt chain with 1 slide: 3 chains, 11 mechanisms. The same 6 links and 7 joints with 1 of the joints made a slide instead of a pin, drawn as a block astride the line. There are 7 ways to choose the joint, and the chain's 4 symmetries fold them into 3 that are genuinely different: with the slide at 0–3, 2 mechanisms; with the slide at 0–1, 6 mechanisms; with the slide at 1–2, 3 mechanisms. The mechanism count is the number of orbits of a held link and the slide set together, so a slide breaks symmetry the pin-only chain had, and links that gave one machine between them give two. The pin-only chain gave 2; one slide gives 11.

A slide turns nothing

Make one joint of a chain a slide instead of a pin and the graph has a second decision in it before any length exists. The symmetries that counted mechanisms count these too — Watt's chain with one slide is three chains and eleven machines — and two facts read off the graph say which placements still work: a loop of slides alone is freer than the count, and a pin in a group of links the slides hold at one orientation cannot turn. Across 102 placements on the three smallest chains, both agree with the rank of the constraint Jacobian.

topology · Topology

Named alongside it

The objects these essays reach for when they reach for this one.

Kinematic chainType synthesisCanonical formMobilityLink assortmentAutomorphismGraph isomorphismAssur groupConstraintDegenerate chainGrübler's criterionOrbit

All concepts