A stationary object is hidden in location i, i=1,2,...,K, with probability p i . There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches, so...

We study a new search problem in continuous time. In the traditional approach, the basic formulation is to maximize the expected (discounted) return obtained by taking a job, net of search cost incurred until the job is taken. Implicitly assumed in the traditional modeling is that the agent has...

A stationary object is hidden in location i, i=1,2,...,K, with probability p <Subscript> i </Subscript>. There are M sensors available and each location can be searched by at most one sensor at each instant of time. Each search of a location takes one unit of time and is conducted independently of previous searches,...</subscript>

We study a new search problem in continuous time. In the traditional approach, the basic formulation is to maximize the expected (discounted) return obtained by taking a job, net of search cost incurred until the job is taken. Implicitly assumed in the traditional modeling is that the agent has...

In this paper we study the problem of patrolling a perimeter. The general situation considered here can correspond to different tactical problems and it is studied from the point of view of game theory. To put the ideas in a context we describe it as follows. An intruder seeks to carry out a...