首页> 外文期刊>Computational geometry: Theory and applications >On the approximation of shortest escape paths
【24h】

On the approximation of shortest escape paths

机译:关于最短逃生路径的近似

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A hiker is lost in a forest of unknown shape. What is a good path for the hiker to follow in order to escape from the forest within a reasonable amount of time? The hiker's dilemma clearly is: Should one start exploring the area close-by and expand the search radii gradually? Or should one rather pick some direction and run straight on?
机译:None

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号