Bellman’s Escape Problem for Convex Polygons

@inproceedings{Gibbs2016BellmansEP,
  title={Bellman’s Escape Problem for Convex Polygons},
  author={Philip E. Gibbs},
  year={2016}
}
Bellman’s challenge to find the shortest path to escape from a forest of known shape is notoriously difficult. Apart from a few of the simplest cases, there are not even many conjectures for likely solutions let alone proofs. In this work it is shown that when the forest is a convex polygon then at least one shortest escape path is a piecewise curve made from segments taking the form of either straight lines or circular arcs. The circular arcs are formed from the envelope of three sides of the… CONTINUE READING

Citations

Publications citing this paper.

Lost in an Isosceles Triangle

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Exploring the Bellman Forest Problem

J. W. Ward
  • 2008
VIEW 1 EXCERPT

Lost in a Forest

  • The American Mathematical Monthly
  • 2004
VIEW 1 EXCERPT

Poorly formulated unsolved problems in combinatorial geometry

L. Moser
  • mimeographed
  • 1966
VIEW 1 EXCERPT

Minimization problem

R. Bellman
  • Bull. Amer. Math. Soc. 62
  • 1956
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…