search query: @indexterm target search problem / total: 14
reference: 11 / 14
| Author: | Thomas, L. C. Washburn, A. R. |
| Title: | Dynamic search games. |
| Journal: | Operations Research
1991 : MAY-JUN, VOL. 39:3, p. 415-422 |
| Index terms: | TARGET SEARCH PROBLEM GAME THEORY |
| Language: | eng |
| Abstract: | A dynamic search game /DSG/ is a game played between an intelligent searcher and an intelligent target, both of whom can move around on a grid divided into cells. The searcher has a sequence of looks in which to detect the target, while the target chooses a new cell after each look in the knowledge of what cells have been searched so far. These games are a kind of exhaustive game for which efficient computation is possible, particularly in the unitary special case. The assumption that the target's motion is unrestricted is central to the theory. DSGs are of some intrinsic interest, and can also be used to obtain lower bounds or approximations to the detection probability in games where evader motion is restricted. |
SCIMA