Machine Kinematics
solved, then drawn
Concept

Parallelogram linkage — where it appears

Four bars with equal opposite sides, holding two links parallel at every configuration. Its four lengths also close as an antiparallelogram, so a machine built from many of them has an assembly for each and most of them compute the wrong thing.

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

How much of a compiled machine is computing anything. Each machine's bars split two ways: the ones that build an angle — reflectors, means, rigid offsets, the arm — and the ones that carry a direction from where it was computed to where it is needed. On the smallest machines the arithmetic is nearly all of it. By the quintic the carrying is 80 per cent, and it goes on rising, because the arithmetic grows with the number of terms and the carrying grows with the number of pairs of them. That is the answer to why a universality construction is enormous, and it is not about the algebra being hard.

A parallelogram carries an angle, and only so far

A direction computed at the frame is no use where it is needed. A parallelogram carries one from point to point — but only between two points a fixed distance apart, and that single proviso is what makes a compiled machine quadratic in the number of terms and turns most of it into transport.

computing · Compute One linkage, two curves. The same bars, the same lengths, the same driving angle — assembled two ways. One trace is where the polynomial vanishes and the other is not: the worst value of xy − 0.5 along the second is 8.7e-1, against 4.7e-14 along the first. Every position on both was solved to 9.5e-14. Nothing about the second linkage is defective; one of its parallelograms is a crossed one, so a direction is being carried wrongly, and the machine is faithfully computing a different function.

The proof drew more than the curve

Sixteen ways to assemble one linkage. Eight of them close. Four put the tracing point on the curve and four put it somewhere else — at a closure residual of 9.6 × 10⁻¹⁵, which is the same floor the right ones reach. No tolerance on the closure could ever have told them apart.

computing · Compute 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

Named alongside it

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

Assembly branchOverconstraintAntiparallelogramBranch defectCompiled linkageConstraint rankGrübler's criterionLinkageLoop closureMobilityRedundant constraintRigid body

All concepts