|
|
Bellman's Lost in a Forest Problem and Its Analysis
Haviger, Vojtěch ; Hoderová, Jana (referee) ; Čermák, Jan (advisor)
This thesis is focused on the Bellman’s problem of searching for the shortest escape path from the planar, closed and convex set with a nonempty interior. After introduction of some notions needed to understand and solve the problem, the thesis deals with discusions of the shortest escape paths for considered shapes of the given set (circular disc, circular sector, infinite strip, rectangle, regular polygon, triangle, half-plane, circle). Finally, the obtained results are summarized, and extended by some open problems.
|
guest ::
