Rendez-vous search on a rectangular lattice

Rendez-vous search on a rectangular lattice

0.00 Avg rating0 Votes
Article ID: iaor20082446
Country: United States
Volume: 54
Issue: 5
Start Page Number: 492
End Page Number: 496
Publication Date: Aug 2007
Journal: Naval Research Logistics
Authors:
Abstract:

In a rendez-vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center.

Reviews

Required fields are marked *. Your email address will not be published.