Straight lines minimize expected escape time from Euclidean balls in any dimension for the min-mean Bellman lost-in-forest problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
What is the path of minimum expected length for escaping a planar convex region Omega? We rigorously obtain best 2-segment and 3-segment solutions when Omega is an infinite strip, and numerically examine 2-segment solutions when Omega is a disk.
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Straight-line optimality in Bellman's lost-in-a-forest problem for Euclidean balls
Straight lines minimize expected escape time from Euclidean balls in any dimension for the min-mean Bellman lost-in-forest problem.