Premium
Coordinated search for a lost target on one of 2 intersecting lines
Author(s) -
AbouGabal Hamdy M.
Publication year - 2018
Publication title -
mathematical methods in the applied sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.719
H-Index - 65
eISSN - 1099-1476
pISSN - 0170-4214
DOI - 10.1002/mma.4916
Subject(s) - intersection (aeronautics) , point (geometry) , line (geometry) , mathematics , line search , search theory , mathematical optimization , search problem , computer science , geometry , transport engineering , engineering , computer security , economics , radius , microeconomics
This 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.