Forestalling Detection in Two-Sided Search

  • Kōji Iida
Part of the Lecture Notes in Statistics book series (LNS, volume 70)


In this chapter, we will investigate a forestalling detection problem in a two-sided search situation. At present, studies of the two-sided search problem are classified into two types, the hide-and-search problem and the evasion-and-search problem. In the hide-and-search problem, the target hides itself, selecting a point in the target space and stays there inactive during the search. A searcher wants to find the target efficiently, whereas the target does want not to be found. Usually, the game theoretical approach is taken and the optimal strategies for both sides are sought. The works of Neuts (1963), Johnson (1964), Danskin (1968), and Gittins and Roberts (1979) are the studies of this category. In the evasion-and-search problem, the target is assumed to be able to evade the searcher, observing the searcher’s current position during the search. The problem is formulated as a sequential multistage search game. Norris (1962), Sakaguchi (1973), Washburn (1980b), and Nakai (1986a) investigated this problem. Nakai (1986b) considered a search game in which two searchers compete with each other in detecting a stationary and unconscious target.


Detection Probability Sweep Rate Target Space Random Search Markov Chain Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Kōji Iida
    • 1
  1. 1.Department of Applied PhysicsThe National Defense AcademyYokosukaJapan

Personalised recommendations