...
首页> 外文期刊>Applied Mathematical Modelling >Multiplicative linear search for a brownian target motion
【24h】

Multiplicative linear search for a brownian target motion

机译:布朗目标运动的乘法线性搜索

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates a search problem for a brownian target motion on one of n-inter-sected real lines in which any information of the target position is not available to the searchers all the time. We have n-searchers start searching for the target from the origin that is the intersection point of these lines. Each of the searchers moves continuously along his line in both directions of the starting point. The purpose of this paper is to formulate a search model and find the condition under which the expected value of the first meeting time between one of the searchers and the target is finite. Also, we show the existence of the optimal search plan which minimizes the expected value of the first meeting time and find it.
机译:本文研究了n个相交实线之一上的布朗目标运动的搜索问题,在该运动中目标位置的任何信息都不总是可供搜索者使用。我们有n个搜索者开始从作为这些线的交点的原点搜索目标。每个搜索者都沿其线在起点的两个方向上连续移动。本文的目的是建立一个搜索模型,并找到一个条件,在该条件下,一个搜索者与目标之间的第一次会面时间的期望值是有限的。此外,我们显示了最佳搜索计划的存在,该计划可以最大程度地减少首次会议时间的期望值并找到它。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号