Machine Kinematics
solved, then drawn
Concept

Path generation — where it appears

Synthesis for the curve a point traces, with no requirement on the orientation of the link carrying it. It is one of the three problems the word synthesis covers, and the least constrained of them.

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

A four-bar that computes log₁₀. The output rocker's angle, mapped back into y, against the input crank's angle mapped back into x. The pale curve is log₁₀ x and the solid one is what the linkage does. They agree exactly at the 3 precision points and nowhere else; the largest disagreement over the range is 0.2232° of rocker, which is 7.47e-4 in y. The chebyshev spacing put the precision points at 1.0670, 1.5000, 1.9330.

Three problems called synthesis

Prescribing a path, prescribing a whole pose, and prescribing a relation between two angles are three different problems with three different counts, and the word synthesis covers all of them. The third has a property the others do not — eliminate the coupler angle and the design equation becomes linear, so a four-bar that computes a logarithm falls out of a 3 × 3 solve with no iteration at all.

synthesis · Synthesis How many points a linkage will take. function generation: 5 free numbers, 1 net constraint per point, 5 precision points; motion generation: 4 free numbers, 1 net constraint per point, 5 precision points; path generation: 9 free numbers, 1 net constraint per point, 9 precision points. Every count in the literature that differs from these differs about what is being counted as free, not about the geometry.

How many points may be prescribed

Five poses, five angle pairs, nine points — three numbers that get quoted as properties of a four-bar and are properties of what somebody decided to count as free. Derive them instead, and the fifth precision point turns a linear solve into a system with 128 paths, twelve finite solutions, four real ones, and exactly one linkage anybody could build.

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.

Kinematic synthesisFreudenstein equationFunction generationMotion generationPrecision-pointApproximate synthesisAssembly branchBezoutCompiled linkageObjective functionPolynomial systemPrecision position

All concepts