Shortest paths for line segments (Q686741)

We study the problem of shortest paths for a line segment in the plane. As a measure of the distance traversed by a path, we take the average curve length of the orbits of prescribed points on the line segment. This problem is nontrivial even in free space (i.e., in the absence of obstacles). We characterize all shortest paths of the line segment moving in free space under the measure \(d_ 2\), the average orbit length of the two endpoints. The problem of \(d_ 2\) optimal motion has been solved by \textit{A. B. Gurevich} [The ``most economical'' displacement of a segment, Differential Equations 11, 2134-2142 (1975; Zbl 0334.49049)] and also by \textit{V. A. Dubovitskij} [The Ulam problem of optimal motion of line segments, Springer-Verlag, New York (1985; Zbl 0565.49016)], who calls it Ulam's problem. Unlike previous solutions, our basic tool is Cauchy's surface-area formula. This new approach is relatively elementary, and yields new insights.