Jump to content

Zermelo's navigation problem

From Wikipedia, the free encyclopedia

In mathematical optimization, Zermelo's navigation problem, proposed in 1931 by Ernst Zermelo, is a classic optimal control problem that deals with a boat navigating on a body of water, originating from a point to a destination point . The boat is capable of a certain maximum speed, and the goal is to derive the best possible control to reach in the least possible time.

Zermelo Navigation with velocity under constant wind

Without considering external forces such as current and wind, the optimal control is for the boat to always head towards . Its path then is a line segment from to , which is trivially optimal. With consideration of current and wind, if the combined force applied to the boat is non-zero the control for no current and wind does not yield the optimal path.

History

[edit]

In his 1931 article,[1] Ernst Zermelo formulates the following problem:

In an unbounded plane where the wind distribution is given by a vector field as a function of position and time, a ship moves with constant velocity relative to the surrounding air mass. How must the ship be steered in order to come from a starting point to a given goal in the shortest time?

Ernst Zermelo formulated and solved the general problem

This is an extension of the classical optimisation problem for geodesics – minimising the length of a curve connecting points and , with the added complexity of considering some wind velocity. Although it is usually impossible to find an exact solution in most cases, the general case was solved by Zermelo himself in the form of a partial differential equation, known as Zermelo's equation, which can be numerically solved.

The problem of navigating an airship which is surrounded by air, was presented first in 1929 at a conference by Ernst Zermelo. Other mathematicians have answered the challenge over the following years. The dominant technique for solving the equations is the calculus of variations.[2]

Constant-wind case

[edit]

The case of constant wind is easy to solve exactly.[3] Let , and suppose that to minimise the travel time the ship travels at a constant maximum speed . Thus the position of the ship at time is . Let be the time of arrival at , so that . Taking the dot product of this with and respectively results in and . Eliminating and writing this system as a quadratic in results in . Upon solving this, taking the positive square-root since is positive, we obtain

Claim: This defines a metric on , provided .

Proof

[edit]

By our assumption, clearly with equality if and only if . Trivially if , we have . It remains to show satisfies a triangle inequality

Indeed, letting , we note that this is true if and only if

if and only if

which is true if and only if

Using the Cauchy–Schwarz inequality, we obtain with equality if and only if and are linearly dependent, and so the inequality is indeed true.

Note: Since this is a strict inequality if and are not linearly dependent, it immediately follows that a straight line from to is always a faster path than any other path made up of straight line segments. We use a limiting argument to prove this is true for any curve.

General solution

[edit]

Consider the general example of a ship moving against a variable wind . Writing this component-wise, we have the drift in the -axis as and the drift in the -axis as . Then for a ship moving at maximum velocity at variable heading , we have

The Hamiltonian of the system is thus

Using the Euler–Lagrange equation, we obtain

The last equation implies that . We note that the system is autonomous; the Hamiltonian does not depend on time , thus = constant, but since we are minimising time, the constant is equal to 0. Thus we can solve the simultaneous equations above to get[4]

Substituting these values into our EL-equations results in the differential equation

This result is known as Zermelo's equation. Solving this with our system allows us to find the general optimum path.

Constant-wind revisited example

[edit]

If we go back to the constant wind problem for all time, we have

so our general solution implies , thus is constant, i.e. the optimum path is a straight line, as we had obtained before with an algebraic argument.

References

[edit]
  1. ^ Zermelo, Ernst (1931). "Über das Navigationsproblem bei ruhender oder veränderlicher Windverteilung". Zeitschrift für Angewandte Mathematik und Mechanik. 11 (2): 114–124. Bibcode:1931ZaMM...11..114Z. doi:10.1002/zamm.19310110205.
  2. ^ Heinz-Dieter Ebbinghaus (2 June 2007). Ernst Zermelo: An Approach to His Life and Work. Springer Science & Business Media. pp. 150–. ISBN 978-3-540-49553-6.
  3. ^ Warnick, Claude (2011). "The geometry of sound rays in a wind". Contemporary Physics. 52 (3): 197–209. arXiv:1102.2409. Bibcode:2011ConPh..52..197G. doi:10.1080/00107514.2011.563515. S2CID 119728138.
  4. ^ Bryson, A.E. (1975). Applied Optimal Control: Optimization, Estimation and Control. Taylor & Francis. ISBN 9780891162285.