Search Games with Mobile and Immobile Hider

We consider search games in which the searcher moves along a continuous trajectory in a set $Q$ until he captures the hider, where $Q$ is either a network or a two (or more) dimensional region. We distinguish between two types of games; in the first type which is considered in the first part of the...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on control and optimization 1979-01, Vol.17 (1), p.99-122
Main Author: Gal, Shmuel
Format: Article
Language:English
Subjects:
Games
Probability distribution
Velocity
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider search games in which the searcher moves along a continuous trajectory in a set $Q$ until he captures the hider, where $Q$ is either a network or a two (or more) dimensional region. We distinguish between two types of games; in the first type which is considered in the first part of the paper, the hider is immobile while in the second type of games which is considered in the rest of the paper, the hider is mobile. A complete solution is presented for some of the games, while for others only upper and lower bounds are given and some open problems associated with those games are presented for further research.
ISSN:0363-0129
1095-7138
DOI:10.1137/0317009