Article ID: | iaor20031875 |
Country: | United States |
Volume: | 50 |
Issue: | 2 |
Start Page Number: | 311 |
End Page Number: | 323 |
Publication Date: | Mar 2002 |
Journal: | Operations Research |
Authors: | Gal Shmuel, Alpern Steve |
There is an extensive theory regarding optimal continuous path search for a mobile or immobile ‘target’. The traditional theory assumes that the target is one of three types: (i) an object with a known distribution of paths, (ii) a mobile or immobile hider who wants to avoid or delay capture, or (iii) a rendezvouser who wants to find the searcher. This paper introduces a new type of search problem by assuming that aims of the target are not known to the searcher. The target may be either a type (iii) cooperator (with a known cooperation probability