The paper reformulates Bellman's lost-in-a-forest problem as a traveling-salesman-style optimization over rotated and translated forest boundaries, but the promised general solution lacks a rigorous convergence proof and yields only known results.
A translation of Henri Joris' "Le chasseur perdu dans la for\^et" (1980)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This is an English translation of Henri Joris' article "Le chasseur perdu dans la for\^et (Un probl\`eme de g\'eom\'etrie plane)" that appeared in $Elemente\ der\ Mathematik$ v. 35 (1980) n. 1, 1--14. Given a point $P$ and a line $L$ in the plane, what is the shortest search path to find $L$, given its distance but not its direction from $P$? The shortest search path was described by Isbell (1957), but a complete and detailed proof was not published until Joris (1980). I am thankful to Natalya Pluzhnikov for her dedicated work and to the Swiss Mathematical Society for permission to post this translation on the arXiv.
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A General Solution to Bellman's Lost-in-a-forest Problem
The paper reformulates Bellman's lost-in-a-forest problem as a traveling-salesman-style optimization over rotated and translated forest boundaries, but the promised general solution lacks a rigorous convergence proof and yields only known results.