Double coordinated search problem

Teamah, Abd-Elmoneim A. M.; Abou-Gabal, Hamdy M.; Afifi, W. A.

doi:10.12988/ijcms.2013.13037

Cited by 3 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reyniers studied the coordinated search by 2 searchers for a lost target on an interval and on the line . Teamah et al studied the coordinated search by 4 searchers for a lost target. The coordinated search for a randomly located and static target on the plane has been given by Teamah et al There might be some similarity between this problem and the well‐known linear search given by Beck and Stone .…”

Section: Introductionmentioning

confidence: 98%

Coordinated search for a lost target on one of 2 intersecting lines

Abou-Gabal

2018

Math Methods in App Sciences

View full text Add to dashboard Cite

MSC Codes: 60K30; 90B40This paper addresses the coordinated search problem, where a hidden target is randomly located and static on one of 2 intersecting lines. Two searchers start the search for the lost target from the intersection point of the 2 lines, and each searcher aims to detect the target on his line. We study the problem of minimizing the expected time for the return of one of the searchers to the intersection point after the other searcher meets the target. We find the necessary conditions for the optimal search strategy.

show abstract

Section: Introductionmentioning

confidence: 98%

Coordinated search for a lost target on one of 2 intersecting lines

Abou-Gabal

2018

Math Methods in App Sciences

View full text Add to dashboard Cite

show abstract

“…Reyniers gave necessary and sufficient conditions for the existence of an optimal search strategy when the target density is continuous and decreasing. Recently, this problem has been studied on the line when the target has asymmetric distribution by Teamah et al [4]. However, Teamah et al have the optimal search strategy to find the asymmetrically distributed targets; they also show that some previous studies are special cases from their results.…”

Section: Introductionmentioning

confidence: 99%

On Probabilistic Cooperative Search Model to Detect a Lost Target in N-Disjoint Areas

El-Hadidy,

Fakharany

2024

Stat., optim. inf. comput.

View full text Add to dashboard Cite

This paper presents a new probabilistic coordinated search technique for finding a randomly located target in n-disjoint known regions by using n-searchers. Each region contains one searcher. The searchers use advanced technology to communicate with each other. The purpose of this paper is to obtain the candidate utility function namely the expected value of the time for detecting the target. Additionally, to minimize this expected value given a restricted amount of time. We present a special case when the target has a multinomial distribution. This important for searching about a valuable target missing at sea or lost at wilderness area.

show abstract

Quasi-Coordinate Search for a Randomly Moving Target

Teamah¹,

Afifi²

2019

JAMP

Self Cite

View full text Add to dashboard Cite

In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.

show abstract

Double coordinated search problem

Cited by 3 publications

References 2 publications

Coordinated search for a lost target on one of 2 intersecting lines

Coordinated search for a lost target on one of 2 intersecting lines

On Probabilistic Cooperative Search Model to Detect a Lost Target in N-Disjoint Areas

Quasi-Coordinate Search for a Randomly Moving Target

Contact Info

Product

Resources

About