Machine Kinematics
solved, then drawn
Concept

Assur group — where it appears

The smallest set of links that can be positioned once the frame and the driven link are known, together with the joints inside it and onto what is already placed. Its arithmetic is three coordinates per link against two equations per usable joint, and its size decides whether a closed form for the position exists.

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

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 Two circles each, so two to the power of the dyads. A dyad has two solutions, and a chain whose groups are all dyads is solved one dyad at a time, so the number of ways it can be assembled at a given input angle is 2 raised to the number of them. That is a prediction made from the graph about a count of configurations, and it is checked here against a count: the same chain solved from 240 random seeds, with the distinct converged configurations counted. The two agree in every row. Watt's did not at first — it came back at eight — and every one of the four extra answers had its ternary link mirrored: three distances fix a triangle only up to reflection, so the distance equations admit a part that has been turned inside out. A reflected link is a different part rather than a different pose, and the solver refuses those frames now.

Two to the power of the dyads

How many ways a mechanism can be assembled at a given input angle is a count of configurations, and it is predicted here by a graph: two circles per pair of links, so two to the power of the number of pairs. The prediction came back four for Watt's chain and the count came back eight, and the four extra had a link turned inside out.

algebra · Algebra A dyad is two circles, and that is why it has two answers. The whole of what makes a dyad easy. Two links, three pins: one pin onto something already placed at each end, one pin between them. The free pin is at a fixed distance from each of the placed ones, so it lies on both circles — and two circles meet in two points, in nought, or in one. That is a quadratic with a closed form, and its two roots are the two assembly branches every four-bar on this site has. A group of four links has no such picture: its unknowns do not separate into one circle each, the system does not factor, and what replaces the compass is Newton's method from a seed. positioned by solving, not by drawing.

What has to be solved together

Hold a link, turn a neighbour, and the rest of a mechanism comes apart into the smallest sets that can be positioned one after another. Every set of two links is two circles meeting — a quadratic, two branches, no solver. A set of four is a system, and this site's Newton solve stops being a convenience.

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 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 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 A machine with one thing in it that must be solved at once. Each compiled machine's joints, walked in the order they can be placed: a joint goes down as soon as two things already placed decide where it is. Every one of these machines unwinds completely, and each contains exactly one pair that has to be solved together — the arm and the parallelogram that carries its second angle back to the pivot. Nothing larger than a dyad appears in a machine of two hundred and forty joints. The topology field's four-bar, at four, has no such decomposition at all; a compiled linkage is enormous and structurally trivial, which are not the same axis.

A machine with one dyad in it

Two hundred and forty joints, and two hundred and thirty-eight of them can be placed one at a time from parts already positioned. The whole of what has to be solved simultaneously is a single pair — the arm and the parallelogram carrying its second angle home. Size and structural depth are different axes, and a compiled machine is extreme on one and trivial on the other.

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

Named alongside it

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

Kinematic chainCanonical formInversionType synthesisDyadMobilityAssembly branchLoop closurePosition analysisAutomorphismDegenerate chainDimensional synthesis

All concepts