• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Searching for a Mobile Intruder in a Corridor-. The Open Edge Variant of thePolygon Search Problem
【24h】

Searching for a Mobile Intruder in a Corridor-. The Open Edge Variant of thePolygon Search Problem

机译：在走廊中搜索移动入侵者 - 。多边形搜索问题的开放边缘变体

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The polygon search problem is the problem of searching for mobile intruders in asimple polygon by a single mobile searcher having various degrees of visibility. This paper considers the open edge variant of the problem in which the given polygon P must be searched without allowing undetected intruders to reach a given edge u, under an additional assumption that any number of intruders can leave and enter P through another edge v at any time. One may view P as representing a corridor with two open exits u and v, and the task of the searcher is to force all the intruders out of P through v (but not u). We present a simple necessary condition for a polygon to be searchable in this manner by the searcher having a light bulb, and then show that the same condition is sufficient for the polygon to be searchable by the searcher having two flashlights. The time complexity of generating a search schedule is also discussed.

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号