Rendezvous-Evasion Search in Two Boxes
Operations Research
Protocols with No Acknowledgment
Operations Research
Markovian search games in heterogeneous spaces
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On a Markov Game with One-Sided Information
Operations Research
| Hi-index | 0.00 |
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 probabilityc) or a type (ii) evader. This formulation models search problems like that for a lost teenager who may be a "runaway," or a lost intelligence agent who may be a defector. In any given search context, it produces a continuum of search problems G( c), 0脗 = c脗 =脗 1, linking a zero-sum searchgame (withc = 0) to a rendezvous problem (withc = 1). These models thus provide a theoretical bridge between two previously distinct parts of search theory, namely searchgames and rendezvous search.