Machine Kinematics
solved, then drawn
Concept

Approximate synthesis — where it appears

Finding link lengths that come as close as possible to a wanted motion, when no exact solution exists or none is usable. The measure of closeness is a choice, and a least-squares fit and a minimax fit give different linkages from the same specification.

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

Also named here as objective function — the same set of essays touches all of them, so they are one junction rather than several.

The error between the precision points. chebyshev: worst 0.2232°, RMS 0.1475°; least-squares: worst 0.3900°, RMS 0.1203°; minimax: worst 0.2105°, RMS 0.1463°. The error is zero at each precision point by construction and nowhere else. minimax has the smallest maximum here, and which curve is best depends entirely on which measure is asked for.

The linkage that is only nearly right

Stop demanding that a linkage pass exactly through three points, and ask instead that it be close everywhere. Three linkages result, none of them passing exactly through anything, and each is the best by a different measure — the least-squares fit beats the interpolant on average error and loses to it on the worst case. An optimiser gives exactly what it was asked for and nothing else.

synthesis · Synthesis The error between the precision points. chebyshev: worst 0.2232°, RMS 0.1475°; least-squares: worst 0.3900°, RMS 0.1203°. The error is zero at each precision point by construction and nowhere else. chebyshev has the smallest maximum here, and which curve is best depends entirely on which measure is asked for.

Where an optimiser starts

An approximate synthesis is a local search on an objective that is non-convex, disconnected and not everywhere defined, so the answer depends on where the search began. Nothing in the optimisation supplies that. What supplies it is the exact constructions the field spent four rungs on, and an atlas of coupler curves — which is why a method superseded by computers is still the thing that feeds them.

synthesis · Synthesis What each curve costs, in cosines. Every polynomial in the two arm angles is a constant plus a sum of terms A cos(mα + nβ + φ) with whole-number m and n, and the number of those terms is what a machine has to build. The count is not the degree and not the monomial count: a circle costs one term, a general line two, and a lemniscate — degree four — costs five, fewer than the cubic above it, because its symmetry cancels frequency pairs the cubic keeps. Each row's expansion was checked against a direct evaluation of its own polynomial at random angles, worst disagreement 1.8e-14.

Prescribing a curve rather than points

A four-bar can be made to pass through nine prescribed points and no more; past nine the problem is over-determined and the answer is an optimiser's. Prescribe the whole curve as an equation instead and there is no counting to do — but the mechanism that comes back has four hundred bars where the four-bar had four.

synthesis · Synthesis

Named alongside it

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

Objective functionKinematic synthesisNelder meadAtlasBranch defectCompiled linkageCoupler curveFunction generationInitial guessLeast-squaresMinimaxPath generation

All concepts