Machine Kinematics
solved, then drawn
Concept

Precision-point — where it appears

One of the positions at which a synthesised mechanism reproduces its wanted motion exactly. Between them the error is not zero, and where they are placed decides how large the error in between is.

Named by 7 essays across 3 fields — 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 wrong the trapezoid is, arm angle 15.6°. The difference between the outer wheel's angle and the angle that would put all four wheels on one circle. It is zero at straight ahead by construction — both wheels point forwards — and it reaches 2.06° at 35° of lock. "One hundred per cent Ackermann" names a condition this linkage meets at 1 angle and nowhere else, and no four-bar can do better than a handful: the condition is not a rational function of the crank angle, and the linkage is.

The steering that is never right

For four wheels to roll without scrubbing, the two front wheels must point at different angles, and the relation between them is a cotangent condition no four-bar can satisfy. The trapezoid under every car meets it at straight ahead and, if the arm angle is chosen well, at exactly one other angle — 0.34° out at worst instead of 2.06°.

applied · Fourbar Ball's point at 66°. Two curves and one point. The circle is the locus of points whose path is momentarily straight; the cubic is the locus of points whose path curvature is momentarily not changing. A point on both has a path that is straight and staying straight — four-point contact with its own tangent line, one order better than anything else in the plane. That is Ball's point. Walking the circle and looking for a zero of κ′ turned up 1 sign changes here and 1 of them survived being checked for continuity — the others are the asymptote the pole itself produces. Its measured order of contact with the line is 3.95. positioned by solving, not by drawing.

The straightest point there is

Where the circle of points going straight meets the cubic of points whose curvature is standing still, there is one point whose path is straight and staying straight. Neither Watt nor Chebyshev put their tracing point there, and moving Watt's to it more than halves the error over the whole stroke.

curvature · Curvature The error between the precision points. chebyshev: worst 0.2232°, RMS 0.1475°; uniform: worst 0.3415°, RMS 0.2296°. 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 the precision points go

A linkage that matches a function at three points is wrong between them, and where the three points are put decides how wrong. Chebyshev spacing cuts the worst error by a third against even spacing, for free — and the reason has nothing to do with mechanisms. It is a fact about a polynomial the linkage has never heard of.

synthesis · Synthesis 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 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 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

Named alongside it

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

Function generationStructural errorFreudenstein equationKinematic synthesisMinimaxMotion generationPath generationAckermannApproximate synthesisApproximationAssembly branchAssur group

All concepts