Random disambiguation paths for traversing a mapped hazard field

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 real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve‐valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero‐risk path, and we introduce a practically computable additive‐constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

贝叶斯参数估计在雷区范围估计中的应用

提出了以发现水雷位置信息为抽样点,在给定估计误差的条件下,使用贝叶斯参数估计方法进行雷区范围估计的思路。详细讨论了水雷服从均匀分布时使用贝叶斯参数估计方法估计雷区范围的问题,给出了相关公式的推导过程,并设法解决仿真中存在的中间数值过大的问题。仿真结果均在允许误差范围之内,这验证了算法的可行性。     

概率条件下雷区范围估计研究

为更正现有雷区范围估计算法因搜扫率处置不当而存在的矛盾与不足,研究了搜扫率条件下的雷区范围估计问题。分不规则雷区和规则雷线两种情况,依据极大似然估计的原理,推导出搜扫率条件下的雷区范围估计算法,并对改进算法与现有算法进行了分析比较和仿真示例验证。分析和示例表明新算法克服了现有算法的缺陷,能够更符合实际地解决雷区范围估计问题。