Machine Kinematics
solved, then drawn
Concept

Two-link arm — where it appears

Two equal links from one fixed pivot, whose tip reaches every point of a disc of twice their length. It is what a compiled machine is built on: the tip's coordinates are two-term Laurent polynomials in the links' angles, so any polynomial in them is a finite sum of cosines.

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

Two routes to the same number, along one sweep. The polynomial x^4 + 2x^2y^2 + y^4 − 1.2x^2 + 1.2y^2 evaluated at the tip of the arm as the second angle goes right round, by two routes that share nothing: once by putting the tip's coordinates into the polynomial, and once by adding up 5 cosines of whole-number combinations of the two angles. The two curves are drawn on top of each other and the worst gap between them is 8.9e-15. Where the line crosses zero is where the machine may stand: 2 crossings at this α, which is how many assemblies the compiled machine has at this driving angle.

Every curve is a sum of cosines

Put the two angles of a two-link arm into any polynomial in x and y and what comes out is a constant plus a finite sum of cosines of whole-number combinations of them. Nine curves, three hundred random angle pairs each, and the two routes agree to 1.8 × 10⁻¹⁴.

computing · Compute Two circles, one term. The curve r² = 1.44 together with r² = 2.56, whose squared radii sum to 4.00 — four times the square of the arm's link length. Their product equation expands to 1 term, which is what either circle costs on its own, so the second circle is free. The machine compiled from it has 17 bars against 11 for the single circle, runs over 5.200 radians against 1.560, and stays on the outer component throughout: its radius varies by 4.15e-13 over 240 solved positions. A mechanism moves continuously and the two circles are disjoint, so no assembly of it reaches both.

Two circles for the price of one

Search every multiple of a curve's equation by a polynomial of degree two and the cheapest is the curve's own equation, on four curves and by exhaustion. On the circle a second multiplier ties — and what it describes is two concentric circles, whose squared radii sum to four times the arm's link length squared, at exactly the cost of one.

computing · Compute The cheapest curve of each degree. The curve of degree 6 whose equation expands into the fewest cosines of the arm's two angles: cos 3θ = 0.3: 3 concentric circles about the pivot. It costs 1 term — cos(3α − 3β + …) — and the machine compiled from it has 27 bars. The dashed circle is the arm's reach. The dots are the machine's tracing point over 140 solved positions; it draws one component and stays on it. At every even degree the cheapest curve costs one term and at every odd degree two, whatever the degree.

The cheapest curves at each degree

Search every equation of degree up to six, not the multiples of one curve, for the fewest cosines a compiled machine has to build, and the answer does not depend on the degree at all: one term at every even degree, two at every odd one, each reached by exactly one set of frequencies. The cheap curves are concentric circles placed where Chebyshev's polynomials put them — k of them for the price of one — and, at odd degree, a line through the pivot with circles that come free. One symmetry of the arm forbids anything cheaper: its two links can be swapped without moving the tip.

computing · Compute A quintic of eighteen terms, and the nearest curve that costs a few. The quintic x^5 + 0.4x^2y − y = 0, whose equation expands into 18 cosines of the arm's two angles, inside the arm's reach (dashed). Drawn over it, the curve of the same degree with at most 4 terms that comes nearest to it inside the reach, found by trying every set of terms of that size: it keeps 0,1|1,0, 1,-2|2,-1 and is at most 2.77e-2 from the quintic and the quintic at most that from it — 1.4% of the reach. The slider steps through the budgets at which the nearest curve improves.

Four terms of eighteen draw the quintic

A quintic whose equation costs a compiled machine eighteen terms is drawn to 1.4% of the arm's reach by four of them and to 0.02% by ten, found by trying every set. The four are not its four largest. They are a line through the pivot bent by the square of the radius, the family the cheapest curves come from, and a curve close to that family is nearly free. An ellipse, a parabola, a lemniscate and a folium are not close to it, and each costs its whole equation to come within four per cent.

computing · Compute Moving the pivot adds terms everywhere but one locus. The folium x³ + y³ − 1.5xy = 0, drawn in its own coordinates, and the square of pivot positions from −1 to 1 searched at steps of 0.05 (shaded). With the arm's pivot at the origin, where the catalogue puts it, the equation expands into 11 cosines of the arm's two angles. Moved anywhere in the square off the line x + y = 0 (heavy), it expands into 12; at (0.5, 0.3), for instance, 12. 41 of the 1681 pivots tried cost less than 12, all on that locus, and none costs less than the catalogue's 11.

Moving the pivot only adds terms

A compiled machine's cost is the number of cosines its curve's equation expands into, and moving the arm's pivot gives the same curve a different equation. So an expensive curve might only be expensive because of where the arm was put. Searched over 1,681 pivots, it never is. Moving the pivot adds the equation's own derivatives at the pivot as new terms, and they cancel only on one locus per curve — a centre, or a line — on which the catalogue's pivot already sits. Anywhere else the ellipse costs 6 instead of 4, the folium 12 instead of 11, the lemniscate 9 instead of 5, the parabola its 6 everywhere, and the quintic that four terms nearly draw costs 30 instead of 18.

computing · Compute Along one line the nearly free curve stays nearly free. The arm's pivot is fixed at the centre of its reach (dashed); the quintic x⁵ + 0.4x²y − y = 0 is drawn with its own point — where the catalogue put the pivot — moved 0.2 of a link along the line x = 0, which is the same as moving the pivot the other way. Heavy: the arc priced, the part of the quintic within 1.4 of its own point. Thin: the nearest curve built from at most four cosines of the arm's angles, found by trying every set of four: 6.0% of the reach away, the line through the pivot bent by the square of the radius. The equation itself costs 22 cosines here.

The quintic's cheapness runs along a line

A quintic whose equation costs a compiled machine eighteen cosines is drawn to a few per cent of the arm's reach by four of them, and its exact count jumps to 22 or 30 the moment the arm's pivot moves. Priced by the nearest curve instead, the two directions part completely. Along the line x = 0 the nearest four-term curve stays within 7.3% of the reach out to 0.4 of a link and the nearest six-term within 3.4%. Across it the four-term price goes from 3.2% to 18% between a twentieth and a tenth of a link, and from 0.15 on four terms buy nothing over three. The move along adds four cosines of amplitude 0.2 and 0.4 times the move; the move across adds twelve, sixty to ninety times larger in total.

computing · Compute The cheap pivots lie in a valley tilted off the line x = 0. The price of the quintic's arc drawn by the line through the pivot bent by the square of the radius, four cosines, as a share of the arm's reach, at pivots a two-hundredth of a link apart across and a twentieth along, within 0.16 and 0.45 of the catalogue's point. Darkest: within 5%; then within 10% and 20%. The cheapest pivot at each height (dots) lies on a line at dx/dy = -0.172, 9.8° off the line x = 0 (dashed), with prices from 1.4% to 2.7%; on x = 0 itself the price reaches 7.3%.

The quintic's cheap pivots lie off the line

Four cosines draw the quintic within a few per cent of the arm's reach from its catalogue pivot, and the earlier measurement found that cheapness surviving along the line x = 0 and dying across it. Mapped over a grid of pivots, it does neither exactly. The cheap pivots form a narrow valley tilted ten degrees off that line, about a twentieth of a link wide. In the valley four cosines hold the arc to 1.4–2.5% at every height out to 0.4 of a link; on the line itself, at the same heights, they miss by 6–7%. At two valley pivots every set of four cosines and every set of six was tried, and none beat the bent line. The amplitudes of the cosines a move adds predict a tilt a seventh as large, so they do not explain it.

computing · Compute

Named alongside it

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

Frequency pairCost modelAlgebraic curveSparsityImplicit equationTrigonometric polynomialApproximationCompiled machineDegreeLeast-squaresSymmetryConjugate pair

All concepts