Machine Kinematics
solved, then drawn
Concept

Constraint rank — where it appears

The number of independent conditions a mechanism's constraints impose, as opposed to how many are written down. Subtracting it from the coordinate count gives the mobility, and its difference from a count of constraints is exactly how much redundancy the mechanism carries.

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

The identification Jacobian of a four-bar, read by protractor. One row for every number the instrument reads and one column for every parameter that might be wrong. Each cell is the derivative of that reading with respect to that parameter, drawn to the right of its centre line when positive and to the left when negative, with the largest entry in the whole matrix at 4.07e-1. 12 rows against 4 columns: far more equations than unknowns, which is what makes an identification a least-squares problem rather than a solve, and what makes the question of which combinations of columns cancel a real one. These are the same derivatives the tolerance field computes one at a time — the same matrix read down instead of across.

The matrix a calibration inverts

One row for every number an instrument reads, one column for every parameter that might be wrong. Every entry is a derivative the tolerance field has been computing since its first essay — so this field's central object arrived already built, and what is new is which way it is read.

metrology · Parameter A brace is one redundant equation, on purpose. The compiled machine, counted and measured, with and without 4 braces. The count says the braced machine has -3 degrees of freedom — it cannot move — and the rank of the constraint Jacobian says it has 1, the same as before. Every brace contributes exactly one equation the others already imply, which is what overconstraint is, and here it is being added deliberately: the redundancy is what removes the assemblies the count knows nothing about. This is Grübler being wrong for the useful reason rather than the embarrassing one.

A bar between two midpoints

In a parallelogram the midpoints of two opposite sides are exactly one side apart, and in the crossed assembly they are not. One bar between them admits the first and refuses the second — and it is one redundant equation per parallelogram, added on purpose, on a site whose constraint field is otherwise about overconstraint arriving by accident.

computing · Compute One freedom, whatever the count says. Every one of these machines has exactly one degree of freedom, measured as the number of unknowns minus the rank of the constraint Jacobian. Unbraced, the count agrees. Braced, the count says the largest machine has -153 — that it cannot move, by a wide margin — and the rank says it still turns exactly as it did. The gap is one equation per brace and every one of those equations is implied by the others. This is the constraint field's oldest example, at a scale nobody would try by hand: a count that is wrong by a hundred and fifty-three about a mechanism that works.

One freedom and four hundred links

Braced, the machine compiled from a quintic has 1,249 equations in 1,096 unknowns and a Grübler count of minus a hundred and fifty-three. It turns. The rank of its constraint Jacobian is 1,095, so its mobility is one — and every one of the hundred and fifty-four surplus equations was added deliberately.

constraint · Mobility 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 Which numbers have a size. Twelve quantities from eight fields of mechanism kinematics, each scaled by taking every length in its mechanism up and down together and fitting the power its value follows. A shape lands on zero, a length on one, a curvature on minus one, an area on two, and every row lands on an integer to 3.3e-11. The sorting is not a units argument — it is measured from each field's own library, by asking that library the same question. What it says is that most of what kinematics computes is a shape: a mobility, a Grashof class, a transmission angle, a contact ratio and a velocity ratio are all unchanged by making the machine bigger, so all of them are recoverable from a measurement that cannot recover a single length. The row worth stopping at is the tolerance band: held to a fixed ±0.01 it lands on minus one, because ±0.01 is a length and a bigger machine held to the same absolute tolerance is a better machine. Written as a percentage the same band lands on zero. One quantity, two drawing conventions, two different kinds of number.

A count is neither

Every quantity in the scaling survey lands on an integer power — zero for a shape, one for a length, two for an area. A mobility lands nowhere. It has no dimension at all, it does not move under any perturbation, and the probe that sorts the rest of the site's numbers returns nothing for it.

metrology · Parameter

Named alongside it

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

Grübler's criterionMobilityIdentifiableOverconstraintRedundant constraintAssembly branchAssembly-modeAutomorphismCalibrationCompiled linkageDegrees of freedomGrashof's condition

All concepts