Random disambiguation paths for traversing a mapped hazard field

Naval Research Logistics, Volume 52, Issue 3, 2005, Pages 285-292.

被引用20|引用|浏览7|DOI:https://doi.org/10.1002/nav.20071
其它链接academic.microsoft.com

摘要

We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability—for a cost—to determine whether or not the hazard is re...更多

代码

数据

下载 PDF 全文
您的评分 :
0

 

标签
评论