Geodesic
On a question of Bellman
Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 8, Tome 299 (2003), pp. 54-86 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

From a random point $O$ in an infinite strip of width 1 we move in a randomly chosen direction along a curve $\Gamma$. What shape of $\Gamma$ gives the minimum value to the expectation of the length of the path that reaches the boundary of the strip? After certain arguments in support that the desired curve belongs to one of four classes, it is proved that the best curve in those classes consists of four parts: an interval $OA$ of length $a$, its smooth continuation, an arc $AB$ of radius 1 and small length $\varphi$, an interval $BD$ that is smooth continuation of the arc, and an interval $DF$ (with a corner at the point $D$). If we take $O$ as the origin and $OA$ as the $x$ axis of a system of coordinates, then the coordinates of the above-mentioned points will be: $A(a,0)$, $B(a+\sin\varphi,1-\cos\varphi)$, $F(a,1)$, $$ D\left(a+\frac{\cos\varphi\sqrt{1+a^2}-a}{\cos\varphi-a \sin\varphi}, 1-\frac{\sin\varphi\sqrt{1+a^2}}{\cos\varphi-a\sin\varphi}\right). $$ For the best curve we have: $a\approx0.814$, $\varphi\approx0.032$. Related questions are discussed. 
@article{ZNSL_2003_299_a4,
     author = {V. A. Zalgaller},
     title = {On a~question of {Bellman}},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {54--86},
     year = {2003},
     volume = {299},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2003_299_a4/}
}
TY  - JOUR
AU  - V. A. Zalgaller
TI  - On a question of Bellman
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2003
SP  - 54
EP  - 86
VL  - 299
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2003_299_a4/
LA  - ru
ID  - ZNSL_2003_299_a4
ER  - 
%0 Journal Article
%A V. A. Zalgaller
%T On a question of Bellman
%J Zapiski Nauchnykh Seminarov POMI
%D 2003
%P 54-86
%V 299
%U http://geodesic.mathdoc.fr/item/ZNSL_2003_299_a4/
%G ru
%F ZNSL_2003_299_a4
V. A. Zalgaller. On a question of Bellman. Zapiski Nauchnykh Seminarov POMI, Geometry and topology. Part 8, Tome 299 (2003), pp. 54-86. http://geodesic.mathdoc.fr/item/ZNSL_2003_299_a4/

[1] R. Bellman, Dinamicheskoe programmirovanie, IL., M., 1980

[2] R. Bellman, “Minimisation problem”, Bull. Amer. Math. Soc., 62 (1956), 270 | DOI | MR

[3] J. R. Isbell, “An optimal search pattern”, Naval Research Logistics Quarterly, 4 (1957), 357–359 | DOI | MR

[4] V. A. Zalgaller, “Kak vyiti iz lesa? (ob odnoi zadache Bellmana)”, Matem. prosveschenie, 1961, no. 6, 191–195

[5] A. Adhikari, J. Pitman, “The shortest planar arc of width, 1”, Amer. Math. Mon., 96, 1989, 309–327 | MR | Zbl

[6] D. O. Shklyarskii, N. N. Chentsov, I. M. Yaglom, Geometricheskie neravenstva i zadachi na maksimum i minimum, Nauka, M., 1970

[7] A. S. Kronrod, Uzly i vesa kvadraturnykh formul, Nauka, M., 1964 | MR

[8] V. Blyashke, “Lektsii po integralnoi geometrii”, Uspekhi mat. nauk, 1938, no. 5, 97–149

[9] V. A. Zalgaller, Kratchaishie linii osmotra sfery, Dep. v VINITI No 2844-1392 ot 24.09.1992