Machine Kinematics
solved, then drawn
Concept

Orbit — where it appears

Everywhere a group can send one thing. For a chain's automorphisms it is the set of links that grounding gives the same machine — two on Watt's chain, three on Stephenson's; for a group of displacements it is where one point of the moving body can go, which is a line, a circle, a helix, a cylinder, a sphere or a plane, and is the surface a lower pair is made of.

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

One point, six groups, six shapes. A group has no picture, so here is the next best thing: fix one point of the moving body — the marked one — and draw everywhere the group can send it. A prismatic pair sends it along a line, a revolute round a circle, a helical along a helix, a cylindrical over a cylinder, a spherical over a sphere, a planar over a plane. Those six shapes are the six surfaces the previous figures drew, which is not a coincidence and is the field's first argument read backwards: a lower pair's surface is an orbit of its own group, which is exactly why the surface can slide on itself.

The count cannot tell a pin from a slide

A revolute, a prismatic and a helical pair all take five freedoms away in space and leave one. Grübler adds the same number for each, the constraint rank measures the same number for each, and the three joints have nothing whatever in common — one sends a point round a circle, one along a line, and one along a helix at a rate the joint decides.

pairs · Pair The twelve kinds of freedom, and which are joints. Every connected group of rigid displacements, up to where its axis points and where its origin sits. There are twelve, the height on the page is the dimension, and a line means the lower one is contained in the upper — computed by asking whether each generator of the smaller lies in the span of the larger, with all twelve built about a common axis. Filled discs are joints: six of the twelve are the symmetry group of a surface and can be a single pair, and six are not and have to be built out of a chain. There is nothing at dimension five, which is not obvious and is checked rather than assumed: twenty thousand random five-dimensional subspaces of the twists were closed under the bracket, and every one generated the whole of the six.

Twelve kinds of freedom

Every set of displacements that is closed under composition is one of twelve, up to where its axis points. Six of them are joints somebody sells. Four are motions a designer may perfectly well want and cannot buy at any price. And there is nothing at all of dimension five — checked here on twenty thousand random subspaces, every one of which generated the whole of the six.

pairs · Pair 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 point, six groups, six shapes. A group has no picture, so here is the next best thing: fix one point of the moving body — the marked one — and draw everywhere the group can send it. A prismatic pair sends it along a line, a revolute round a circle, a helical along a helix, a cylindrical over a cylinder, a spherical over a sphere, a planar over a plane. Those six shapes are the six surfaces the previous figures drew, which is not a coincidence and is the field's first argument read backwards: a lower pair's surface is an orbit of its own group, which is exactly why the surface can slide on itself.

What a point sees

A group of displacements has no shape, so the only picture of one is what it does to something. Fix a point and the six lower pairs draw a line, a circle, a helix, a cylinder, a sphere and a plane — the six surfaces the pairs are made of. And two of the twelve sweep the same surface and are still different groups, which is the honest caption on the whole method.

pairs · Pair 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 How many dimensions each chain's displacements occupy. Every chain in the field, with the dimension its reached displacements' logarithms occupy. A chain of n joints always has n freedoms; what varies is whether those freedoms compose. Where the bar equals the joint count the motion is inside a group and the group is named; where it reaches six there is no proper group containing the motion, and the two chains that do are the ones whose axes were chosen at random. Nothing about the joints themselves differs — three pins are three pins, and the two rows differ only in where the axes point.

A chain multiplies

An open chain's displacements are the product of its joints' groups, one factor per joint, in order. Sometimes the product is a group — three parallel pins and a slide along them give Schoenflies motion, which is a SCARA arm and is why it has four joints. Usually it is not, and then the chain's poses are a four-parameter set that needs six numbers to describe.

pairs · Pair 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 What every pair of groups meets in. The intersection of two subgroups is always a subgroup — that needs no computation — and which one is the useful part. This is the design rule behind every parallel machine on this site: choose legs whose groups meet in the motion the platform is wanted to have, and it has that motion whatever the leg lengths are, with no synthesis and no tolerance. The row and column are built about different axes, at right angles, because an intersection is a statement about particular subgroups rather than about their kinds: two planar groups with the same normal meet in the whole of themselves, and two with different normals meet in a line.

Legs intersect

A serial chain multiplies its joints' groups and the product is almost never a group. A parallel machine's platform gets the intersection of what its legs permit — and an intersection of groups is a group, always, with no coincidence required. That is the only construction in this field that produces closure for free, and it is why a platform can be designed for a motion type instead of discovered to have one.

pairs · Pair The search generates 3,000 candidates for 1,878 answers. How much work the enumeration does, against how much it has to show for it. The upper line is the number of complete labelled graphs the search reaches and the lower is the number of distinct graphs they turn out to be, so the vertical gap is waste — every candidate above the lower line is a graph the search had already found under a different labelling. At eight links the unpruned version of this search generated 8,494 candidates for the same 71 answers, and at ten links it did not finish at all; with the pruning it generates 3,000 for 1,878 in 442 milliseconds. The rule that does it is one line long: when two links carry the same number of pins, reject the labelling that would be lexicographically smaller if they were swapped. It cannot reject a labelling that is the largest in its class, so nothing is lost, and it is not a complete test, which is why the canonical form is still taken at the end.

The candidates a search throws away

The obvious enumeration generates every labelling of every chain and keeps one. At eight links that is 8,494 complete graphs for 71 answers; at ten it does not finish. One rule — reject the labelling that a swap of two equal links would improve — takes it to 3,000 candidates for 1,878 answers in half a second, and twelve links is still out of reach.

topology · Topology Sarrus, as two planes meeting in a line. Each arm of Sarrus's linkage is three pins with parallel axes, so each arm holds the platform inside a planar group — the one whose normal is that arm's axis direction. The platform has to satisfy both, so what it may do is the intersection, and the intersection of two planar groups whose normals are not parallel is the one-dimensional group of translations along their common perpendicular. The platform goes up and down and does nothing else, and that is the exact straight line the spatial field measured to 10⁻¹⁶ of its span — arrived at here with no mechanism solved and no tolerance anywhere. Drag the arms towards each other: the answer is a translation at every angle but zero, where the two groups become one group and the intersection jumps to three dimensions. That is the linkage built flat, and it is the configuration in which it stops being a straight-line mechanism.

Two planes meeting in a line

Sarrus's linkage draws an exact straight line out of six pin joints, and the spatial field proved it by solving the mechanism sixty times and measuring a departure of 9.8 × 10⁻¹⁶. Here the same fact comes out of two planes and a cross product, with no mechanism solved anywhere — and the two routes are not redundant, because only one of them can tell you the linkage as built delivers it.

pairs · Pair What one point can and cannot see of a group. For each of the twelve: the group's dimension, the dimension of one point's orbit under it, and the difference — the stabiliser, the motions that leave that particular point exactly where it is. The orbit is the only picture a group has, and this table is the honest caption on it. Planar motion and spherical motion are both three-dimensional and both sweep a point over a two-dimensional surface, so each leaves one motion doing nothing at all: a turn about the plane's normal in one case, a turn about the radius in the other. A point does not see the whole group, and no drawing of one trajectory can be a complete picture of what a joint permits.

Six things a joint is not

A freedom count read as a description, a screw system read as a group, a pair list read as a convention, a trajectory read as a determination, a nominal alignment read as a delivered one, and a higher pair read as a larger joint. Six claims, each of them what a careful person would say, each answered with a number.

wrong · Misconception 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.

Displacement subgroupMobilityAutomorphismKinematic chainCanonical formInversionLower pairSubalgebraType synthesisConstraintGraph isomorphismLie bracket

All concepts