The Generalized Search for a Randomly Moving Target

• 作者: Abdelmoneim Anwar Mohamed Teamah
• 来源期刊: 应用数学(英文)
• 学科: 医学
• 关键词: STOCHASTIC Process EXPECTED VALUE Linear SEARCH Optimal SEARCH PLAN
• 年，卷（期）: 2014,（4）
• 页码范围: 642-652
• 页数: 11页
• 分类号: R73

摘要

A target is assumed to move randomly on one of two disjoint lines L1 and L2 according to a stochastic process . We have two searchers start looking for the lost target from some points on the two lines separately. Each of the searchers moves continuously along his line in both directions of his starting point. When the target is valuable as a person lost on one of disjoint roads, or is serious as a car filled with explosives which moves randomly in one of disjoint roads, in these cases the search effort must be unrestricted and then we can use more than one searcher. In this paper we show the existence of a search plan such that the expected value of the first meeting time between the target and one of the two searchers is minimum.