Cartographic Projection
every map is wrong, and by exactly how much
Concept

Optimal control — where it appears

Choosing a control at every instant to minimise a cost accumulated along a path. A quickest route in a flow and a curvature-bounded shortest path are both instances, and Bellman's principle — a sub-path of an optimum is an optimum — is why re-planning a correct plan changes nothing.

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

The shortest route and the quickest one, in a zonal jet. A craft making 20 km/h through the medium, from 40° north, 34° west to 52° north, 6° east. The great circle is 3313 km and takes 111.6 hours in this flow; the quickest track is 169 km longer — 5.1 per cent further — and takes 99.1 hours, saving 11.2 per cent of the time. The strokes are the flow at its own scale, and the whole difference is that the track bends into the helping part of it. Drawn in Lambert conformal conic.

The quickest route is not the shortest

In a medium that does nothing, length and time are the same question divided by a constant. Once the water moves, they are different questions with different answers: the quickest track sails five per cent further and arrives eleven per cent sooner, and the journey back takes four times as long as the journey out.

paths · Paths The plan, the crossing that was flown, and the one a right forecast would have given. A crossing of NaN km planned against a jet forecast to sit on the fortieth parallel, flown through a jet that is actually 6 degrees further south, and re-planned six times on the way. Committing to the plan costs 167.81 hours. Re-planning costs 165.84. A vehicle that had known where the jet was would have taken 163.21. So the wrong forecast is worth 4.60 hours and re-planning recovers 1.97 of them.

A crossing is a chain of decisions

A route is handed back as a curve, and nothing anybody flies is decided once. Re-planning is worth exactly nothing when the forecast turns out right — a sub-path of an optimal path is optimal, and the chain is the plan. When it turns out wrong it recovers 19 per cent of the cost at two decisions and 83 at eighteen, and never all of it.

paths · Paths

Named alongside it

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

Flow fieldShortest pathZermelo navigationAsymmetryClosed formConvergenceCostDiscretisationEstimatorFinsler geometryGeodesicGreat circle

All concepts