Bellman's lost-in-a-forest problem
Statement
Let be a closed set with nonempty interior (a "forest"), given up to congruence, and let denote the group of orientation-preserving isometries of (rotations and translations), each element of which encodes a possible starting position and heading of a hiker.
A rectifiable curve is called an escape path for if
equivalently, a hiker who walks the curve starting from any point of with any heading necessarily meets at some moment, and no congruent (directly congruent) copy of lies entirely in .
Writing for the total length of , set
Determine , and exhibit a curve attaining this infimum, for an arbitrary forest ; in particular, do so for every convex with nonempty interior, bounded or unbounded.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.